English
Related papers

Related papers: A self-dual poset on objects counted by the Catala…

200 papers

The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple…

Combinatorics · Mathematics 2025-04-11 Carolina Benedetti , Anton Dochtermann , Kolja Knauer , Yupeng Li

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

Combinatorics · Mathematics 2017-03-31 Raman Sanyal , Christian Stump

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

Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric…

Combinatorics · Mathematics 2025-06-13 Jordan Lambert , Lonardo Rabelo

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Rings and Algebras · Mathematics 2021-03-24 Ivan Chajda , Helmut Länger

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

Combinatorics · Mathematics 2022-06-28 Angela Carnevale , Matthew Dyer , Paolo Sentinelli

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

Combinatorics · Mathematics 2018-02-19 Ian T. Johnson

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Logic · Mathematics 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Logic · Mathematics 2023-10-17 Miloš S. Kurilić , Stevo Todorčević

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

Combinatorics · Mathematics 2012-01-31 Graham Brightwell , Malwina Luczak

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

Logic · Mathematics 2023-12-05 Nattapon Sonpanow , Pimpen Vejjajiva

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 extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Morgan Weiler

We show that the sorting probability of the Catalan poset} $P_n$ satisfies $\delta(P_n)= O \bigl(n^{-5/4}\bigr)$.

Combinatorics · Mathematics 2022-12-05 Swee Hong Chan , Igor Pak , Greta Panova

We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first…

Category Theory · Mathematics 2025-01-27 Brandon T. Shapiro , David I. Spivak

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

Combinatorics · Mathematics 2011-08-17 Gábor Hetyei , Christian Krattenthaler

We show that plane bipolar posets (i.e., plane bipolar orientations with no transitive edge) and transversal structures can be set in correspondence to certain (weighted) models of quadrant walks, via suitable specializations of a bijection…

Combinatorics · Mathematics 2023-10-03 Éric Fusy , Erkan Narmanli , Gilles Schaeffer

Every partial applicative structure gives rise to an indexed binary relation, that is a contravariant functor from the category of sets to the category of sets endowed with binary relations and maps preserving them. In this paper we…

Logic · Mathematics 2022-11-22 Samuele Maschio

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

Logic · Mathematics 2017-09-26 Milos S. Kurilic