arXiv math/05043122005-04math.GR

On the probability of satisfying a word in a group

Miklos Abert

备注：: Added content. A more general theorem is proved

英文摘要：

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 be obtained as a quotient of the one relator group $F_{d}/<w>$. As a corollary, the probability that a word is satisfied in a fixed non-solvable group can be made arbitrarily small, answering a question of Alon Amit.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

On the probability of satisfying a word in nilpotent groups of class 2

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 conjecture of Alon Amit.

2011-01-22math.GR

Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a unique "canonical" representative for each equivalence class. We prove that overlap-free words and so-called almost overlap-free words (this notion is some generalization of the notion of overlap-free words) can serve as canonical representatives for corresponding equivalence classes. We show that such a word in a given class, if any, can be efficiently found.…

2011-02-21cs.FLmath.GR

The Probability Distribution of Word Maps on Finite Groups

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if and only if every surjective word map has fibers of uniform size. Moreover, we show that probability distributions themselves are sufficient to identify nilpotent groups, and these same distributions can be used to determine abelian groups up to isomorphism. In addition we answer a question of Amit and Vishne.

2018-07-18math.GR

On varieties of groups satisfying an Engel type identity

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are n-Engel and w(G) is locally nilpotent is a variety (Theorem A). Further, we show that in the case where m is a prime-power the class of all groups G in which the w-values are n-Engel and v(G) has an ascending normal series whose quotients are either locally soluble or locally finite is a variety (Theorem B). We examine the question whether the latter result …

2015-03-25math.GR

On the probability distribution associated to commutator word map in finite groups \rom{2}

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that for given $n\geq 1$, there exists a finite group $G$ of nilpotency class $2$ with exactlly two conjugacy class sizes such that $|P(G)|=n$.

2018-09-24math.GR

Dehn Functions, the Word Problem, and the Bounded Word Problem For Decidable Group Presentations

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that no finitely generated decidable presentations exist satisfying the combinations for which we do not provide examples. The presentations we construct are also minimal. These constructions answer an open question asked by R.I. Grigorchuk and S.V. Ivanov. Our approach uses machinery developed by Birget, Ol'shanskii, Rips, and Sapir for constructing finite grou…

2013-01-15math.GR

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

Groups of given intermediate word growth

We show that there exists a finitely generated group of growth ~f for all functions f:\mathbb{R}\rightarrow\mathbb{R} satisfying f(2R) \leq f(R)^{2} \leq f(ηR) for all R large enough and η\approx2.4675 the positive root of X^{3}-X^{2}-2X-4. This covers all functions that grow uniformly faster than \exp(R^{\log2/\logη}). We also give a family of self-similar branched groups of growth ~\exp(R^α) for a dense set of α\in(\log2/\logη,1).

2013-07-07math.GR

Dead end words in lamplighter groups and other wreath products

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in a group $G$ with finite generating set $X$ is a dead end element if no geodesic ray from the identity to $w$ in the Cayley graph $Γ(G,X)$ can be extended past $w$. Additionally, we describe some nonconvex behavior of paths between elements in these Cayley graphs and seesaw words, which are potential obstructions to these graphs satisfying the $k$-fellow tra…

2003-09-20math.GR

Gaps in probabilities of satisfying some commutator-like identities

We show that there is a positive constant $δ< 1$ such that the probability of satisfying either the $2$-Engel identity $[X_1, X_2, X_2] = 1$ or the metabelian identity $[[X_1, X_2], [X_3, X_4]] = 1$ in a finite group is either $1$ or at most $δ$.

2019-02-11math.GR

A group-theoretical interpretation of the word problem for free idempotent generated semigroups

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a free idempotent generated semigroup $\mathsf{IG}(\mathcal{E})$ - the `free-est' semigroup with a given biordered set $\mathcal{E}$ of idempotents. We show that when $\mathcal{E}$ is finite, the word problem for $\mathsf{IG}(\mathcal{E})$ is equivalent to a family of constraint satisfaction problems involving rational subsets of direct products of pairs of ma…

2019-01-09math.GR

关于具有 BFC-覆盖字值的群

On groups with BFC-covered word values

本文研究群的(n,s)-覆盖条件，证明满足该条件的群存在指数和导出长度(或幂零类)均有界的可解(或幂零)子群。

2024-01-02math.GR

A representation of $\text{Out}\left(F_{n}\right)$ by counting subwords of cyclic words

We generalize the combinatorial approaches of Rapaport and Higgins--Lyndon to the Whitehead algorithm. We show that for every automorphism $φ$ of a free group $F$ and every word $u\in F$ there exists a finite multiset of words $S_{u,φ}$ satisfying the following property: For every cyclic word $w$, the number of times $u$ appears as a subword of $φ\left(w\right)$ depends only on the appearances of words in $S_{u,φ}$ as subwords of $w$. We use this fact to construct a faithful representation of $\text{Out}\left(F_{n}\right)$ on an inverse limit of $\mathbb{Z}$-modules, so that each automorphism …

2022-11-30math.COmath.GR

Some Orbits of Free Words that are Determined by Measures on Finite Groups

Every word in a free group $F$ induces a probability measure on every finite group in a natural manner. It is an open problem whether two words that induce the same measure on every finite group, necessarily belong to the same orbit of $\mathrm{Aut}F$. A special case of this problem, when one of the words is the primitive word $x$, was settled positively by the third author and Parzanchevski [arXiv:1202.3269]. Here we extend this result to the case where one of the words is $x^d$ or $\left[x,y\right]^{d}$ for an arbitrary $d\in\mathbb{Z}$.

2020-07-29math.GR

自守词映射与Amit--Ashurst猜想

Automorphic word maps and Amit--Ashurst conjecture

本文通过构造与给定词同分布的自守词映射，改进并部分解决了有限幂零群上的Amit--Ashurst猜想，同时推广了Camina等人及Iniguez和Sangroniz的相关结果。

2023-09-16math.GR

群的簇与字的简洁性问题

Varieties of groups and the problem on conciseness of words

本文证明字 $w$ 在剩余有限群中的简洁性等价于在 virtually pro-$p$ 群中，并由此将 $w^q$ 和 $[w^q,_{n} y]$ 的简洁性推广至正整数 $q$。

2024-04-27math.GR

p -群的 wreath 积中的 Engel 概率

Engel probability in wreath products of $p$-groups

Euskal Herriko Unibertsitatea（巴斯克大学）；Università degli Studi di Milano-Bicocca（米兰比可卡大学）；Università degli Studi di Firenze（佛罗伦萨大学）

研究群$W_k=(C_p\wr C_{p^k})^2$中方程$e_n(x,y)=g$解的数量上下界，得出推论，证明了关于$W_k$中 Engel 字的更强猜想，表明其在特定有限群中不是概率恒等式，并构造相关闭子集。

2026-07-14math.GR

Hilbert space compression and exactness for discrete groups

We show that the Hilbert space compression of any finite dimensional CAT(0) cube complex is 1 and deduce that any discrete group acting properly, co-compactly on a CAT(0) cube complex is exact. The class of groups covered by this theorem includes free groups, finitely generated Coxeter groups, finitely generated right angled Artin groups, finitely presented groups satisfying the B(4)-T(4) small cancellation condition and all those word-hyperbolic groups satisfying the B(6) condition. Another family of examples is provided by certain canonical surgeries defined by link diagrams.

2004-03-26math.FAmath.GR

Fine asymptotic geometry in the Heisenberg group

For every finite generating set on the integer Heisenberg group H(Z), Pansu showed that the word metric has the large-scale structure of a Carnot-Caratheodory Finsler metric on the real Heisenberg group H(R). We study the properties of those limit metrics and obtain results about the geometry of word metrics that reflect the dependence on generators. For example we will study the probability that a group element has all of its geodesic spellings sublinearly close together, relative to the size of the element. In free abelian groups of rank at least two, that probability is 0; in infinite hyper…

2011-07-25math.GRmath.MG

Girth, words and diameter

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in terms of the length of w, which has additional applications. We also study the girth of random directed Cayley graphs of symmetric groups, and the relation between the girth and the diameter of random Cayley graphs of finite simple groups.

2019-03-22math.COmath.GRmath.PR