Related papers: Outer commutator words are uniformly concise

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an…

A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

This paper is an attempt to find out which properties of a finite group G can be expressed in terms of commutators of elements of coprime orders. A criterion of solubility of G in terms of such commutators is obtained. We also conjecture…

Let $G$ be a finite $p$-group whose derived subgroup $G'$ can be generated by $2$ elements. If $G'$ is abelian, Guralnick proved that every element of $G'$ is a commutator. In this paper, we prove that the condition that $G'$ should be…

M.R.Jones and J.Wiegold in [3] have shown that if $G$ is a finite group with a subgroup $H$ of finite index $n$, then the $n$-th power of Schur multiplier of $G$, $M(G)^n$, is isomorphic to a subgroup of $M(H)$. In this paper we prove a…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…

Let $G$ be a finite group, let $p$ be a prime and let $w$ be a group-word. We say that $G$ satisfies $P(w,p)$ if the prime $p$ divides the order of $xy$ for every $w$-value $x$ in $G$ of $p'$-order and for every non-trivial $w$-value $y$ in…

We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…

A graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that, for any two distinct vertices $x, y \in V$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. Two letters $x$ and $y$ are said to…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…