Related papers: On Unique Factorization of Non-periodic Words

Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…

A cylinder $C^1_u$ is the set of infinite words with fixed prefix $u$. A double-cylinder $C^2_{[1,u]}$ is "the same" for bi-infinite words. We show that for every word $u$ and any automorphism $\varphi$ of the free group $F$ the image…

A submonoid of the additive group $\mathbb{Q}$ is called a Puiseux monoid if it consists of nonnegative rationals. Given a monoid $M$, the set consisting of all nonempty finite subsets of $M$ is also a monoid under the Minkowski sum, and it…

Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K <X> /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincar\'{e}-Birkhoff-Witt type basis…

The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

In this paper we study the asymptotic behaviour of two relatively new complexity functions defined on infinite words and their relationship to periodicity. Given a factor $u$ of an infinite word $x$, we say $u$ is closed if it is a letter…

I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

A finite deterministic (semi)automaton $\mathcal{A} =(Q,\Sigma,\delta)$ is $k$-compressible if there is some word $w\in \Sigma^+$ such that the image of its state set $Q$ under the natural action of $w$ is reduced by at least $k$ states.…

A generalized word in two letters $A$ and $B$ is an expression of the form $W=A^{\alpha_1}B^{\beta_1}A^{\alpha_2}B^{\beta_2}... A^{\alpha_N}B^{\beta_N}$ in which the exponents $\alpha_i$, $\beta_i$ are nonzero real numbers. When independent…

Let $G$ be a finite group of odd order, $\F$ a finite field of odd characteristic $p$ and $\B$ a finite--dimensional symplectic $\F G$-module. We show that $\B$ is $\F G$-hyperbolic, i.e., it contains a self--perpendicular $\F G$-submodule,…

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…

Every word $w$ in a free group naturally induces a probability measure on every compact group $G$. For example, if $w=\left[x,y\right]$ is the commutator word, a random element sampled by the $w$-measure is given by the commutator…

Given a finite alphabet $\Sigma$ and a right-infinite word $\bf w$ over $\Sigma$, we define the Lie complexity function $L_{\bf w}:\mathbb{N}\to \mathbb{N}$, whose value at $n$ is the number of conjugacy classes (under cyclic shift) of…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Given a finitely presented group $G$, we wish to explore the conditions under which automorphisms of quotients $G/N$ can be lifted to automorphisms of $G$. We discover that in the case where $N$ is a central subgroup of $G$, the question of…

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…

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = \sum_{n=0}^{\infty}T_u(n) in which D(u) denotes the defect of u and T_u(n) denotes C_u(n+1)-C_u(n) +2 - P_U(n+1) -…