Related papers: Formal language convexity in left-orderable groups
Given a finitely generated relatively hyperbolic group $G$, we construct a finite generating set $X$ of $G$ such that $(G,X)$ has the `falsification by fellow traveler property' provided that the parabolic subgroups $\{H_\omega\}_{\omega\in…
We show that first-order formulae are concise in acylindrically hyperbolic groups and certain extensions thereof. We study further classes of groups, including Burnside groups, icc groups, groups with the `Big Powers' condition, torus knot…
This is the second in a series of papers developing a theory of total positivity for loop groups. In this paper, we study infinite products of Chevalley generators. We show that the combinatorics of infinite reduced words underlies the…
I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…
We generalise Merzlyakov's theorem about the first-order theory of non-abelian free groups to all acylindrically hyperbolic groups. As a corollary, we deduce that if $G$ is an acylindrically hyperbolic group and $E(G)$ denotes the unique…
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
We study a class of two-generator two-relator groups, denoted $J_n(m,k)$, that arise in the study of relative asphericity as groups satisfying a transitional curvature condition. Particular instances of these groups occur in the literature…
We introduce the notion of a bounded weight function on a language, and show that the set of bounded weight functions on a regular language is a rational polyhedral cone. We study the cell recognised by a bounded weight function (that is,…
The second-order cone plays an important role in convex optimization and has strong expressive abilities despite its apparent simplicity. Second-order cone formulations can also be solved more efficiently than semidefinite programming in…
We introduce a new invariant of finitely generated groups, the ambiguity function, and prove that every finitely generated acylindrically hyperbolic group has a linearly bounded ambiguity function. We use this result to prove that the…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
A recent conjecture of the author and Teng Fang states that there are only finitely many finite simple groups with no cubic graphical regular representation. In this paper, we make a crucial progress towards this conjecture by giving an…
The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
A left orderable monster is a finitely generated left orderable group all of whose fixpoint-free actions on the line are proximal: the action is semiconjugate to a minimal action so that for every bounded interval $I$ and open interval $J$,…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…