Related papers: Verbal quandles with one parameter

We prove that if $G$ is a free-torsion group and $w(t)$ is a word in the alphabet $G \sqcup \{t^{\pm 1}\}$ with exponent sum one, then the group $<G,t|(w(t))^k = 1>$, where $k \geq 2$, is relatively hyperbolic with respect to $G$.

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…

The axioms of a quandle imply that the columns of its Cayley table are permutations. This paper studies quandles with exactly one non-trivially permuted column. Their automorphism groups, quandle polynomials, (symmetric) cohomology groups,…

Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…

Let w be a multilinear commutator and n a positive integer. Suppose that G is a residually finite group in which every product of at most 896 w-values has order dividing n. Then the verbal subgroup w(G) is locally finite.

For $d\ge 1$, a word $w\in \{ 0,1\}^{\Z^d}$ is called balanced if there exists $M > 0$ such that for any two rectangles $R, R^{'}\subset\Z^d$ that are translates of each other, the number of occurrences of the symbol $1$ in $R$ and $R^{'}$…

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…

Any virtually free group $H$ containing no non-trivial finite normal subgroup (e.g., the infinite dihedral group) is a retract of any finitely generated group containing $H$ as a verbally closed subgroup.

A quandle is a set that has a binary operation satisfying three conditions corresponding to the Reidemeister moves. Homology theories of quandles have been developed in a way similar to group homology, and have been applied to knots and…

Let w be a multilinear commutator word. We prove that if e is a positive integer and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e then the exponent of the corresponding verbal subgroup…

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating…

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

Consider the Macdonald group $G(\alpha,\beta)=\langle A,B\,|\, A^{[A,B]}=A^\alpha,\, B^{[B,A]}=B^\beta\rangle$, where $\alpha$ and $\beta$ are integers different from one. We fill a gap in Macdonald's original proof that $G(\alpha,\beta)$…

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…

We define a class of quandle-like structures called pseudoquandles and analyze some of their algebraic properties.

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

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…

Let $G$ be a group and $\varphi \in \Aut(G)$. Then the set $G$ equipped with the binary operation $a*b=\varphi(ab^{-1})b$ gives a quandle structure on $G$, denoted by $\Alex(G, \varphi)$ and called the generalised Alexander quandle. When…

Xu and Wu (2001) defined the \emph{generalized wordlength pattern} $(A_1, ..., A_k)$ of an arbitrary fractional factorial design (or orthogonal array) on $k$ factors. They gave a coding-theoretic proof of the property that the design has…