Related papers: Word Length Formulae and Normal Forms of Conjugacy…

A collection C of subgroups of a finite group G can give rise to three different standard formulas for the cohomology of G in terms of either: the subgroups in C; or their centralizers; or their normalizers. We give a short but systematic…

We give a new lower bound on the number of connected components of the space of representations of a surface group into the group of orientation preserving homeomorphisms of the circle. Precisely, for the fundamental group of a genus g…

We describe a practical algorithm for computing normal forms for semigroups and monoids with finite presentations satisfying so-called small overlap conditions. Small overlap conditions are natural conditions on the relations in a…

We consider the compactification M(atrix) theory on a Riemann surface Sigma of genus g>1. A natural generalization of the case of the torus leads to construct a projective unitary representation of pi_1(\Sigma), realized on the Hilbert…

Let $w$ be a word in a free group. As was revealed by Magee and Puder in [arXiv:1802.04862], the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain stable Fourier coefficients…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

Let $\Gamma$ be a finite index subgroup of the mapping class group $MCG(\Sigma)$ of a closed orientable surface $\Sigma$, possibly with punctures. We give a precise condition (in terms of the Nielsen-Thurston decomposition) when an element…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

Let $\Sigma_{g}$ be a closed surface of genus $g\geq 2$ and $\Gamma_{g}$ denote the fundamental group of $\Sigma_{g}$. We establish a generalization of Voiculescu's theorem on the asymptotic $*$-freeness of Haar unitary matrices from free…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on the algebra of Pregroups, introduced by…

Let $KG$ be the group ring of a group $G$ over a commutative ring $K$ with unity. The rings $KG$ are described for which $xx^\sigma=x^\sigma x$ for all $x=\sum_{g\in G}\alpha_gg\in KG$, where \quad $x\mapsto x^\sigma=~\sum_{g\in…

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…