103 research outputs found
From self-similar groups to self-similar sets and spectra
The survey presents developments in the theory of self-similar groups leading
to applications to the study of fractal sets and graphs, and their associated
spectra
Finite self-similar p-groups with abelian first level stabilizers
We determine all finite p-groups that admit a faithful, self-similar action
on the p-ary rooted tree such that the first level stabilizer is abelian. A
group is in this class if and only if it is a split extension of an elementary
abelian p-group by a cyclic group of order p.
The proof is based on use of virtual endomorphisms. In this context the
result says that if G is a finite p-group with abelian subgroup H of index p,
then there exists a virtual endomorphism of G with trivial core and domain H if
and only if G is a split extension of H and H is an elementary abelian p-group.Comment: one direction of theorem 2 extended to regular p-group
Profinite completion of Grigorchuk's group is not finitely presented
In this paper we prove that the profinite completion of
the Grigorchuk group is not finitely presented as a profinite
group. We obtain this result by showing that H^2(\mathcal{\hat
G},\field{F}_2) is infinite dimensional. Also several results are proven about
the finite quotients including minimal
presentations and Schur Multipliers
Hausdorff dimension of some groups acting on the binary tree
Based on the work of Abercrombie, Barnea and Shalev gave an explicit formula
for the Hausdorff dimension of a group acting on a rooted tree. We focus here
on the binary tree T. Abert and Virag showed that there exist finitely
generated (but not necessarily level-transitive) subgroups of AutT of arbitrary
dimension in [0,1].
In this article we explicitly compute the Hausdorff dimension of the
level-transitive spinal groups. We then show examples of 3-generated spinal
groups which have transcendental Hausdroff dimension, and exhibit a
construction of 2-generated groups whose Hausdorff dimension is 1.Comment: 10 pages; full revision; simplified some proof
On a conjecture of Atiyah
In this note we explain how the computation of the spectrum of the
lamplighter group from \cite{Grigorchuk-Zuk(2000)} yields a counterexample to a
strong version of the Atiyah conjectures about the range of -Betti numbers
of closed manifolds.Comment: 8 pages, A4 pape
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.Comment: 20 pages, 1 diagra
Applications of p-deficiency and p-largeness
We use Schlage-Puchta's concept of p-deficiency and Lackenby's property of
p-largeness to show that a group having a finite presentation with p-deficiency
greater than 1 is large, which implies that Schlage-Puchta's infinite finitely
generated p-groups are not finitely presented. We also show that for all primes
p at least 7, any group having a presentation of p-deficiency greater than 1 is
Golod-Shafarevich, and has a finite index subgroup which is Golod-Shafarevich
for the remaining primes. We also generalise a result of Grigorchuk on Coxeter
groups to odd primes.Comment: 23 page
On the Finiteness Problem for Automaton (Semi)groups
This paper addresses a decision problem highlighted by Grigorchuk,
Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton
(semi)groups.
For semigroups, we give an effective sufficient but not necessary condition
for finiteness and, for groups, an effective necessary but not sufficient
condition. The efficiency of the new criteria is demonstrated by testing all
Mealy automata with small stateset and alphabet. Finally, for groups, we
provide a necessary and sufficient condition that does not directly lead to a
decision procedure
Random matrices, non-backtracking walks, and orthogonal polynomials
Several well-known results from the random matrix theory, such as Wigner's
law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of
non-backtracking walks on a certain graph. Orthogonal polynomials with respect
to the limiting spectral measure play a role in this approach.Comment: (more) minor change
- …