Searcharxiv⌕ Search

arXiv subjects

Laurent Bartholdi

Publications and source records attributed to Laurent Bartholdi.

At least 91 records · Page 5Linked to original sources

The congruence subgroup problem for branch groups

We state and study the congruence subgroup problem for groups acting on rooted tree, and for branch groups in particular. The problem is reduced to the computation of the congruence kernel, which we split into two parts: the branch kernel and the rigid kernel. In the case of regular branch groups, we prove that the first one is Abelian while the second has finite exponent. We also establish some rigidity results concerning these kernels. We work out explicitly known and new examples of non-trivial congruence kernels, describing in each case the group action. The Hanoi tower group receives particular attention due to its surprisingly rich behaviour.

math.GR↗

Counting Paths in Graphs

We give a simple combinatorial proof of a formula that extends a result by Grigorchuk (rediscovered by Cohen) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of `bumps' on paths in a graph: in a $d$-regular (not necessarily transitive) non-oriented graph let the series $G(t)$ count all paths between two fixed points weighted by their length $t^{length}$, and $F(u,t)$ count the same paths, weighted as $u^{number of bumps}t^{length}$. Then one has $$F(1-u,t)/(1-u^2t^2) = G(t/(1+u(d-u)t^2))/(1+u(d-u)t^2).$$ We then derive the circuit series of `free products' and `direct products' of graphs. We also obtain a generalized form of the Ihara-Selberg zeta function.

math.CO↗

On amenability of group algebras, II: graded algebras

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a mistake in Lemma 4.3, the main statements of the present paper should not be considered as proven. The results in Sections 2 and 3 are nevertheless valid.

math.GR↗

On amenability of automata groups

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups ("Mother groups") which is done by analyzing the asymptotic properties of random walks on these groups.

math.GR↗

Iterated Monodromy Groups of Quadratic Polynomials, I

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and relations for these groups, and study some of their properties, like torsion and `branchness'.

math.GR↗

On growth and torsion of groups

We give a subexponential upper bound and a superpolynomial lower bound on the growth function of the Fabrykowski-Gupta group. As a consequence, we answer negatively a question by Longobardi, Maj and Rhemtulla about characterizing groups containing no free subsemigroups on two generators.

math.GR↗

A converse to Moore's theorem on cellular automata

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that amenability could be characterized by cellular automata. We prove the first part of that conjecture.

math.CO↗

A nilpotent quotient algorithm for L-presented groups

The main part of this paper contains a description of a nilpotent quotient algorithm for L-presented groups and a report on applications of its implementation in the computer algebra system GAP. The appendix introduces two new infinite series of L-presented groups. Apart from being of interest in their own right, these new L-presented groups serve as examples for applications of the nilpotent quotient algorithm.

math.GR↗

A Mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine (three states over a two-symbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like n^2.4401..., where this constant is 1 + log(2)/log((1+sqrt(5))/2); that the semigroup satisfies the identity g^6=g^4; and that its lattice of two-sided ideals is a chain.

math.GR↗

On Amenability of Group Algebras, I

We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group ring KG is amenable for some (and therefore for any) field K.

math.GR↗

Thurston equivalence of topological polynomials

We answer Hubbard's question on determining the Thurston equivalence class of ``twisted rabbits'', i.e. images of the ``rabbit'' polynomial under n-th powers of the Dehn twists about its ears. The answer is expressed in terms of the 4-adic expansion of n. We also answer the equivalent question for the other two families of degree-2 topological polynomials with three post-critical points. In the process, we rephrase the questions in group-theoretical language, in terms of wreath recursions.

math.DS↗

Some solvable automaton groups

It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1,m), for m not +/-1. In addition, it is shown that, for any relatively prime integers m,n>=2, the pair of Baumslag-Solitar groups BS(1,m) and BS(1,n) can be realized by a pair of dual automata. The examples are then used to illustrate more general connections between Schreier graphs, composition of automata and dual automata.

math.GR↗

The Automorphism Tower of Groups acting on Rooted Trees

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such well-known examples as the group G studied by R. Grigorchuk, and the group H studied by N. Gupta and the second author. In this paper, we pursue the larger theme of towers of automorphisms of groups of tree isometries such as G and H. We describe this tower for all groups acting on the binary rooted tree which decompose as infinitely iterated wreath products. Furthermore, we describe fully the towers of G and H. More precisely, the tower of G is infinite countable, and the terms of the tower are 2-groups. Quotients of successive terms are infinite elementary abelian 2-groups. In contrast, the tower of H has length 2, and its terms are {2,3}-groups. We show that the quotient aut^2(H)/aut(H) is an elementary abelian 3-group of countably infinite rank, while aut^3(H)=aut^2(H).

math.GR↗

Horocyclic products of trees

Let T_1,..., T_d be homogeneous trees with degrees q_1+1,..., q_d+1>=3, respectively. For each tree, let h:T_j->Z be the Busemann function with respect to a fixed boundary point (end). Its level sets are the horocycles. The horocyclic product of T_1,...,T_d is the graph DL(q_1,...,q_d) consisting of all d-tuples x_1...x_d in T_1x...xT_d with h(x_1)+...+h(x_d)=0, equipped with a natural neighbourhood relation. In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. If d=2 and q_1=q_2=q then we obtain a Cayley graph of the lamplighter group (wreath product) (Z/qZ) wr Z. If d=3 and q_1=q_2=q_3=q then DL is the Cayley graph of a finitely presented group into which the lamplighter group embeds naturally. Also when d>=4 and q_1=...=q_d=q is such that each prime power in the decomposition of q is larger than d-1, we show that DL is a Cayley graph of a finitely presented group. This group is of type F_{d-1}, but not F_d. It is not automatic, but it is an automata group in most cases. On the other hand, when the q_j do not all coincide, DL(q_1,...,q_d) is a vertex-transitive graph, but is not the Cayley graph of a finitely generated group. Indeed, it does not even admit a group action with finitely many orbits and finite point stabilizers. The l^2-spectrum of the ``simple random walk'' operator on DL is always pure point. When d=2, it is known explicitly from previous work, while for d=3 we compute it explicitly. Finally, we determine the Poisson boundary of a large class of group-invariant random walks on DL. It coincides with a part of the geometric boundary of DL.

math.GR↗

Automata, Groups, Limit Spaces, and Tilings

We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting ``nicely'' on a tree gives rise to a self-covering of a topological groupoid, and how the group can be reconstructed from the groupoid and its covering. The connection is via finite-state automata. These define decomposition rules, or self-similar tilings, on leaves of the solenoid associated with the covering.

math.GR↗

Branch Groups

This is a long introduction to the theory of "branch groups": groups acting on rooted trees which exhibit some self-similarity features in their lattice of subgroups.

math.GR↗

Infinite groups with large balls of torsion elements and small entropy

We exhibit infinite, solvable, virtually abelian groups with a fixed number of generators, having arbitrarily large balls consisting of torsion elements. We also provide a sequence of 3-generator non-virtually nilpotent polycyclic groups of algebraic entropy tending to zero. All these examples are obtained by taking appropriate quotients of finitely presented groups mapping onto the first Grigorchuk group.

math.GR↗