English
Related papers

Related papers: Chains in shard lattices and BHZ posets

200 papers

The canonical join complex of a semidistributive lattice is a simplicial complex whose faces are canonical join representations of elements of the semidistributive lattice. We give a combinatorial classification of the faces of the…

Combinatorics · Mathematics 2017-10-02 Alexander Clifton , Peter Dillery , Alexander Garver

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

We introduce a new family of finite posets which we call 2-chains. These first arose in the study of 0-Hecke algebras, but they admit a variety of different characterisations. We give these characterisations, prove that they are equivalent…

Combinatorics · Mathematics 2020-01-30 Matthew Fayers

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Combinatorics · Mathematics 2016-08-19 Andrii Arman , Vojtěch Rödl

We study the set $\sncb (p,q)$ of annular non-crossing permutations of type B, and we introduce a corresponding set $\ncb (p,q)$ of annular non-crossing partitions of type B, where $p$ and $q$ are two positive integers. We prove that the…

Combinatorics · Mathematics 2008-02-12 Alexandru Nica , Ion Oancea

The ternary relation $B(x,y,z)$ of betweenness states that an element $y$ is between the elements $x$ and $z$, in some sense depending on the considered structure. In a partially ordered set $(N,\leq)$, $B(x,y,z):\Longleftrightarrow…

Logic in Computer Science · Computer Science 2021-12-01 Bruno Courcelle

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the…

Combinatorics · Mathematics 2024-12-13 Matthew Dyer , Christophe Hohlweg , Susanna Fishel , Alice Mark

In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two…

Combinatorics · Mathematics 2026-05-13 Riccardo Biagioli , Lorenzo Perrone

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Combinatorics · Mathematics 2020-06-02 Colin Defant , Michael Engen , Jordan A. Miller

We introduce and study a new partial order on Dyck paths. We prove that these posets are meet-semilattices. We show that their numbers of intervals are the same as the number of bicubic planar maps. We describe an unexpected connection with…

Combinatorics · Mathematics 2018-10-01 Frédéric Chapoton

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

The combined work of Bousquet-M\'elou, Claesson, Dukes, Jel\'inek, Kitaev, Kubitzke and Parviainen has resulted in non-trivial bijections among ascent sequences, (2+2)-free posets, upper-triangular integer matrices, and pattern-avoiding…

Combinatorics · Mathematics 2019-05-27 Mark Dukes , Peter R. W. McNamara

In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…

Combinatorics · Mathematics 2018-06-12 George M. Bergman

Gr\"atzer asked in 1971 for a characterization of sublattices of Tamari lattices (associahedra). A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice---in short, bounded…

Combinatorics · Mathematics 2013-04-24 Luigi Santocanale , Friedrich Wehrung

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…

Discrete Mathematics · Computer Science 2024-06-25 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

We force the existence of a chain of length $\omega_3$ in $[\omega_1]^{\omega_1}$ increasing modulo finite. The construction involves symmetric systems of models of two types as side conditions, introduced by the second author. This…

Logic · Mathematics 2026-04-20 David Asperó , Curial Gallart

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Combinatorics · Mathematics 2013-06-28 Yangzhou Hu

We prove that linear extensions of the Bruhat order of a matroid are shelling orders and that the barycentric subdivision of a matroid is a Coxeter matroid, viewing barycentric subdivisions as subsets of a parabolic quotient of a symmetric…

Combinatorics · Mathematics 2023-06-13 Davide Bolognini , Paolo Sentinelli

This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…

Combinatorics · Mathematics 2023-11-08 Daniel Tamayo Jiménez