English
Related papers

Related papers: First-order sentences in random groups I: universa…

200 papers

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

Group Theory · Mathematics 2026-05-01 Narutaka Ozawa

It was shown in Part I that there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski-dense. Here we show…

Group Theory · Mathematics 2022-12-19 Emmanuel Breuillard , Robert Guralnick , Michael Larsen

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

Combinatorics · Mathematics 2012-02-01 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

Logic · Mathematics 2007-05-23 Oleg Belegradek

Let $C_1,\ldots,C_e$ be noncentral conjugacy classes of the algebraic group $G=SL_n(k)$ defined over a sufficiently large field $k$, and let $\Omega:=C_1\times \ldots \times C_e$. This paper determines necessary and sufficient conditions…

Group Theory · Mathematics 2020-11-03 Spencer Gerhardt

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

Group Theory · Mathematics 2024-02-09 Larsen Louder , Henry Wilton

We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…

Logic · Mathematics 2013-11-11 Kyle Riggs

We consider languages generated by weighted context-free grammars. It is shown that the behaviour of large texts is controlled by saddle-point equations for an appropriate generating function. We then consider ensembles of grammars, in…

Disordered Systems and Neural Networks · Physics 2022-10-03 Eric De Giuli

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

Group Theory · Mathematics 2025-11-03 Costantino Delizia , Michele Gaeta , Carmine Monetta

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

Group Theory · Mathematics 2019-09-17 Timothy C. Burness , Scott Harper

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

Let $G$ be a finite additive abelian group with exponent $n>1$, and let $a_1,\ldots,a_{n-1}\in G$. We show that there is a permutation $\sigma\in S_{n-1}$ such that all the elements $sa_{\sigma(s)}\ (s=1,\ldots,n-1)$ are nonzero if and only…

Number Theory · Mathematics 2017-12-12 Fan Ge , Zhi-Wei Sun

We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…

Group Theory · Mathematics 2014-09-26 Sylvain Barre , Mikael Pichot

Let $w=w(x_1,\ldots,x_r)$ be an outer commutator word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables. This applies in particular to words of the form…

Group Theory · Mathematics 2024-04-02 Gustavo A. Fernandez-Alcober , Matteo Pintonello

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

Logic in Computer Science · Computer Science 2015-07-01 Nerio Borges , Blai Bonet

In [FGRS1,FGRS2] the relationship between the universal and elementary theory of a group ring $R[G]$ and the corresponding universal and elementary theory of the associated group $G$ and ring $R$ was examined. Here we assume that $R$ is a…

Group Theory · Mathematics 2023-06-22 Benjamin Fine , Anthony Gaglione , Martin Kreuzer , Gerhard Rosenberger , Dennis Spellman

We define a new class of sets -- stable sets -- of primes in number fields. For example, Chebotarev sets $P_{M/K}(\sigma)$, with $M/K$ Galois and $\sigma \in \Gal(M/K)$, are very often stable. These sets have positive (but arbitrary small)…

Number Theory · Mathematics 2016-02-24 Alexander Ivanov

We show that there is a sentence $\varphi$ in the first order language of groups such that a finitely generated group $\Gamma$ satisfies $\varphi$ if and only if $\Gamma$ is isomorphic to a group of the form $\mathrm{PSL}_n(O)$, where $n…

Group Theory · Mathematics 2020-10-19 Nir Avni , Chen Meiri

Let G be a finite group of nilpotency class 2 and w a group word. In this short paper we show that the probability that a random n-tuple of elements from G satisfies w is at least one over the order of G. This answers a special case of a…

Group Theory · Mathematics 2011-01-25 Matthew Levy

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh
‹ Prev 1 4 5 6 7 8 10 Next ›