Related papers: The non-abelian squares are not context-free
We build two non-abelian CSA-groups in which maximal abelian subgroups are conjugate and divisible.
Sacerdote [Sa] has shown that the non-Abelian free groups satisfy precisely the same universal-existential sentences Th(F$_2$)$\cap \forall \exists $ in a first-order language L$_o$ appropriate for group theory. It is shown that in every…
In this paper we study principally polarized complex abelian varieties that admit an automorphism of order 3. It turns out that certain natural conditions on the multiplicities of its action on the differentials of the first kind do…
We show that paper folding words contain arbitrarily large abelian powers.
A finite word $w$ is an abelian square if $w = xx^\prime$ with $x^\prime$ a permutation of $x$. In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2 + 6k$ contains an abelian square of length $\geq 2k$. We…
In this note we prove that the fouth bounded cohomology of non-abelian free groups with trivial real coefficients is non-zero. In order to prove this, we establish a splitting argument whose simplest form is as follows: Let $M$ denote an…
We describe hierarchies of exact string backgrounds obtained as non-Abelian cosets of orthogonal groups and having a space--time realization in terms of gauged WZW models. For each member in these hierarchies, the target-space backgrounds…
We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is…
A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words over a $3$-letter alphabet. We study square-free words with…
In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word $w$ is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for some…
In this paper we study the existence of free non-abelian subgroups in non-central permutable subgroups of general skew linear groups and locally finite group algebras.
The topology of the Bowditch boundary of a relatively hyperbolic group pair gives information about relative splittings of the group. It is therefore interesting to ask if there is generic behavior of this boundary. The purpose of this…
We present a necessary condition for an infinite language to be multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of the…
It is now a classical result that an algebraic space locally of finite type over $\mathbf{C}$ is analytifiable if and only if it is locally separated. In this paper we study non-archimedean analytifications of algebraic spaces. We construct…
We investigate a relationship between nondegeneracy of a simple abelian variety $A$ over an algebraic closure of $\mb{Q}$ and of its reduction $A_0$. We prove that under some assumptions, nondegeneracy of $A$ implies nondegeneracy of $A_0$.
This paper presents a restricted form of linear indexed grammars, called even linear indexed grammars, which yield the even linear indexed languages. These languages properly contain the context-free languages and are contained in the set…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
Cross-bifix-free sets are sets of words such that no prefix of any word is a sufix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free q-ary words of fixed length. It enables us to…
In this paper we prove that small cancellation rings under some natural restrictions are non-amenable and contain non-commutative free associative algebra.