We give an upper bound for the number of ``overlattices'' in the automorphism group of a tree, containing a fixed lattice with index n. For an example of a lattice in the automorphism group of a 2p-regular tree whose quotient is a loop, we obtain a lower bound of the asymptotic behavior as well.
Harary and Palmer announced an enumeration problem of labelled self-complementary graphs at the end of their book (Graphical Enumeration, Academic Press, New York and London, 1973). This paper resolves this problem. A method for solving this problem leads to the derivation of following formulas: (a) A formula on the number of labelled graphs with the given order of automorphism groups of those graphs. (b) A formula on the number of unlabelled graphs with the given order of automorphism groups of those graphs. (c) A formula on the number of labelled self-complementary graphs with the given orde…
Given an automorphism of a free group $F_n$, we consider the following invariants: $e$ is the number of exponential strata (an upper bound for the number of different exponential growth rates of conjugacy classes); $d$ is the maximal degree of polynomial growth of conjugacy classes; $R$ is the rank of the fixed subgroup. We determine precisely which triples $(e,d,R)$ may be realized by an automorphism of $F_n$. In particular, the inequality $e\le (3n-2)/4}$ (due to Levitt-Lustig) always holds. In an appendix, we show that any conjugacy class grows like a polynomial times an exponential under i…
We generalize the combinatorial approaches of Rapaport and Higgins--Lyndon to the Whitehead algorithm. We show that for every automorphism $φ$ of a free group $F$ and every word $u\in F$ there exists a finite multiset of words $S_{u,φ}$ satisfying the following property: For every cyclic word $w$, the number of times $u$ appears as a subword of $φ\left(w\right)$ depends only on the appearances of words in $S_{u,φ}$ as subwords of $w$. We use this fact to construct a faithful representation of $\text{Out}\left(F_{n}\right)$ on an inverse limit of $\mathbb{Z}$-modules, so that each automorphism …
Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism group of a finite p-group is almost always a p-group. The asymptotics in our theorem involve fixing any two of the following parameters and letting the third go to infinity: the lower p-length, the number of generators, and p. The proof of this theorem depends on a variety of topics: counting subgroups of a p-group; analyzing the lower p-series of a free gr…
In this paper we define a quantity called the rank of an outer automorphism of a free group which is the same as the index introduced in [D. Gaboriau, A. Jaeger, G. Levitt and M. Lustig, `An index for counting fixed points for automorphisms of free groups', Duke Math. J. 93 (1998) 425-452] without the count of fixed points on the boundary. We proceed to analyze outer automorphisms of maximal rank and obtain results analogous to those in [D.J. Collins and E. Turner, `An automorphism of a free group of finite rank with maximal rank fixed point subgroup fixes a primitive element', J. Pure and App…
It is well-known that the automorphism towers of infinite centreless groups of cardinality kappa terminate in less than (2^{kappa})^+ steps. But an easy counting argument shows that (2^{kappa})^+ is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better bound using ZFC.
Let $1 \le r < n$ be integers. We give a proof that the group $\mathop{\mathrm{Aut}}({X_{n}^{\mathbb{N}}, σ_{n}})$ of automorphisms of the one-sided shift on $n$ letters embeds naturally as a subgroup $\mathcal{H}_{n}$ of the outer automorphism group $\mathop{\mathrm{Out}}({G_{n,r}})$ of the Higman-Thompson group $G_{n,r}$. From this, we can represent the elements of $\mathop{\mathrm{Aut}}({X_{n}^{\mathbb{N}}, σ_{n}})$ by finite state non-initial transducers admitting a very strong synchronizing condition. Let $H \in \mathcal{H}_{n}$ and write $|H|$ for the number of states of the minimal tran…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that these results can be used in order to count the number of near vector spaces of a given dimension over a given nearfield, up to isomorphism.
The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where the $F^*_i(G)$ is the generalized Fitting series: $F^*_1(G)=F^*(G)$ and $F^*_{i+1}(G)$ is the inverse image of $F^*(G/F^*_{i}(G))$. It is proved that if $G$ admits a soluble group of automorphisms $A$ of coprime order, then $h^*(G)$ is bounded in terms of $h^* (C_G(A))$, where $C_G(A)$ is the fixed-point subgroup, and the number of prime factors of $|A|$ counting multiplicities. The result follows from the special case when $A=\langleφ\rangle$ is of prime order, where it is proved …
Define $QC(n)$ to be the number of quasiplatonic topological actions of the cyclic group $C_n$ on surfaces of genus at least two. We use formulas of Benim and Wootton to give an explicit formula for $QC(n)$. In addition, we relate the number of quasiplatonic topological actions of $C_n$ to the number of regular dessins d'enfants having $C_n$ as a group of automorphisms.
We prove sharp upper and lower bounds for generalized Calderón's sums associated to frames on LCA groups generated by affine actions of cocompact subgroup translations and general measurable families of automorphisms. The proof makes use of techniques of analysis on metric spaces, and relies on a counting estimate of lattice points inside metric balls. We will deduce as special cases Calderón-type inequalities for families of expanding automorphisms as well as for LCA-Gabor systems.
In this article we prove a conjecture of A. Lubotzky: let G = G_0(K), where K is a local field of characteristic p>5, G_0 is a simply connected, absolutely almost simple K-group of K-rank at least 2. We give the rate of growth of r_x(G) :={H< G| H a lattice in G; vol(G/H)<x}/~, where H_1\simH_2 if and only if there is an abstract automorphism t of G such that H_2 =t(H_1). We also study the rate of subgroup growth s_x(H) of any lattice H in G. As a result we show that these two functions have the same rate of growth which proves Lubotzky's conjecture. Along the way, we also study the rate of gr…
The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets. We provide exact formulas for the total number of orbits and the number of orbits having a given number of isomorphic representatives. We also provide exact formulas for the total number of unlabeled (i.e., defined up to a rotation) max…
Graphs embedded into surfaces have many important applications, in particular, in combinatorics, geometry, and physics. For example, ribbon graphs and their counting is of great interest in string theory and quantum field theory (QFT). Recently, Koch, Ramgoolam, and Wen [Nuclear Phys.\,B {\bf 870} (2013), 530--581] gave a refined formula for counting ribbon graphs and discussed its applications to several physics problems. An important factor in this formula is the number of surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group. The aim of this paper is to give an expl…
We introduce new zeta functions related to an endomorphism $ϕ$ of a discrete group $Γ$. They are of two types: counting numbers of fixed ($ρ\sim ρ\circϕ^n$) irreducible representations for iterations of $ϕ$ from an appropriate dual space of $Γ$ and counting Reidemeister numbers $R(ϕ^n)$ of different compactifications. Many properties of these functions and their coefficients are obtained. In many cases it is proved that these zeta functions coincide. The Gauss congruences are proved. Useful asymptotic formulas for the zeta functions are found. Rationality is proved for some examples, which giv…