Related papers: Counting overlattices in automorphism groups of tr…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted P\'olya trees. In both cases, we prove that it asymptotically follows a log-normal distribution and provide asymptotic…

We show that there is no uniform upper bound on |Out(Aut(A))| when A ranges over all right-angled Artin groups. This is in contrast with the cases where A is free or free abelian: for all n, Dyer-Formanek and Bridson-Vogtmann showed that…

We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…

We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

We study new asymptotic invariant of a pair consisting of a group and a subgroup, which we call Commensurizer Growth. We compute the commensurizer growth for several examples, concentrating mainly on the case of a locally compact…

We classify the symplectic automorphism groups for cubic fourfolds. The main inputs are the global Torelli theorem for cubic fourfolds and the classification of the fixed-point sublattices of the Leech lattice. Among the highlights of our…

We show that for every g > 1 there is a compact arithmetic Riemann surface of genus g with at least 4(g-1) automorphisms, and that this lower bound is attained by infinitely many genera, the smallest being 24.

Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees…

We find asymptotic lower bounds for the numbers of both Beauville and non-Beauville $2$-generator finite $p$-groups of a fixed order, which turn out to coincide with the best known asymptotic lower bound for the total number of…

In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most $4n$ distinct non-empty palindromes in a starlike tree with three…

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

For bounded pseudoconvex domains with finite type we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different points of the boundary, then the automorphism group has…

For a curve $X$ of genus $>1$ defined over a finite field, we present a criterion which allows us to state the non existence of automorphisms of order a power of a rational prime. We show how this criterion can be used to determine the…

Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.

We give a classification of iwip outer automorphisms of the free group, by discussing the properties of their attracting and repelling trees.

In their paper, Bounds on the Number of Edges in Hypertrees, G.Y. Katona and P.G.N. Szab\'o introduced a new, natural definition of hypertrees in $k$-uniform hypergraphs and gave lower and upper bounds on the number of edges. They also…

We establish the analogue for maps on trees of the result established in two papers by the first author for interval maps, that a continuous self- map for which all but countably many points have at least m preimages (and none have less…