English
Related papers

Related papers: $f$-vector inequalities for order and chain polyto…

200 papers

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov

The Fon-Der-Flaass action partitions the order ideals of a poset into disjoint orbits. For a product of two chains, Propp and Roby observed --- across orbits --- the mean cardinality of the order ideals within an orbit to be invariant. That…

Combinatorics · Mathematics 2015-09-29 David B. Rush , Kelvin Wang

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

Combinatorics · Mathematics 2017-06-07 Stefan David , Hunter Spink , Marius Tiba

The atomic ordering in complex perovskite alloys is investigated by the cluster variation method (CVM). For the 1/3\{111\}-type ordered structure, the order-disorder phase transition is the first order, and the order parameter of the 1:2…

Materials Science · Physics 2009-10-31 Zhi-Rong Liu , Jian-She Liu , Bing-Lin Gu , Xiao-Wen Zhang

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

For a poset $(P;\leq)$, the quasiorders (AKA preorders) extending the poset order "$\leq$" form a complete lattice $F$, which is a filter in the lattice of all quasiorders of the set $P$. We prove that if the poset order "$\leq$" is small,…

Rings and Algebras · Mathematics 2024-02-26 Gábor Czédli

We study the behavior of $h$-vectors associated to matroid complexes under weak maps, or inclusions of matroid polytopes. Specifically, we show that the $h$-vector of the order complex of the lattice of flats of a matroid is component-wise…

Combinatorics · Mathematics 2023-05-26 Gaku Liu , Alexander Mason

We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad…

Combinatorics · Mathematics 2016-09-30 Frédéric Fauvet , Loïc Foissy , Dominique Manchon

Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…

Combinatorics · Mathematics 2026-05-01 Mateusz Michałek , Leonid Monin , Botong Wang

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In this paper, we analyze the toggle group on the set of antichains of a poset. Toggle groups, generated by simple involutions, were first introduced by Cameron and Fon-Der-Flaass for order ideals of posets. Recently Striker has motivated…

Combinatorics · Mathematics 2019-02-26 Michael Joseph

The profile vector of a family $\mathcal{F}$ of subsets of an $n$-element set is $(f_0,f_1, \ldots, f_n)$ where $f_i$ denotes the number of the $i$-element members of $\mathcal{F}$. In this paper we determine the extreme points of the set…

Combinatorics · Mathematics 2022-03-11 Dániel Gerbner

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work…

Quantum Physics · Physics 2026-04-13 Anna Jenčová

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…

Combinatorics · Mathematics 2016-10-14 Emily Meehan

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…

Logic · Mathematics 2020-11-26 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Combinatorics · Mathematics 2025-09-15 Maria-Romina Ivan , Sean Jaffe

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…

Combinatorics · Mathematics 2011-04-04 Christian Gutschwager

We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…

Combinatorics · Mathematics 2025-04-08 Ezgi Kantarcı Oğuz