English
Related papers

Related papers: Achiral words

200 papers

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. In particular, Olshanskii gave an example of such…

Group Theory · Mathematics 2023-07-28 Matteo Pintonello , Pavel Shumyatsky

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 m, n be positive integers, v a multilinear commutator word and w = v^m. We prove that if G is a locally graded group in which all w-values are n-Engel, then the verbal subgroup w(G) is locally nilpotent.

Group Theory · Mathematics 2015-01-09 Pavel Shumyatsky , Antonio Tortora , Maria Tota

Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…

Group Theory · Mathematics 2017-01-24 William Cocke , Meng-Che Ho

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

Group Theory · Mathematics 2016-10-14 Alexander Bors

This work considers a natural generalization of primitivity with respect to a language. Given a language $L$, a nonempty word $w$ is said to be $L$-primitive if $w$ is not a proper power of any word in $L$. After ascertaining the number of…

Formal Languages and Automata Theory · Computer Science 2014-03-25 Shubh Narayan Singh , K. V. Krishna

We combine concepts from random matrix theory and free probability together with ideas from the theory of commutator length in groups and maps from surfaces, and establish new connections between the two. More particularly, we study…

Group Theory · Mathematics 2016-02-02 Michael Magee , Doron Puder

For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be…

Combinatorics · Mathematics 2018-06-14 Ameya Daigavane , Mrityunjay Singh , Benny K. George

Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether…

Group Theory · Mathematics 2011-09-12 Doron Puder

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

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

Group Theory · Mathematics 2020-05-18 Rachel D. Camina , Ainhoa Iniguez , Anitha Thillaisundaram

We study groups whose co-word problems are ET0L languages, which we call coET0L groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder. In particular we prove a number of closure results for the…

Group Theory · Mathematics 2026-02-25 Raad Al Kohli , Derek F. Holt , Sarah Rees

Let G denote a group and let W be an algebra over a commutative ring R. We will say that W is a G-graded twisted algebra (not necessarily commutative, neither associative) if there exists a G-grading W=\bigoplus_{g \in G}W_{g} where each…

Rings and Algebras · Mathematics 2013-01-25 Juan D. Velez , Luis A. Wills , Natalia Agudelo

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

An element w of a Weyl group W is called elliptic if it has no eigenvalue 1 in the standard reflection representation. We determine the order of any representative g in a semisimple algebraic group G of an elliptic element w in the…

Group Theory · Mathematics 2011-09-27 Matthew C. B. Zaremsky

Let m, n be positive integers, v a multilinear commutator word and w = v^m. We prove that if G is a residually finite group in which all w-values are n-Engel, then the verbal subgroup w(G) is locally nilpotent. We also examine the question…

Group Theory · Mathematics 2015-07-17 Raimundo Bastos , Pavel Shumyatsky , Antonio Tortora , Maria Tota

We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…

Group Theory · Mathematics 2023-05-30 Muhammad Inam

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder