arXiv:1408.5805v2 [math.GR] 4 Oct 2016 Page 1 arXiv:1408.5805v2 [math.GR] 4 Oct 2016
GROUPS, ORDERS, AND DYNAMICS Bertrand Deroin CNRS andÉcole Normale Supérieure …

We construct total orders on the vertex set of an oriented tree. The orders are based only on
up-down counts at the interior vertices and the edges along the unique geodesic from a …

Graphs consist of vertices connected by edges. They are versatile structures, commonly
used to represent networks of transportation, communication, or persons. This versatility …

A regular left-order on a finitely generated group G is a total, left-multiplication invariant
order on G whose corresponding positive cone is the image of a regular language over the …

We show that there exists no left order on the free product of two nontrivial, finitely
generated, left-orderable groups such that the corresponding positive cone is represented …

We propose a criterion for preserving the regularity of a formal language representation
when passing from groups to subgroups. We use this criterion to show that the regularity of a …

We arrange classical small cancellation constructions to produce left-orderable groups: we
show that every finitely generated group is the quotient of a left-ordered small cancellation …

Résumé Un graphe est composé d'un ensemble de sommets reliés par des arêtes. Les
graphes sont des structures versatiles, couramment utilisées pour représenter des réseaux …

In this paper we consider groups of the form $ G\wr L $, where the set of generators naturally
extends the sets of generators of $ G $ and $ L $, and $ L $ admits a Cayley graph that is a …

For every finite rank k, k> 1, we explicitly construct (2k)! left orders on the free group F_k of
rank k. Each order is induced by a word of length 2k in which each generator of F_k and its …