中文
相关论文

相关论文: Word maps have large image

200 篇论文

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

群论 · 数学 2018-04-25 Pedro Silva , Pascal Weil

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

群论 · 数学 2019-02-20 Timothy C. Burness , Elisa Covato

Let $\mathbb F$ be a local field and $G$ be a linear algebraic group defined over $\mathbb F$. For $k\in\mathbb N$, let $g\to g^k$ be the $k$-th power map $P_k$ on $G(\mathbb F)$. The purpose of this article is two-fold. First, we study the…

数论 · 数学 2025-03-24 Parteek Kumar , Arunava Mandal

We show that if $w$ is a multilinear commutator word and $G$ a finite group in which every metanilpotent subgroup generated by $w$-values is of rank at most $r$, then the rank of the verbal subgroup $w(G)$ is bounded in terms of $r$ and $w$…

群论 · 数学 2021-07-01 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

Let F be the free group on two letters. For {\omega} \in F we study the associated word map {\omega}: SU(n) \times SU(n) \rightarrow SU(n). Extending a method of Goto, we show that for {\omega} not in the second derived subgroup F^(2) of F,…

群论 · 数学 2012-07-25 Abdelrhman Elkasapy , Andreas Thom

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =<x_1,...,x_n>$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{w (g_1,...,g_n)^{\pm 1} | g_i \in…

群论 · 数学 2010-04-01 Jon Gonzalez-Sanchez , Benjamin Klopsch

If $G$ is a semisimple Lie group of real rank at least 2 and $\Gamma$ is an irreducible lattice in $G$, then every homomorphism from $\Gamma$ to the outer automorphism group of a finitely generated free group has finite image.

群论 · 数学 2011-04-14 Martin R. Bridson , Richard D. Wade

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

群论 · 数学 2025-05-05 Martina Conte , Jan Moritz Petschick

A graph $G=(V,E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. In this paper we give an effective…

组合数学 · 数学 2015-01-29 Magnús M. Halldórsson , Sergey Kitaev , Artem Pyatkin

Word maps have been studied for matrix groups over a field. We initiate the study of problems related to word maps in the context of the group $\mathrm{GL}_n(\mathscr O_2)$, where $\mathscr O_2$ is a finite local principal ideal ring of…

群论 · 数学 2025-08-27 Saikat Panja , Ayon Roy , Anupam Singh

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

群论 · 数学 2024-04-30 Cristina Acciarri , Pavel Shumyatsky

Let $\mathbf{F}$ be the free group on two generators $a, b$ and let a family of words $w = [[a, b], [a^3, b^n]]$ in $\mathbf{F}$. In this paper we examine surjectivity of word map $w$ on special unitary group SU(2) over complex field…

群论 · 数学 2025-05-27 Rohit Yadav

Suppose that G is a nontrivial torsion-free group and w is a word in the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\} such that the word w' obtained from w by erasing all letters belonging to G is not a proper power in the free group…

群论 · 数学 2012-11-01 Anton A. Klyachko

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}$,…

群论 · 数学 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

群论 · 数学 2019-09-11 Michael Larsen , Aner Shalev , Pham Huu Tiep

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

群论 · 数学 2025-02-12 Iker de las Heras , Andoni Zozaya

Let $G$ be a connected reductive group defined over $\mathbb F_q$. Fix an integer $M\geq 2$, and consider the power map $x\mapsto x^M$ on $G$. We denote the image of $G(\mathbb F_q)$ under this map by $G(\mathbb F_q)^M$ and estimate what…

群论 · 数学 2024-04-04 Amit Kulshrestha , Rijubrata Kundu , Anupam Singh

Consider a graph G = G(k,d,s) with vertex set the set of all k-letter words over an alphabet of size d. An edge e = vw is in E iff v is distinct from w and the last(first) k-s letters of v are identical to the first(last) k-s letters of w.…

组合数学 · 数学 2007-05-23 Anant Godbole , Debra Knisley , Rick Norwood

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

群论 · 数学 2007-05-23 Michael Larsen , Aner Shalev