English
Related papers

Related papers: Growth of groups with incompressible elements, I

200 papers

We show that there are infinitely many commensurability classes of pseudomodular groups, thus answering a question raised by Long and Reid. These are Fuchsian groups whose cusp set is all of the rationals but which are not commensurable to…

Geometric Topology · Mathematics 2018-04-18 Beicheng Lou , Ser Peow Tan , Anh Duc Vo

This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…

Dynamical Systems · Mathematics 2020-04-28 Bernhard Reinke

In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms…

Combinatorics · Mathematics 2022-01-24 Darren Glass , Nathan Kaplan

Residual finiteness growth gives an invariant that indicates how well-approximated a finitely generated group is by its finite quotients. We briefly survey the state of the subject. We then improve on the best known upper and lower bounds…

Group Theory · Mathematics 2019-09-17 Khalid Bou-Rabee , Junjie Chen , Anastasiia Timashova

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

Combinatorics · Mathematics 2015-10-06 Olivier Bodini , Danièle Gardy , Bernhard Gittenberger , Zbigniew Gołębiewski

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

Number Theory · Mathematics 2017-06-19 Patrick Ingram

General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point…

Group Theory · Mathematics 2022-05-10 Attila Maróti , Saveliy V. Skresanov

We discuss some new results concerning Gap Conjecture on group growth and present a reduction of it (and its *-version) to several special classes of groups. Namely we show that its validity for the classes of simple groups and residually…

Group Theory · Mathematics 2012-09-19 Rostislav Grigorchuk

In this paper we investigate the asymptotic growth of the number of irreducible and connected components of the moduli space of surfaces of general type corresponding to certain families of surfaces isogenous to a higher product with group…

Algebraic Geometry · Mathematics 2015-07-22 Michael Lönne , Matteo Penegini

In this paper, we present a functorial method to define ramification groups, identifying them as inertia groups of an induced action on composite jet algebras. This framework lays the foundation for defining higher ramification groups for…

Algebraic Geometry · Mathematics 2024-09-25 Sophie Marques , Luigi Pagano

Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved…

Group Theory · Mathematics 2013-10-01 Martin Kassabov , Francesco Matucci

This paper studies the locally uniform exponential growth and product set growth for a finitely generated group $G$ acting properly on a finite product of hyperbolic spaces. Under the assumption of coarsely dense orbits or shadowing…

Group Theory · Mathematics 2024-07-23 Renxing Wan , Wenyuan Yang

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

Group Theory · Mathematics 2023-08-16 Koji Fujiwara , Zlil Sela

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

Dynamical Systems · Mathematics 2014-03-04 Van Cyr , Bryna Kra

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 Theory · Mathematics 2009-11-27 Laurent Bartholdi , Andre G. Henriques , Volodymyr V. Nekrashevych

We give two new examples of groups of intermediate growth, by a method that was first used by Bux and P\'erez. Our examples are the groups generated by the automata with the kneading sequences 11(0) and 0(011). By results of Nekrashevych,…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

Representation Theory · Mathematics 2019-10-10 Michael Hansen , Masanori Koyama , Matthew B. A. McDermott , Michael E. Orrison , Sarah Wolff

We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…

Group Theory · Mathematics 2007-05-23 D. V. Osin

We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth…

Formal Languages and Automata Theory · Computer Science 2016-08-18 Ines Klimann

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina