English
Related papers

Related papers: Genericity of Filling Elements

200 papers

We prove that non-abelian free groups of finite rank at least 3 or of countable rank are not $\forall$-homogeneous. We answer three open questions from Kharlampovich, Myasnikov, and Sklinos regarding whether free groups, finitely generated…

Logic · Mathematics 2020-01-28 Olga Kharlampovich , Christopher Natoli

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

Group Theory · Mathematics 2018-11-28 Martin R Bridson , Dessislava H Kochloukova

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

Group Theory · Mathematics 2007-05-23 Robert Shwartz

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

Logic · Mathematics 2022-12-23 Olga Kharlampovich , Rizos Sklinos

Let $G$ be an acylindrically hyperbolic group on a $\delta$-hyperbolic space $X$. Assume there exists $M$ such that for any finite generating set $S$ of $G$, the set $S^M$ contains a hyperbolic element on $X$. Suppose that $G$ is…

Group Theory · Mathematics 2023-06-12 Koji Fujiwara

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

Group Theory · Mathematics 2013-02-05 Lucas Sabalka , Dmytro Savchuk

A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set $X$, such that every element of it can be written as a palindrome in the letters of $X$. Moreover, every…

Group Theory · Mathematics 2014-12-17 Elisabeth Fink , Andreas Thom

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p > 0$. We consider connected reductive subgroups $X$ of $G$ that contain a given distinguished unipotent element $u$ of $G$. A result of…

Group Theory · Mathematics 2020-01-20 Mikko Korhonen

We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…

Group Theory · Mathematics 2019-10-22 Montserrat Casals-Ruiz , Albert Garreta , Javier de la Nuez González

Let $W,W'\subseteq G$ be nonempty subsets in an arbitrary group $G$. The set $W'$ is said to be a complement to $W$ if $WW'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. We show that, if $W$ is finite then every…

Combinatorics · Mathematics 2021-09-06 Arindam Biswas , Jyoti Prakash Saha

In this paper, we give a sufficient and necessary condition for a regular element of a quantum cluster algebra $\mathcal{O}_q(\mathcal{X})$ to be universally polynomial. This resolves several conjectures by the first author on the…

Quantum Algebra · Mathematics 2023-02-09 Ivan Chi-Ho Ip , Jeff York Ye

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Group Theory · Mathematics 2021-12-06 Robert Lin

This paper, which is the last of a series of three papers, studies dynamical properties of elements of $\mathrm{Out}(F_{\tt n})$, the outer automorphism group of a nonabelian free group $F_{\tt n}$. We prove that, for every subgroup $H$ of…

Group Theory · Mathematics 2022-04-07 Yassine Guerch

We will give an example of a branch group $G$ that has exponential growth but does not contain any non-abelian free subgroups. This answers question 16 from \cite{Bartholdi} positively. The proof demonstrates how to construct a non-trivial…

Group Theory · Mathematics 2012-09-25 Elisabeth Fink

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann

A simple graph G is said to be well-f-covered, whenever any two maximal induced forest in G be of the same order. In this note, well-f-coveredness of lexicographic product of two graphs in case where the first component is empty, is…

Combinatorics · Mathematics 2021-08-23 Reza Jafarpour-Golzari

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

Group Theory · Mathematics 2008-01-03 R. Guralnick , B. Kunyavskii , E. Plotkin , A. Shalev

For any proper action of a non-elementary group $G$ on a proper geodesic metric space, we show that if $G$ contains a contracting element, then there exists a sequence of proper quotient groups whose growth rate tends to the growth rate of…

Group Theory · Mathematics 2020-08-03 Zunwu He , Jinsong Liu , Wenyuan Yang

An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…

Commutative Algebra · Mathematics 2020-04-02 Sophie Frisch , Sarah Nakato

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo