Related papers: Word maps, polynomial maps and image ratios

We discuss some recent results by a number of authors regarding word maps on algebraic groups and finite simple groups, their mixing properties and the geometry of their fibers, emphasizing the role played by equidistribution results in…

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

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

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…

In this work we prove that the set of points at infinity $S_\infty:={\rm Cl}_{{\mathbb R}{\mathbb P}^m}(S)\cap\mathsf{H}_\infty$ of a semialgebraic set $S\subset{\mathbb R}^m$ which is the image of a polynomial map $f:{\mathbb…

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

An order is a commutative ring that as an abelian group is finitely generated and free. A commutative ring is reduced if it has no non-zero nilpotent elements. In this paper we use a new tool, namely, the fact that every reduced order has a…

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…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes 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…

We study the images of polynomial maps over algebraically closed division rings. Our first result generalizes the classical Ax-Grothendieck theorem: We show that if $ f_1, \ldots, f_m $ are elements of the free associative algebra $…

The Amit conjecture about word maps on finite nilpotent groups has been shown to hold for certain classes of groups. The generalised Amit conjecture says that the probability of an element occurring in the image of a word map on a finite…

In this note we provide a (decidable) graph-structural characterisation of the infiniteness of $L(w_1, ..., w_k)$, where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_{w_k}\}$ is the set of all words that contain the same…

To a non-trivial word $w(x_{1},...,x_{r})$ in a free group $F_{r}$ on $r$ elements and a group $G$, one can associate the word map $w_{G}:G^{r}\rightarrow G$ that takes an $r$-tuple $(g_{1},...,g_{r})$ in $G^{r}$ to $w(g_{1},...,g_{r})$. If…