arXiv math/03112572003-11-16math.GR

On the palindromic and primitive widths of a free group

Valery Bardakov, Vladimir Shpilrain, Vladimir Tolstykh

备注：: 10 pages

英文摘要：

Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S. The supremum of the values l_S(x), x \in G, is called the width of G with respect to S. Here we focus on a free group F. The width of F relative to the set of all primitive (respectively palindromic) elements is called the primitive (respectively palindromic) width of F. We prove that for a free group F_n of finite rank n, both widths are infinite. A result of independent interest is that every primitive element of F_2 is a product of at most two palindromes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Palindromic primitives and palindromic bases in the free group of rank two

The present paper records more details of the relationship between primitive elements and palindromes in F_2, the free group of rank two. We characterise the conjugacy classes of primitive elements which contain palindromes as those which contain cyclically reduced words of odd length. We identify large palindromic subwords of certain primitives in conjugacy classes which contain cyclically reduced words of even length. We show that under obvious conditions on exponent sums, pairs of palindromic primitives form palindromic bases for F_2. Further, we note that each cyclically reduced primitive …

2005-07-04math.GR

Palindromic width of free nilpotent groups

In this paper we consider the palindromic width of free nilpotent groups. In particular, we prove that the palindromic width of a finitely generated free nilpotent group is finite. We also prove that the palindromic width of a free abelian-by-nilpotent group is finite.

2014-02-22math.GR

Palindromic Width of Finitely Generated Solvable Groups

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for finitely generated abelian-by-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step $\geq 3$, we prove that if $G$ is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of $G$ is finite. We also prove that the palindromic width of $\…

2014-02-25math.GR

Palindromic Width of Wreath Products

We show that the wreath product $G \wr \mathbb{Z}^n$ of any finitely generated group $G$ with $\mathbb{Z}^n$ has finite palindromic width. We also show that $C \wr A$ has finite palindromic width if $C$ has finite commutator width and $A$ is a finitely generated infinite abelian group. Further we prove that if $H$ is a non-abelian group with finite palindromic width and $G$ any finitely generated group, then every element of the subgroup $G' \wr H$ can be expressed as a product of uniformly boundedly many palindromes. From this we obtain that $P \wr H$ has finite palindromic width if $P$ is a …

2014-02-18math.GR

Palindromic width of wreath products, metabelian groups, and max-n solvable groups

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so does $G \wr \mathbb{Z}^{r}$. We also give a new, self-contained, proof that finitely generated metabelian groups have finite palindromic width. Finally, we show that solvable groups satisfying the maximal condition on normal subgroups (max-n) have finite palindromic width.

2014-09-12math.GR

On palindromic width of certain extensions and quotients of free nilpotent groups

In arXiv:1303.1129, the authors provided a bound for the palindromic width of free abelian-by-nilpotent group $AN_n$ of rank $n$ and free nilpotent group ${\rm N}_{n,r}$ of rank $n$ and step $r$. In the present paper we study palindromic widths of groups $\widetilde{AN}_n$ and $\widetilde{\rm N}_{n,r}$. We denote by $\widetilde{G}_n = G_n / \langle \langle x_1^2, \ldots, x_n^2 \rangle \rangle$ the quotient of group $G_n = \langle x_1, \ldots, x_n \rangle$, which is free in some variety by the normal subgroup generated by $x_1^2, \ldots, x_n^2$. We prove that the palindromic width of the quotie…

2014-03-13math.GR

更多相关论文收起更多论文

On Palindromic Widths of Nilpotent and Wreathe Products

We prove that the nilpotent product of a set of groups $A_{1},\dots, A_{s}$ has finite palindromic width if and only if the palindromic widths of $A_{i}, i=1,\dots, s,$ are finite. We give a new proof that the commutator width of $F_n \wr K$ is infinite, where $F_n$ is a free group of rank $n \geq 2$ and $K$ a finite group. This result, combining with a result of Fink \cite{f1} gives examples of groups with infinite commutator width but finite palindromic width with respect to some generating set.

2015-04-02math.GR

Reversing Palindromic Enumeration in Rank Two Free Groups

The Gilman-Maskit algorithm for determining the discreteness or non-discreteness of a two-generator subgroup of $\mathrm{PSL}_2\mathbb{R}$ terminates with a pair of generators that are Farey words. The Farey words are primitive words that are indexed by rational numbers and infinity. The E-words, primitive words with palindromic product forms, are also indexed by rational numbers and infinity. We show a modification of the Gilman-Maskit algorithm so that the stopping generators are E-words.

2016-04-17math.GR

关于某些自由构造群的近回文宽度

On the almost palindromic width of certain free constructions of groups

Indian Institute of Science Education and Research (IISER) Mohali（印度科学教育研究所 Mohali）；International Center for Theoretical Sciences（理论科学国际中心）

该研究通过通用结构准则证明了某些自由构造群具有无限$m$-近回文宽度，并扩展了相关研究成果。

2026-02-27math.GR

The palindromic width of a free product of groups

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups of order two. This means that there is no a uniform bound $k$ such that every element of $G$ is a product of at most $k$ palindromes. Earlier the similar fact established for non-abelian free groups.

2003-12-08math.GR

Palindromic words in simple groups

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 simple group has palindromic width $pw(G,X)=1$, where $X$ only differs by at most one Nielsen-transformation from any given generating set. On the contrary, we prove that all non-abelian finite simple groups $G$ also have a generating set $S$ with $pw(G,S)>1$. As a by-product of our work we also obtain that every just-infinite group has finite palindromic wi…

2014-12-16math.GR

Palindromic widths of graph of groups

We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except when the amalgamated subgroup has index two in each of the factors). Combining these results it follows that the palindromic width of the fundamental group of a graph of groups is mostly infinite.

2019-08-23math.GRmath.GT

关于自由群的几乎回文宽度

On the almost-palindromic width of free groups

本文证明了不存在自然数对(c,m)使得二元自由群的每个元素都能表示为至多c个m-几乎回文的拼接，并将该否定结果推广到所有非阿贝尔自由群，从而回答了Bardakov提出的问题。

2024-08-12math.COmath.GR

Conjugacy Growth and Conjugacy Width of Certain Branch Groups

The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of intermediate growth. We further proof that certain branch groups have the property that every element can be expressed as a product of uniformly boundedly many conjugates of the generators. We call this property bounded conjugacy width. We also show how bounded conjugacy width relates to other algebraic properties of groups and apply these results to study the …

2014-12-16math.GR

Discreteness Criteria and the Hyperbolic Geometry of Palindroms

We consider non-elementary representations of two generator free groups in $PSL(2,\mathbb{C})$, not necessarily discrete or free, $G = < A, B >$. A word in $A$ and $B$, $W(A,B)$, is a palindrome if it reads the same forwards and backwards. A word in a free group is {\sl primitive} if it is part of a minimal generating set. Primitive elements of the free group on two generators can be identified with the positive rational numbers. We study the geometry of palindromes and the action of $G$ in $\HH^3$ whether or not $G$ is discrete. We show that there is a {\sl core geodesic} $Ł$ in the convex hu…

2008-08-26math.GRmath.GT

Freeness of multi-reflection arrangements via primitive vector fields

In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming from well-generated unitary reflection groups, where the multiplicity of a hyperplane depends on the order of its stabilizer. Here the exponents depend on the exponents of the dual reflection representation. We then extend our results further to all imprimitive irreducible unitary reflection groups. In this case the exponents turn out to depend on the expon…

2019-04-17math.ACmath.COmath.GR