Related papers: Regular left-orders on groups

We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…

In [BB] Benjamin Baumslag proved that being fully residually free is equivalent to being residually free and commutative transitive (CT). Gaglione and Spellman [GS] and Remeslennikov [Re] showed that this is also equivalent to being…

Let $G$ be a connected, semisimple, real Lie group with finite centre, with real rank at least two. B.Deroin and S.Hurtado recently proved the 30-year-old conjecture that no irreducible lattice in $G$ has a left-invariant total order.…

We prove that the subgroup graph of a finite group $G$ is regular if and only if $G$ is cyclic with square-free order.

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…

Let $R$ be a left-symmetric conformal algebra and $Q$ be a $\mathbb{C}[\partial]$-module. We introduce the notion of a unified product for left-symmetric conformal algebras and apply it to construct an object $\mathcal{H}^2_R(Q,R)$ to…

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$,…

We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation…

In [A. Stolz and A. Thom, On the lattice of normal subgroups in ultraproducts of compact simple groups, PLMS 108(1), 2014] it was stated that the lattice of normal subgroups of an ultraproduct of finite simple groups is always linearly…

We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that free groups cannot be given discrete orders, although they do have right-orders which are…

For finitely generated groups $H$ and $G$, we observe that $H$ admits a translation-like action on $G$ implies there is a regular map, which was introduced in Benjamini, Schramm and Tim\'{a}r's joint paper, from $H$ to $G$. Combining with…

We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, \omega), where \gk is an appropriate regular subalgebra of…

A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS…

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

A group $G$ is called automatically continuous if any homomorphism from a completely metrizable or locally compact Hausdorff group to $G$ has open kernel. In this paper, we study preservation of automatic continuity under group-theoretic…