Related papers: On 3 and 4 dimensional regular solids, Part 1: The…
Lists of equivalence classes of words under rotation or rotation plus reversal (i.e., necklaces and bracelets) have many uses, and efficient algorithms for generating these lists exist. In combinatorial group theory elements of a group are…
The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…
In \cite{jpsf} we constructed pairs of units $u,v$ in $\Z$-orders of a quaternion algebra over $\Q (\sqrt{-d})$, $d \equiv 7 \pmod 8$ positive and square free, such that $< u^ n,v^n>$ is free for some $n\in \mathbb{N}$. Here we extend this…
We study the algebras of modular forms on type IV symmetric domains for simple lattices; that is, lattices for which every Heegner divisor occurs as the divisor of a Borcherds product. For every simple lattice $L$ of signature $(n,2)$ with…
One of the key steps in the proof of the Banach-Tarski Theorem is the introduction of a free group of rotations. First, a free group of reduced words is generated where each element of the set is represented as an ACL2 list. Then we…
Consider a random word $X^n=(X_1,\ldots ,X_n)$ in an alphabet consisting of $4$ letters, with the letters viewed either as $A$, $U$, $G$ and $C$ (i.e., nucleotides in an RNA sequence) or $\alpha$, $\bar{\alpha}$, $\beta$ and $\bar{\beta}$…
For an arbitrary rational polyhedron we consider its decompositions into Minkowski summands and, dual to this, the free extensions of the associated pair of semigroups. Being free for the pair of semigroups is equivalent to flatness for the…
We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…
A word is level if each letter appears in it the same number of times, plus or minus 1. We give a complete characterization of the lengths for which level ternary circular square-free words exist. Key words: combinatorics on words, circular…
A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length $n$. The famous conjecture…
We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…
We construct a boundary of a finite rank free group relative to a finite list of conjugacy classes of maximal cyclic subgroups. From the cut points and uncrossed cut pairs of this boundary we construct a simplicial tree on which the group…
In this paper, we primarily investigate the following symmetric presentation of the surface group $\pi_1(\Sigma_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle$. For every nontrivial element…
Let $k$ be a field of characteristic different from $2$ and let $G$ be a nonabelian residually torsion-free nilpotent group. It is known that $G$ is an orderable group. Let $k(G)$ denote the subdivision ring of the Malcev-Neumann series…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…
We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.
We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…
Adding two generators and one arbitrary relator to a nontrivial torsion-free group, we always obtain an SQ-universal group. In the course of the proof of this theorem, we obtain some other results of independent interest. For instance,…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…