Related papers: Verbal quandles with one parameter

We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely…

A quandle is an algebraic structure whose binary operation is idempotent, right-invertible and right self-distributive. Right-invertibility ensures right translations are permutations and right self-distributivity ensures further they are…

Let $w=w(x_1,\ldots,x_r)$ be an outer commutator word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables. This applies in particular to words of the form…

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 subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…

Word-representable graphs are a subset of graphs that may be represented by a word $w$ over an alphabet composed of the vertices in the graph. In such graphs, an edge exists if and only if the occurrences of the corresponding vertices…

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that…

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This article surveys results for combable groups, in…

Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…

In neural network-based models for natural language processing (NLP), the largest part of the parameters often consists of word embeddings. Conventional models prepare a large embedding matrix whose size depends on the vocabulary size.…

We conjecture that a unital C$^*$-algebra is a W$^*$-algebra if and only if each of its maximal abelian self-adjoint subalgebras is a W$^*$-algebra; this is a space-free analogue of a known result due to G.K. Pedersen. Our main result is a…

In this paper we provide the conditions under which an automorphism or an antiautomorphism of a group $G$ induces an automorphism or an antiautomorphism of the $m$-conjugation quandle $\operatorname{Conj_{m}}(G),\,\, m\in \mathbb{Z} $, the…

We investigate amenability for $W^*$-Fell bundles over a discrete group $G$, with a focus on its characterization via approximation properties and conditional expectations. Building on the notion of $W^*$-amenability, we construct an…

A word $u$ is a scattered factor of $w$ if $u$ can be obtained from $w$ by deleting some of its letters. That is, there exist the (potentially empty) words $u_1,u_2,..., u_n$, and $v_0,v_1,..,v_n$ such that $u = u_1u_2...u_n$ and $w =…

Let $x, y$ be two normal elements in a unital simple C*-algebra $A.$ We introduce a function $D_c(x, y)$ and show that in a unital simple AF-algebra there is a constant $1>C>0$ such that $$ C\cdot D_c(x, y)\le {\rm dist}({\cal U}(x),{\cal…

For a group $G$, we define a graph $\Delta(G)$ by letting $G^{\#} = G \setminus \{ 1 \}$ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\#}$ if and only if the subgroup $\langle x,y\rangle$ is cyclic.…

We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up…

In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…

A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…