Related papers: Algebraic C(4) and T(4) groups are bi-automatic
Let M be a 4-manifold with residually finite fundamental group G having b_1(G) > 0. Assume that M carries a symplectic structure with trivial canonical class K = 0 in H^2(M). Using a theorem of Bauer and Li, together with some classical…
We determine the large scale geometry of the minimal displacement set of a hyperbolic isometry of a systolic complex. As a consequence, we describe the centraliser of such an isometry in a systolic group. Using these results, we construct a…
By a well-known theorem of Thomassen and a planar graph depicted by Voigt, we know that every planar graph is $5$-choosable, and the bound is tight. In 1999, Lam, Xu and Liu reduced $5$ to $4$ on $C_4$-free planar graphs. In the paper, by…
We generalize Gruber--Sisto's construction of the coned--off graph of a small cancellation group to build a partially ordered set $\mathcal{TC}$ of cobounded actions of a given small cancellation group whose smallest element is the action…
We show that the commensurator of any quasiconvex abelian subgroup in a biautomatic group is small, in the sense that it has finite image in the abstract commensurator of the subgroup. Using this criterion we exhibit groups that are CAT(0)…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…
In this paper we establish a gap phenomenon for immersed surfaces with arbitrary codimension, topology and boundaries that satisfy one of a family of systems of fourth-order anisotropic geometric partial differential equations. Examples…
Recently, Balogh--Morris--Samotij and Saxton--Thomason proved that hypergraphs satisfying some natural conditions have only few independent sets. Their main results already have several applications. However, the methods of proving these…
In this article we initiate research on locally compact C*-simple groups. We first show that every C*-simple group must be totally disconnected. Then we study C*-algebras and von Neumann algebras associated with certain groups acting on…
We introduce a generalisation of Condition (K) to finitely separated graphs and show that it is equivalent to essential freeness of the associated partial action as well as the exchange property of any of the associated tame algebras. As a…
Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…
This note is intended as an introduction to two previous works respectively by Dahmani, Guirardel, Osin, and by Cantat, Lamy. We give two proofs of a Small Cancellation Theorem for groups acting on a simplicial tree. We discuss the…
The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
According to Comfort, Raczkowski and Trigos-Arrieta, a dense subgroup D of a compact abelian group G determines G if the restriction homomorphism G^ --> D^ of the dual groups is a topological isomorphism. We introduce four conditions on D…
We study the geometry of infinitely presented groups satisfying the small cancelation condition C'(1/8), and define a standard decomposition (called the criss-cross decomposition) for the elements of such groups. We use it to prove the…
In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…
A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…
Four basic Dirac-type sufficient conditions for a graph $G$ to be hamiltonian are known involving order $n$, minimum degree $\delta$, connectivity $\kappa$ and independence number $\alpha$ of $G$: (1) $\delta \geq n/2$ (Dirac); (2) $\kappa…