Related papers: Long relators in groups generated by two parabolic…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial…
Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…
It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…
Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
Given a free group of rank r >= 3 and two exponentially growing outer automorphisms {\psi} and {\phi} with dual lamination pairs {\Lambda^\pm}_{\psi} and {\Lambda^\pm}_{\phi} associated to them, which satisfy a notion of independence…
A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set $X$, such that every element of it can be written as a palindrome in the letters of $X$. Moreover, every…
Although current large language models are complex, the most basic specifications of the underlying language generation problem itself are simple to state: given a finite set of training samples from an unknown language, produce valid new…
In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
Large language models (LLMs) have proven to be highly effective for solving complex reasoning tasks. Surprisingly, their capabilities can often be improved by iterating on previously generated solutions. In this context, a reasoning plan…
We consider a question of Edjvet and Vdovina concerning which groups defined by special presentations are large. For each integer $n \ge 3$, we construct an $n$-generator one-relator presentation whose star graph is the complete bipartite…
We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…
Building explainable systems is a critical problem in the field of Natural Language Processing (NLP), since most machine learning models provide no explanations for the predictions. Existing approaches for explainable machine learning…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and…
We prove that for a connected, semisimple linear Lie group $G$ the spaces of generating pairs of elements or subgroups are well-behaved in a number of ways: the set of pairs of elements generating a dense subgroup is Zariski-open in the…