English
Related papers

Related papers: Explicit left orders on free groups extending the …

200 papers

We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…

Logic · Mathematics 2023-09-26 Garrett Ervin , Ethan Gu

In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…

Group Theory · Mathematics 2011-03-09 Cristóbal Rivas

We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene…

Formal Languages and Automata Theory · Computer Science 2011-03-02 E. Charlier , M. Domaratzki , T. Harju , J. Shallit

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

Rings and Algebras · Mathematics 2009-05-08 Mark Kambites

We show that certain orderable groups admit no isolated left orders. The groups we consider are cyclic amalgamations of a free group with a general orderable group, the HNN extensions of free groups over cyclic subgroups, and a particular…

Group Theory · Mathematics 2018-12-19 Juan Alonso , Joaquin Brum

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

Formal Languages and Automata Theory · Computer Science 2022-07-28 Dominique Perrin , Andrew Ryzhikov

The Chen-Fox-Lyndon theorem states that every finite word over a fixed alphabet can be uniquely factorized as a lexicographically nonincreasing sequence of Lyndon words. This theorem can be used to define the family of Lyndon words in a…

Combinatorics · Mathematics 2019-02-01 Émilie Charlier , Manon Philibert , Manon Stipulanti

It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…

Group Theory · Mathematics 2018-03-16 Dale Rolfsen

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

Commutative Algebra · Mathematics 2007-05-23 Cristina G. Fernandes , Edward L. Green , Arnaldo Mandel

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

In `free word order' languages, every sentence is embedded in its specific context. Among others, the order of constituents is determined by the categories `theme', `rheme' and `contrastive focus'. This paper shows how to recognise and to…

cmp-lg · Computer Science 2008-02-03 Ralf Steinberger

Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data…

Computational Complexity · Computer Science 2016-05-02 Cynthia Kop , Jakob Grue Simonsen

We study the space of left-orderings on groups with finitely many Conradian orderings. We show that, within this class of groups, having an isolated left-ordering is equivalent to having finitely many left-orderings.

Group Theory · Mathematics 2011-11-11 Cristóbal Rivas

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

Formal Languages and Automata Theory · Computer Science 2009-10-26 Thomas Ang , Giovanni Pighizzini , Narad Rampersad , Jeffrey Shallit

This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…

Group Theory · Mathematics 2014-03-07 R. A. Borzooei , A. Dvurečenskij , O. Zahiri

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

Formal Languages and Automata Theory · Computer Science 2015-03-18 Zoltan Esik

We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R^{n+1},<_l), where <_l is the…

Logic · Mathematics 2010-11-09 Janak Ramakrishnan

Let G be a countable group. We show there is a topological relationship between the space CO(G) of circular orders on G and the moduli space of actions of G on the circle; as well as an analogous relationship for spaces of left orders and…

Dynamical Systems · Mathematics 2017-07-14 Kathryn Mann , Cristobal Rivas

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Group Theory · Mathematics 2018-07-04 Jillian D. McPhee , James D. Mitchell , Martyn Quick

Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to answer three conjectures. In particular we shall show that O_G can never be countably…

Group Theory · Mathematics 2007-05-23 Peter A. Linnell