相关论文: Explicit left orders on free groups extending the …
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We prove (using grammars) that the free inverse monoid of every finite rank has co-context-free word problem. Equivalently, the co-word problem of the free inverse monoid of every finite rank is context-free.
We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…
Using dynamical techniques we show that there are no isolated elements on the space of left-preorders on a free product of two groups. As a consequence, when the groups are finitely generated, this space is either empty or a Cantor set. For…
In this work we exhibit flexibility phenomena for some (countable) groups acting by order preserving homeomorphisms of the line. More precisely, we show that if a left orderable group admits an amalgam decomposition of the form…
Motivated by well known results in low-dimensional topology, we introduce and study a topology on the set CO(G) of all left-invariant circular orders on a fixed countable and discrete group G. CO(G) contains as a closed subspace LO(G), the…
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…
We construct free monoids in a monoidal category with finite limits and countable colimits, in which tensoring on either side preserves reflexive coequalizers and colimits of countable chains.
In this article we study left I-orders in the bicyclic monoid $\mathcal{B}$. We give necessary and sufficient conditions for a subsemigroup of $\mathcal{B}$ to be a left I-oreder in $\mathcal{B}$. We then prove that any left I-order in…
A subcategory $\textbf{C}$ of a groupoid $\mathbb{G}$ is a left order in $\mathbb{G}$, if every element of $\mathbb{G}$ can be written as $a^{-1}b$ where $a, b \in \textbf{C}$. A subsemigroupoid $\mathfrak{C}$ of a groupoid $\mathbb{G}$ is…
Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that…
We continue our study of ordered context-free grammars, a grammar formalism that places an order on the parse trees produced by the corresponding context-free grammar. In particular, we simplify our previous definition of a derivation of a…
We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
Motivated by conjectures relating group orderability, Floer homology, and taut foliations, we discuss a systematic and broadly applicable technique for constructing left-orders on the fundamental groups of rational homology 3-spheres.…
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…
We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…
We study the categorical properties of right-preordered groups, giving an explicit description of limits and colimits in this category, and studying some exactness properties. We show that, from an algebraic point of view, the category of…
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…