English
Related papers

Related papers: A Poset Hierarchy

200 papers

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz

The purpose of this article is to give new constructions of linear orders which are minimal with respect to being non-$\sigma$-scattered. Specifically, we will show that Jensen's principle $\diamondsuit$ implies that there is a minimal…

Logic · Mathematics 2023-11-07 Todd Eisworth , James Cummings , Justin Tatch Moore

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

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

Group Theory · Mathematics 2026-02-18 Weijia Wang , Rui Wang

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

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

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

Combinatorics · Mathematics 2009-09-25 Jonathan David Farley

According to Kearnes and Oman (2013), an ordered set $P$ is \emph{J\'onsson} if it is infinite and the cardinality of every proper initial segment of $P$ is strictly less than the cardinaliy of $P$. We examine the structure of J\'onsson…

Logic · Mathematics 2017-12-29 Roland Assous , Maurice Pouzet

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

For $P$ a poset, the dimension of $P$ is defined to be the least cardinal $\kappa$ such that $P$ is embeddable in a direct product of $\kappa$ totally ordered sets. We study the behavior of this function on finite-dimensional (not…

Combinatorics · Mathematics 2026-04-07 George M. Bergman

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

To each lattice simplex $\Delta$ we associate a poset encoding the additive structure of lattice points in the fundamental parallelepiped for $\Delta$. When this poset is an antichain, we say $\Delta$ is antichain. To each partition…

Combinatorics · Mathematics 2019-01-11 Benjamin Braun , Brian Davis

We show that every poset P=(P,\le) satisfying the Ascending Chain Condition can be isomorphically embedded into the poset of all mappings from P to the set A(P) of all antichains of P equipped with a certain partial order relation. This…

General Mathematics · Mathematics 2026-02-03 Ivan Chajda , Helmut Länger

The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…

Logic · Mathematics 2016-05-23 Eric P. Astor , Damir D. Dzhafarov , Reed Solomon , Jacob Suggs

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

Logic · Mathematics 2024-11-05 Hannes Jakob

This paper presents combinatorial facts dealing with the number of unlabeled partially ordered sets (posets) refined by the number of arcs in the Hasse diagram (sequence A342447 in OEIS). The main result is that the differences with respect…

Combinatorics · Mathematics 2025-12-10 Rico Zöllner , Konrad Handrich

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

Combinatorics · Mathematics 2025-05-20 Frank a Campo

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

In this note we introduce the poset of $m$-multichains of a given poset $\mathcal{P}$. Its elements are the multichains of $\mathcal{P}$ consisting of $m$ elements, and its partial order is the componentwise partial order of $\mathcal{P}$.…

Combinatorics · Mathematics 2017-08-23 Henri Mühle