English
Related papers

Related papers: Conciseness on normal subgroups and new concise wo…

200 papers

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

Group Theory · Mathematics 2007-05-23 Miklos Abert

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Logic in Computer Science · Computer Science 2007-05-23 Martin Ziegler , Klaus Meer

This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi

The power word problem for a group $G$ asks whether an expression $u_1^{x_1} \cdots u_n^{x_n}$, where the $u_i$ are words over a finite set of generators of $G$ and the $x_i$ binary encoded integers, is equal to the identity of $G$. It is a…

Group Theory · Mathematics 2023-01-13 Markus Lohrey , Florian Stober , Armin Weiß

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing the element $x$. A famous theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the derived group…

Group Theory · Mathematics 2021-09-20 Cristina Acciarri , Pavel Shumyatsky

In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup $G_n$ of the symmetric group $S_n$, it acts on the set of finite words of length $n$ by permutation. We associate to an infinite…

Combinatorics · Mathematics 2021-12-10 Sergey Luchinin , Svetlana Puzynina

We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…

Group Theory · Mathematics 2014-10-24 Doron Puder , Ori Parzanchevski

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

Group Theory · Mathematics 2024-10-16 Marco Vergani

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

Number Theory · Mathematics 2024-11-18 Pranjal Jain , Shuo Li

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

We show that first-order formulae are concise in acylindrically hyperbolic groups and certain extensions thereof. We study further classes of groups, including Burnside groups, icc groups, groups with the `Big Powers' condition, torus knot…

Group Theory · Mathematics 2026-05-08 Laura Ciobanu , Martina Conte

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

Group Theory · Mathematics 2014-02-26 Christopher J. Hillar , Lionel Levine , Darren Rhea

Let N be a normal subgroup of a finite group G. We prove that under certain (unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y] (with prescribed values of y from a given set Y) of length bounded by a function of…

Group Theory · Mathematics 2021-03-31 Nikolay Nikolov , Dan Segal

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…

Group Theory · Mathematics 2022-02-01 Andrea Lucchini

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 1904, Issai Schur proved the following result. If $G$ is an arbitrary group such that $G/\Z(G)$ is finite, where $\Z(G)$ denotes the center of the group $G$, then the commutator subgroup of $G$ is finite. A partial converse of this…

Group Theory · Mathematics 2018-07-10 Manoj K. Yadav

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

Group Theory · Mathematics 2025-01-03 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

We prove a rigidity theorem for morphisms from products of open subschemes of the projective line into solvable groups not containing a copy of $\Ga$ (for example, wound unipotent groups). As a consequence, we deduce several structural…

Algebraic Geometry · Mathematics 2025-09-17 Zev Rosengarten

Let p be a prime. Every finite group G has a normal series each of whose quotients either is p-soluble or is a direct product of nonabelian simple groups of orders divisible by p. The non-p-soluble length of G is defined as the minimal…

Group Theory · Mathematics 2023-07-19 Yerko Contreras-Rojas , Pavel Shumyatsky

A word $u=u_1\dots u_n$ is a scattered factor of a word $w$ if $u$ can be obtained from $w$ by deleting some of its letters: there exist the (potentially empty) words $v_0,v_1,..,v_n$ such that $w = v_0u_1v_1...u_nv_n$. The set of all…

Formal Languages and Automata Theory · Computer Science 2020-03-11 Laura Barker , Pamela Fleischmann , Katharina Harwardt , Florin Manea , Dirk Nowotka
‹ Prev 1 3 4 5 6 7 10 Next ›