Related papers: An analogue to Dixon's theorem for automaton group…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
Dickson's commutative semifields are an important class of finite division algebras. We generalise Dickson's construction of commutative division algebras by doubling both finite field extensions and central simple algebras and not…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…
We study some diophantine properties of automatic real numbers and we present a method to derive irrationality measures for such numbers. As a consequence, we prove that the $b$-adic expansion of a Liouville number cannot be generated by a…
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
The ring $\mathbb Z_d$ of $d$-adic integers has a natural interpretation as the boundary of a rooted $d$-ary tree $T_d$. Endomorphisms of this tree (i.e. solenoid maps) are in one-to-one correspondence with 1-Lipschitz mappings from…
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…
Feit and Fine derived a generating function for the number of ordered pairs of commuting n by n matrices over the finite field F_q. This has been reproved and studied by Bryan and Morrison from the viewpoint of motivic Donaldson-Thomas…
We define a multiple Dirichlet series whose group of functional equations is the Weyl group of the affine Kac-Moody root system $\tilde{A}_n$, generalizing the theory of multiple Dirichlet series for finite Weyl groups. The construction is…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
We consider the probability theory, and in particular the moment problem and universality theorems, for random groups of the sort of that arise or are conjectured to arise in number theory, and in related situations in topology and…
The phenomenon of superconvergence is proved for all freely infinitely divisible distributions. Precisely, suppose that the partial sums of a sequence of free identically distributed, infinitesimal random variables converge in distribution…
We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…
We generalize the concept of divergence of finitely generated groups by introducing the upper and lower relative divergence of a finitely generated group with respect to a subgroup. Upper relative divergence generalizes Gersten's notion of…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
We construct rather general random ensembles that yield the optimal (isomorphic) estimate in the Dvoretzky-Milman Theorem. This is the first construction of non gaussian/spherical ensembles that exhibit the optimal behaviour. The ensembles…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…