We show that in the framework of the pinch technique the universal part of the parameter can be meaningfully de ned, beyond one loop. The universal part so obtained satis es the crucial requirements of gauge-independence, niteness, and process-independence, even when subleading contributions of the top quark are included. The mechanism which enforces the aforementioned properties is explained i...

The decidability of the niteness problem for automaton groups is a well-studied open question on Mealy automata. We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case. We provide a rst undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of t...

A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image com...

We consider the theory of database queries on a relational data model that includes a set of xed relations used to model arithmetic comparisons and operations. We describe how to extend several natural query languages such as rst-order logic, Datalog, and strati ed Datalog to to apply to databases in this model, and show that their relative expressive power is the same as it is for the standard...

A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...

Let G be a pro nite group. We de ne an S[[G]]-module to be a G-spectrum X that satis es certain conditions, and, given an S[[G]]-module X, we de ne the homotopy orbit spectrum XhG. When G is countably based and X satis es a certain niteness condition, we construct a homotopy orbit spectral sequence whose E2-term is the continuous homology of G with coefcients in the graded pro nite b Z[[G]]-mod...

We study iteration and recursion operators in the multiset relational model of linear logic and prove them nitary in the sense of the niteness spaces recently introduced by Ehrhard. This provides a denotational semantics of Gödel's system T and paves the way for a systematic study of a large class of algorithms, following the ideas of Girard's quantitative semantics in a standard algebraic sett...

We introduce automata over the (max; +) algebra: this formalism encompasses in particular (max; +) linear systems and a subclass of stochastic timed event graphs. Performance evaluation is considered in the worst, mean, and optimal cases. A simple algebraic reduction is provided for the worst case. The later cases are reduced to projective niteness properties of semigroups of matrices. The mean...

Identifying meaningful signal buried in noise is a problem of interest arising in diverse scenarios of datadriven modeling. We present here a theoretical framework for exploiting intrinsic geometry in data that resists noise corruption, and might be identifiable under severe obfuscation. Our approach is based on uncovering a valid complete inner product on the space of ergodic stationary finite...