English
Related papers

Related papers: Catalan lattices on series parallel interval order…

200 papers

It is shown that higher Bruhat orders admit a decomposition into a higher Tamari order, the corresponding dual Tamari order, and a "mixed order." We describe simplex equations (including the Yang-Baxter equation) as realizations of higher…

Mathematical Physics · Physics 2015-06-08 Aristophanes Dimakis , Folkert Müller-Hoissen

This paper introduces the geometric foundations for the study of the $s$-permutahedron and the $s$-associahedron, two objects that encode the underlying geometric structure of the $s$-weak order and the $s$-Tamari lattice. We introduce the…

Combinatorics · Mathematics 2025-02-26 Cesar Ceballos , Viviane Pons

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Probability · Mathematics 2007-05-23 Adam Hammett , Boris Pittel

We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

Combinatorics · Mathematics 2023-11-14 Joël Gay , Vincent Pilaud

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

Combinatorics · Mathematics 2025-09-03 Grant Barkley , Colin Defant , Patricia Hersh , Jon McCammond , Thomas McConville , David E Speyer

We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all…

Combinatorics · Mathematics 2013-03-18 Antonio Bernini , Luca Ferrari , Renzo Pinzani , Julian West

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Discrete Mathematics · Computer Science 2026-04-28 Julian Müller

Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

We introduce cubic coordinates, which are integer words encoding intervals in the Tamari lattices. Cubic coordinates are in bijection with interval-posets, themselves known to be in bijection with Tamari intervals. We show that in each…

Combinatorics · Mathematics 2023-01-02 Camille Combe

We investigate exact symmetries of a staggered fermion in D dimensions. The Dirac operator is reformulated by SO(2D) Clifford algebra. The chiral symmetry, rotational invariance and parity symmetries are clarified in any dimension. Local…

High Energy Physics - Lattice · Physics 2009-11-10 K. Itoh , M. Kato , M. Murata , H. Sawanaka , H. So

We characterize the associative, idempotent, symmetric, and order-preserving operations on (finite) chains in terms of properties of (the Hasse diagram of) their associated semilattice order. In particular, we prove that the number of…

Rings and Algebras · Mathematics 2018-05-31 Jimmy Devillet , Bruno Teheux

This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks…

Combinatorics · Mathematics 2026-05-18 Jonah Berggren , Clément Chenevière

We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and…

Combinatorics · Mathematics 2010-09-27 Samuele Giraudo

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

Metric Geometry · Mathematics 2019-08-15 Michael Baake , Rudolf Scharlau , Peter Zeiner

In our previous paper [Comm. Math. Phys. 330 (2014), 367-399] we described the asymptotic behaviour of trajectories of the full symmetric $\mathfrak{sl}_n$ Toda lattice in the case of distinct eigenvalues of the Lax matrix. It turned out…

Exactly Solvable and Integrable Systems · Physics 2016-08-23 Yury B. Chernyakov , Georgy I. Sharygin , Alexander S. Sorin

We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…

Classical Analysis and ODEs · Mathematics 2017-12-12 Roman Badora , Tomasz Kochanek , Barbara Przebieracz

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons

We determine the sharp asymptotic scale of the probability that two uniformly random permutations are comparable in weak Bruhat order, showing that $\mathbb{P}(\sigma_1 \preceq_W \sigma_2)=\exp\Bigl(\bigl(-\tfrac12+o(1)\bigr)\,n\log…

This paper enumerates all juxtaposition classes of the form "Av($abc$) next to Av($xy$)", where $abc$ is a permutation of length three and $xy$ is a permutation of length two. We use Dyck paths decorated by sequences of points to represent…

Combinatorics · Mathematics 2017-03-29 Robert Brignall , Jakub Sliacan
‹ Prev 1 4 5 6 7 8 10 Next ›