Convex Hull of Arithmetic Automata

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata

Mountain trail formation and the active walker model

We extend the active walker model to address the formation of paths on gradients, which have been observed to have a zigzag form. Our extension includes a new rule which prohibits direct descent or ascent on steep inclines, simulating aversion to falling. Further augmentation of the model stops walkers from changing direction very rapidly as that would likely lead to a fall. The extended model predicts paths with qualitatively similar forms to the observed trails, but only if the terms suppressing sudden direction changes are included. The need to include terms into the model that stop rapid direction change when simulating mountain trails indicates that a similar rule should also be included in the standard active walker model.Comment: Introduction improved. Analysis of discretization errors added. Calculations from alternative scheme include

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form $\Theta(n^k)$, for some integer $k\leq d$, where $d$ is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal $k$. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a $k$ such that the termination complexity is $\Omega(n^k)$. Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis.Comment: arXiv admin note: text overlap with arXiv:1708.0925

Optomechanical Cavity Cooling of an Atomic Ensemble

We demonstrate cavity sideband cooling of a single collective motional mode of an atomic ensemble down to a mean phonon occupation number of 2.0(-0.3/+0.9). Both this minimum occupation number and the observed cooling rate are in good agreement with an optomechanical model. The cooling rate constant is proportional to the total photon scattering rate by the ensemble, demonstrating the cooperative character of the light-emission-induced cooling process. We deduce fundamental limits to cavity-cooling either the collective mode or, sympathetically, the single-atom degrees of freedom.Comment: Paper with supplemental material: 4+6 pages, 4 figures. Minor revisions of text. Supplemental material shortened by removal of supplementary figur

Renormalization : A number theoretical model

We analyse the Dirichlet convolution ring of arithmetic number theoretic functions. It turns out to fail to be a Hopf algebra on the diagonal, due to the lack of complete multiplicativity of the product and coproduct. A related Hopf algebra can be established, which however overcounts the diagonal. We argue that the mechanism of renormalization in quantum field theory is modelled after the same principle. Singularities hence arise as a (now continuously indexed) overcounting on the diagonals. Renormalization is given by the map from the auxiliary Hopf algebra to the weaker multiplicative structure, called Hopf gebra, rescaling the diagonals.Comment: 15 pages, extended version of talks delivered at SLC55 Bertinoro,Sep 2005, and the Bob Delbourgo QFT Fest in Hobart, Dec 200