English
Related papers

Related papers: Counting overlattices in automorphism groups of tr…

200 papers

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

Group Theory · Mathematics 2008-10-10 Miklos Abert , Yair Glasner

We construct a model for the space of automorphisms of a connected p-compact group in terms of the space of automorphisms of its maximal torus normalizer and its root datum. As a consequence we show that any homomorphism to the outer…

Algebraic Topology · Mathematics 2014-11-11 Kasper K. S. Andersen , Jesper Grodal

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Group Theory · Mathematics 2017-05-01 Marius Tărnăuceanu , László Tóth

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…

Group Theory · Mathematics 2021-01-27 Max Carter , George A. Willis

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…

Probability · Mathematics 2015-03-11 Lorenz A. Gilch

In a pervious paper Weidmann shows that there a bound on the number of orbits of edges in a tree on which a finitely generated group acts $(k,C)$-acylindrically. In this paper we extend this result to actions which are $k$-acylindrical…

Group Theory · Mathematics 2021-02-22 Michael Edward Hill

We consider the lattice of supercharacter theories, in the sense of Diaconis and Isaacs, of the cyclic group of order n. We find necessary and sufficient conditions on n for that lattice to be upper or lower semimodular.

Representation Theory · Mathematics 2012-03-09 Samuel G. Benidt , William R. S. Hall , Anders O. F. Hendrickson

The maximal number of automorphisms of a Mumford curve over a non-archimedean valued field of positive characteristic is known. In this note, the unique family of curves that attains this bound in genus not equal to 5,6,7 or 8 is explicitly…

Algebraic Geometry · Mathematics 2007-05-23 Gunther Cornelissen , Fumiharu Kato

We develop a theory of loops with involution. On this basis we define a Cayley-Dickson doubling on loops, and use it to investigate the lattice of varieties of loops with involution, focusing on properties that remain valid in the…

Combinatorics · Mathematics 2025-01-03 Adam Chapman , Ilan Levin , Uzi Vishne , Marco Zaninelli

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

Representation Theory · Mathematics 2025-12-08 GyeongHyeon Nam , Anna Puskás

In this article, we study the automorphism group of the cyclic orbifold of a vertex operator algebra associated with a rootless even lattice for a lift of a fixed-point free isometry of odd prime order $p$. We prove that such a cyclic…

Quantum Algebra · Mathematics 2024-09-25 Ching Hung Lam , Hiroki Shimakura

The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group and so on, iterating transfinitely. Each group maps into the next using inner automorphisms and one takes a direct limit…

Logic · Mathematics 2007-05-23 Joel David Hamkins

By modifying the automaton used by P{\"o}nitz and Tittman [4], and considering loops of length up to 26, we obtain 2.662343 as an upper bound for the connective constant in the lattice Z 2 .

Combinatorics · Mathematics 2022-12-07 Olivier Couronné

A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…

Combinatorics · Mathematics 2022-03-10 Antoine Genitrini , Bernhard Gittenberger , Manuel Kauers , Michael Wallner

To determine the global root number of an elliptic curve defined over a number field, one needs to understand all the local root numbers. These have been classified except at places above 2, and in this paper we attempt to complete the…

Number Theory · Mathematics 2013-09-23 T. Dokchitser , V. Dokchitser

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

Geometric Topology · Mathematics 2014-02-26 Gregory Bell , Koji Fujiwara

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski

The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…

Strongly Correlated Electrons · Physics 2008-05-16 Alexander Engstrom

Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…

Combinatorics · Mathematics 2026-03-03 Peter Johnson , Shayne Nochumson

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

Number Theory · Mathematics 2010-03-16 William D. Banks , Francesco Pappalardi , Igor E. Shparlinski