Related papers: Word maps have large image

We define an algebraic group over a group $G$ to be a variety - that is, a subset of $G^d$ defined by equations over $G$ - endowed with a group law whose coordinates can be expressed as word maps. In the case where $G$ is a torsion-free…

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

We give a brief survey of recent results on word maps on simple groups and polynomial maps on simple associative and Lie algebras. Our focus is on parallelism between these theories, allowing one to state many new open problems and giving…

Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…

A graph $G = (V, E)$ is word-representable, if there exists a word w over the alphabet V such that for letters ${x, y} \in V$ , $x$ and $y$ alternate in $w$ if and only if $xy \in E$. In this paper, we prove that any non-empty…

Let $G$ be a connected Lie group. In this paper, we study the density of the images of individual power maps $P_k:G\to G:g\mapsto g^k$. We give criteria for the density of $P_k(G)$ in terms of regular elements, as well as Cartan subgroups.…

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent…

The aim of this note is to understand the injectivity of Feigin's map $\mathbf{F_w}$ by representation theory of quivers, where $\mathbf{w}$ is the word of a reduced expression of the longest element of a finite Weyl group. This is achieved…

If F is a free group of finite rank at least two then any group of the form F by Z is large. In this short note we show how this statement follows by combining a very recent theorem of Hagen and Wise (using work of Agol and of Wise) with…

We consider words over a binary alphabet. A word $w$ is overlap-free if it does not have factors (blocks of consecutive letters) of the form $uvuvu$ for nonempty $u$. Let $M(w)$ denote the number of positions that are middle positions of…

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

A finite order element $g$ of a group $G$ is called rational if $g$ is conjugate to $g^i$ for every integer $i$ coprime to the order $g$. We determine all triples $(G,g,\phi)$, where $G$ is a simple algebraic group of type $A_n,B_n$ or…

The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

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…

For a positive integer r we prove that if G is a profinite group in which the centralizer of every nontrivial element has rank at most r, then G is either a pro-p group or a group of finite rank. Further, if G is not virtually a pro-p…

An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. This paper is about reversibles in the group $G$ of formally-invertible pairs of formal power series in two variables, with complex…

Let F be a non-abelian finite rank free group, and let H_g be the fundamental group of a surface of genus g with one boundary component represented by D_g in H_g. So, H_g is the free group <a_1,b_1,...,a_g,b_g> and D_g is the product of…

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…