Related papers: $(P,\phi)$-Tamari lattices
Let $\mathcal{A}$ be an abelian length category containing a $d$-cluster tilting subcategory $\mathcal{M}$. We prove that a subcategory of $\mathcal{M}$ is a $d$-torsion class if and only if it is closed under $d$-extensions and…
In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a…
A method is proposed to systematically generate solutions of the two-dimensional Toda lattice equation in terms of previously known solutions $\phi\left(x,y\right)$ of the two-dimensional Laplace's equation. The two-dimensional solution of…
The notion of a $(\varphi,\hat{G})$-module is defined by Tong Liu in 2010 to classify lattices in semi-stable representations. In this paper, we study torsion $(\varphi,\hat{G})$-modules, and torsion p-adic representations associated with…
We introduce a class of integrable $l$-field first-order lattices together with corresponding Lax equations. These lattices may be represented as consistency condition for auxiliary linear systems defined on sequences of formal dressing…
The usual, or type A_n, Tamari lattice is a partial order on T_n^A, the triangulations of an (n+3)-gon. We define a partial order on T_n^B, the set of centrally symmetric triangulations of a (2n+2)-gon. We show that it is a lattice, and…
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…
Using conjugation of Shimura varieties, we produce nonisomorphic, cocompact, torsion-free lattices in $\mathrm{PU}(n,1)$ with isomorphic profinite completions for all $n \ge 2$. This disproves a conjecture of D. Kazhdan and gives the first…
We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [McNamara-Thomas] by combining results of…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…
We introduce cell modules for the tabular algebras defined in a previous work (math.QA/0107230); these modules are analogous to the representations arising from left Kazhdan--Lusztig cells. The standard modules of the title are constructed…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…
A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…
For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…
Narain lattices are unimodular lattices {\it in} $\R^{r,s}$, subject to certain natural equivalence relation and rationality condition. The problem of describing and counting these rational equivalence classes of Narain lattices in…
Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…