English
Related papers

Related papers: On random presentations with fixed relator length

200 papers

In this article, we show super-rigidity of Gromov's random monster group. We prove that any morphism $\phi_\alpha$ from Gromov's random monster group $\Gamma_\alpha$ to the group $G$ has finite image for almost all $\alpha$, where $G$ is…

Group Theory · Mathematics 2025-02-18 Kajal Das

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there…

Group Theory · Mathematics 2019-06-25 Tomasz Odrzygóźdź

Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…

Probability · Mathematics 2025-04-10 Mathew D. Penrose , Xiaochuan Yang

We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…

Group Theory · Mathematics 2009-09-13 Mark Sapir , Iva Spakulova

Consider a random word $X^n=(X_1,\ldots ,X_n)$ in an alphabet consisting of $4$ letters, with the letters viewed either as $A$, $U$, $G$ and $C$ (i.e., nucleotides in an RNA sequence) or $\alpha$, $\bar{\alpha}$, $\beta$ and $\bar{\beta}$…

Group Theory · Mathematics 2022-01-20 Siddhartha Gadgil , Manjunath Krishnapur

This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of…

Artificial Intelligence · Computer Science 2015-10-07 Kewen Wang , Lian Wen , Kedian Mu

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \label{tau2pres_0}\langle A, C \mid…

Group Theory · Mathematics 2016-12-09 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

Group Theory · Mathematics 2015-04-07 Danny Calegari

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…

Group Theory · Mathematics 2013-02-19 Anastasia V. Kisil

We construct a random model for an $n$-fold branched cover of a finite acceptable $2$-complex $X$. This includes presentation $2$-complexes for finitely presented groups satisfying some mild conditions. For any $\lambda >0$, we show that as…

Group Theory · Mathematics 2026-01-08 Hyeran Cho , Jean-François Lafont , Rachel Skipper

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

Group Theory · Mathematics 2008-12-23 J. O. Button

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

Combinatorics · Mathematics 2011-05-11 Eric Babson , Christopher Hoffman , Matthew Kahle

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

Group Theory · Mathematics 2015-10-21 Alan J. Cain , Victor Maltcev

In the binomial $\ell$-gonal model for random groups, where the random relations all have fixed length $\ell\geq 3$ and the number of generators goes to infinity, we establish a double threshold near density $d=\frac{1}{\ell}$ where the…

Group Theory · Mathematics 2025-05-13 Emily Clement , John M. Mackay

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

Group Theory · Mathematics 2011-05-11 Eric Babson , Christopher Hoffman , Matthew Kahle

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Paul Schupp , Vladimir Shpilrain

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

Number Theory · Mathematics 2016-09-07 Pieter Moree

We exhibit a new presentation of the (equilateral) Von Dyck groups $D(2,3,n), \ n\ge 3$, in terms of two generators of order $n$ satisfying three relations, one of which is Artin's braid relation. By dropping the relation which fixes the…

Group Theory · Mathematics 2020-11-12 Orlin Stoytchev

We generalize and strengthen the theorem of Gromov that every compact Riemannian manifold of diameter at most D has a set of generators g_1,...,g_k of length at most 2D and relators of the form g_ig_m = g_j . In particular, we obtain an…

Differential Geometry · Mathematics 2013-09-16 Conrad Plaut , Jay Wilkins

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

Group Theory · Mathematics 2015-03-17 Danny Calegari , Alden Walker