English
Related papers

Related papers: Transitivity degrees of countable groups and acyli…

200 papers

For a countable group G and a multiplier c on G with values in the circle, we study the property of G having a unitary projective c-representation which is both irreducible and projectively faithful. We show that this property is equivalent…

Group Theory · Mathematics 2015-02-04 Bachir Bekka , Pierre de la Harpe

Suppose $G$ is a finitely presented group that is hyperbolic relative to ${\bf P}$ a finite collection of 1-ended finitely generated proper subgroups of $G$. If $G$ and the ${\bf P}$ are 1-ended and the boundary $\partial (G,{\bf P})$ has…

Group Theory · Mathematics 2021-05-03 Matthew Haulmark , Michael Mihalik

Let $G$ be an acylindrically hyperbolic group. We prove that Bernoulli bond percolation on every Cayley graph of $G$ has a nonuniqueness phase, in which there are infinitely many infinite clusters. This generalizes Hutchcroft's result for…

Group Theory · Mathematics 2025-08-14 Inhyeok Choi , Donggyun Seo

We show that elementary amenable groups, which have a bound on the orders of their finite subgroups, admit a finite dimensional model for the classifying space with virtually cyclic isotropy.

Group Theory · Mathematics 2012-01-20 Martin Fluch , Brita E. A. Nucinkis

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

Dynamical Systems · Mathematics 2023-10-05 Zihan Xia

Let $M$ be a cusped finite-volume hyperbolic three-manifold with isometry group $G$. Then $G$ induces a $k$-transitive action by permutation on the cusps of $M$ for some integer $k\ge 0$. Generically $G$ is trivial and $k=0$, but $k>0$ does…

Geometric Topology · Mathematics 2020-03-04 Roger Vogeler

We initiate a quantitative study of measure equivalence (and orbit equivalence) between finitely generated groups, which extends the classical setting of $\mathrm L^p$ measure equivalence. In this paper, our main focus will be on amenable…

Group Theory · Mathematics 2022-04-18 Thiebout Delabie , Juhani Koivisto , François Le Maître , Romain Tessera

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

Logic · Mathematics 2019-08-16 John Clemens , Samuel Coskey , Stephanie Potter

We prove that every acylindrically hyperbolic group that has no non-trivial finite normal subgroup satisfies a strong ping pong property, the $P_{naive}$ property: for any finite collection of elements $h_1, \dots, h_k$, there exists…

Group Theory · Mathematics 2020-07-20 Carolyn R. Abbott , François Dahmani

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

Group Theory · Mathematics 2022-06-10 Michael Mihalik

We prove that if a countable group $\Gamma$ contains infinite commuting subgroups $H, H'\subset \Gamma$ with $H$ non-amenable and $H'$ ``weakly normal'' in $\Gamma$, then any measure preserving $\Gamma$-action on a probability space which…

Group Theory · Mathematics 2007-12-25 Sorin Popa

Given two positive integers n and c, we determine an upper bound, as a function of n and c, for the maximum order of a finite nilpotent transitive group of degree n and nilpotency class at most c.

Group Theory · Mathematics 2014-05-23 Eleonora Crestani , Pablo Spiga

A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of…

Combinatorics · Mathematics 2013-05-09 Wilfried Imrich , Simon M. Smith , Thomas W. Tucker , Mark E. Watkins

Assuming that every hyperbolic group is residually finite, we prove the congruence subgroup property for mapping class groups of hyperbolic surfaces of finite type. Under the same assumption, it follows that profinitely equivalent…

Group Theory · Mathematics 2024-11-26 Henry Wilton , Alessandro Sisto

We prove that, given a torsion-free relatively hyperbolic group G with non-relatively-hyperbolic peripherals, isomorphic finite index subgroups of G have the same index. This applies for instance to fundamental groups of finite-volume…

Group Theory · Mathematics 2025-09-05 Nir Lazarovich , Gon Rahamim , Alessandro Sisto

The question which motivates the article is the following: given a group acting on a CAT(0) cube complex, how can we prove that it is acylindrically hyperbolic? Keeping this goal in mind, we show a weak acylindricity of the action on the…

Group Theory · Mathematics 2019-08-26 Anthony Genevois

A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…

Group Theory · Mathematics 2011-12-14 John Bamberg , Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

An action of a group $G$ on a set $X$ is said to be quasi-n-transitive if the diagonal action of $G$ on $X^n$ has only finitely many orbits. We show that branch groups, a special class of groups of automorphisms of rooted trees, cannot act…

Group Theory · Mathematics 2021-11-24 Dominik Francoeur

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

Group Theory · Mathematics 2024-06-25 Jason Behrstock , Mark Hagen , Alexandre Martin , Alessandro Sisto

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

Logic in Computer Science · Computer Science 2019-07-01 Daniel Danielski , Emanuel Kieronski