Related papers: Tamari lattices, forests and Thompson monoids
Following the completion of the algebraic construction of the Poisson wild character varieties (B.--Yamakawa, 2015) one can consider their natural deformations, generalising both the mapping class group actions on the usual (tame) character…
We study the algebraic combinatorics of monomial degenerations of Pl\"ucker forms which is governed by matching fields in the sense of Sturmfels and Zelevinsky. We provide a necessary condition for a matching field to yield a Khovanskii…
In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…
We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
In this paper we describe the general theory of constructing toroidal compactifications of locally symmetric spaces and using these to compute dimension formulas for spaces of modular forms. We focus explicitly on the case of the orthogonal…
A slight modification of the definition of the Thompson-Higman groups G_k1 and F_k1 leads to inverse monoids that map onto G_k1 (respectively F_k1), and that have interesting properties: they are finitely generated, and residually finite.…
We discuss condensed left-orderings and develop new techniques to show that the conjugacy relation on the space of left-orderings is not smooth. These techniques apply to the solvable Baumslag Solitar groups and to Thompson's group F.
We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…
We count numbers of tame frieze patterns with entries in a finite commutative local ring. For the ring $\mathbb{Z}/p^r\mathbb{Z}$, $p$ a prime and $r\in\mathbb{N}$ we obtain closed formulae for all heights. These may be interpreted as…
As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the…
In this paper we study the reduction of PEL-Shimura varieties associated to unitary groups of signature (n-1,1) in the inert and unramified case. We describe the Newton polygon and the Ekedahl-Oort stratification. We further study the…
The usual coherence theorem of MacLane for categories with multiplication assumes that a certain pentagonal diagram commutes in order to conclude that associativity isomorphisms are well defined in a certain practical sense. The practical…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
The present paper records more details of the relationship between primitive elements and palindromes in F_2, the free group of rank two. We characterise the conjugacy classes of primitive elements which contain palindromes as those which…
Given a classical $r$-matrix on a Poisson algebra, we show how to construct a natural family of compatible Poisson structures for the Hamiltonian formulation of Lax equations. Examples for which our formalism applies include the Benny…
We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set. Namely, we…
Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.
We prove that the category of boolean inverse monoids is dually equivalent to the category of boolean groupoids. This generalizes the classical Stone duality between boolean algebras and boolean spaces. As an instance of this duality, we…
We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…