English
Related papers

Related papers: Generic properties of Whitehead's Algorithm and is…

200 papers

If $G$ is a finitely generated group and $X$ is a Cayley graph of $G$, denote by $\mathcal{C}_1^X(G)$ the subgroup of all automorphisms of $X$ commensurating $G$ and fixing the vertex corresponding to the identity. Building on the work of…

Group Theory · Mathematics 2025-07-16 Dominik Francoeur

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Group Theory · Mathematics 2007-05-23 Matt Clay

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

The Whitehead Model of free groups can be used to measure the complexity, or degree, of automorphisms of free groups. The bound for the degree of the $f \circ g$ for deg$(f) =$ deg($g) = 0$ had previously been discovered. We extend this…

Group Theory · Mathematics 2023-05-16 Robert Rust

We verify a conjecture of Vershik by showing that Hall's universal countable locally finite group can be embedded as a dense subgroup in the isometry group of the Urysohn space and in the automorphism group of the random graph. In fact, we…

Logic · Mathematics 2020-05-05 Mahmood Etedadialiabadi , Su Gao , François Le Maître , Julien Melleray

We prove that the combinatorial Weisfeiler-Leman algorithm of dimension $(3k+4)$ is a complete isomorphism test for the class of all graphs of rank width at most $k$. Rank width is a graph invariant that, similarly to tree width, measures…

Data Structures and Algorithms · Computer Science 2023-05-30 Martin Grohe , Daniel Neuen

Motivated by analogous results for the symmetric group and compact Lie groups, we study the distribution of the number of fixed vectors of a random element of a finite classical group. We determine the limiting moments of these…

Combinatorics · Mathematics 2015-05-26 Jason Fulman , Dennis Stanton

We study the geometry of compact geodesic spaces with trivial first Betti number admitting large finite groups of isometries. We show that if a finite group $G$ acts by isometries on a compact geodesic space $X$ whose first Betti number…

Metric Geometry · Mathematics 2024-06-11 Sergio Zamora

Let G be any finitely generated infinite group. Denote by K(G) the FC-centre of G, i.e., the subgroup of all elements of G whose centralizers are of finite index in G. Let QI(G) denote the group of quasi-isometries of G with respect to word…

Group Theory · Mathematics 2007-05-23 Aniruddha C. Naolekar , Parameswaran Sankaran

We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and…

Operator Algebras · Mathematics 2008-05-22 Udo Baumgartner , Marcelo Laca , Jacqui Ramagge , George Willis

In this note, we prove, for instance, that the automorphism group of a rational manifold X which is obtained from CP^k by a finite sequence of blow-ups along smooth centers of dimension at most r with k>2r+2 has finite image in…

Complex Variables · Mathematics 2026-05-22 Turgay Bayraktar , Serge Cantat

Let $A$ be a finite non-abelian simple Mal'cev algebra, such as for example a finite simple non-abelian group or a finite simple non-zero ring. We show that the automorphism group of a filtered Boolean power of $A$ by the countable atomless…

Rings and Algebras · Mathematics 2025-09-25 Peter Mayr , Nik Ruškuc

We study the closed group of homeomorphisms of the boundary of real hyperbolic space generated by a cocompact Kleinian group $G_1$ and a quasiconformal conjugate $h^{-1}G_2 h$ of a cocompact group $G_2$. We show that if the conjugacy $h$ is…

Geometric Topology · Mathematics 2009-03-16 Kingshook Biswas

We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new…

Group Theory · Mathematics 2021-10-25 Dario Ascari

We analyse the geometry and complexity of the conjugacy problem in a family of free-by-cyclic groups $H_m=F_m\rtimes\mathbb{Z}$ where the defining free-group automorphism is positive and polynomially growing. We prove that the conjugator…

Group Theory · Mathematics 2025-06-03 Martin R. Bridson , Timothy R. Riley , Andrew W. Sale

In the free group $F_k$, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length…

Group Theory · Mathematics 2014-10-24 Doron Puder , Conan Wu

Relying on the theory of agrarian invariants introduced in previous work, we solve a conjecture of Friedl-Tillmann: we show that the marked polytopes they constructed for two-generator one-relator groups with nice presentations are…

Algebraic Topology · Mathematics 2020-04-29 Fabian Henneke , Dawid Kielak

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…

Group Theory · Mathematics 2024-05-07 Benjamin Sambale

We prove that one-relator groups are coherent, solving a well-known problem of Gilbert Baumslag. Our proof strategy is readily applicable to many classes of groups of cohomological dimension two. We show that fundamental groups of…

Group Theory · Mathematics 2025-02-05 Andrei Jaikin-Zapirain , Marco Linton

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

Combinatorics · Mathematics 2012-06-15 Teena Carroll , David Galvin , Prasad Tetali
‹ Prev 1 8 9 10 Next ›