an Eulerian poset is a graded poset in which every nontrivial interval has the same number of elements of even rank as of odd rank. An Eulerian poset which...
3 KB (407 words) - 23:45, 5 December 2024
h-vector, which is defined for an arbitrary ranked poset, and proved that for the class of Eulerian posets, the Dehn–Sommerville equations continue to hold...
14 KB (2,250 words) - 22:10, 25 May 2024
mathematics, in the branch of combinatorics, a graded poset is a partially-ordered set (poset) P equipped with a rank function ρ from P to the set N...
14 KB (1,934 words) - 18:45, 23 June 2025
Partially ordered set (redirect from Poset)
that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P = ( X , ≤ ) {\displaystyle P=(X,\leq )}...
40 KB (5,351 words) - 15:10, 28 June 2025
groups act transitively on the set of flags of the polytope. Eulerian poset Graded poset Regular polytope McMullen & Schulte 2002, p. 31 McMullen & Schulte...
35 KB (4,598 words) - 19:21, 22 July 2025
Glossary of order theory (redirect from Interval finite poset)
sets is open. Algebraic poset. A poset is algebraic if it has a base of compact elements. Antichain. An antichain is a poset in which no two elements...
29 KB (4,204 words) - 03:05, 12 April 2025
Antichain (redirect from Poset height)
to mean strong antichain, a subset such that there is no element of the poset smaller than two distinct elements of the antichain.) A maximal antichain...
8 KB (1,090 words) - 11:19, 27 February 2023
Order theory (section Visualizing a poset)
(transitivity). A set with a partial order on it is called a partially ordered set, poset, or just ordered set if the intended meaning is clear. By checking these...
31 KB (4,490 words) - 06:40, 21 June 2025
partially ordered set, or as an algebraic structure. A partially ordered set (poset) ( L , ≤ ) {\displaystyle (L,\leq )} is called a lattice if it is both a...
39 KB (5,451 words) - 17:40, 29 June 2025
189.2.4. S2CID 119158401. Stanley, Richard P. (1994). "A survey of Eulerian posets". In Bisztriczky, T.; McMullen, P.; Schneider, R.; Weiss, A. Ivić...
197 KB (20,289 words) - 21:04, 8 August 2025
introducing Zeta polynomials, for explicitly defining Eulerian posets, developing the theory of binomial posets along with Rota and Peter Doubilet, and more....
21 KB (2,149 words) - 22:20, 19 June 2025
graded posets with unique minimal and maximal elements, preserving the property that the posets are Eulerian. The star product of two graded posets ( P ...
2 KB (293 words) - 14:39, 9 June 2025
order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring...
13 KB (1,762 words) - 08:42, 16 June 2025
existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the real numbers. A special...
13 KB (1,914 words) - 19:45, 4 June 2025
a suitable notion of isomorphism for partially ordered sets (posets). Whenever two posets are order isomorphic, they can be considered to be "essentially...
8 KB (1,061 words) - 17:31, 22 December 2024
filter or order filter is a special subset of a partially ordered set (poset), describing "large" or "eventual" elements. Filters appear in order and...
24 KB (2,819 words) - 21:20, 27 July 2025
)-\ell (\pi )}} , and thus this poset is Eulerian, meaning its Möbius function is produced by the rank function on the poset. The Bruhat graph is the vertex-edge...
5 KB (667 words) - 17:01, 30 July 2025
generated from a given poset used in place of the set of generators considered above, then one speaks of a completion of the poset. The definition of the...
18 KB (2,709 words) - 14:43, 17 June 2025
Ko-free Go Ladder capturing in Go Gomoku Hex Konane Lemmings Node Kayles Poset Game Reversi River Crossing Rush Hour Finding optimal play in Mahjong solitaire...
19 KB (1,807 words) - 06:29, 9 June 2025
sets are also said to be duals if they are dually isomorphic, i.e. if one poset is order isomorphic to the dual of the other. The importance of this simple...
4 KB (457 words) - 00:47, 21 September 2023
Dolores-Cuenca, Eric; Mendoza-Cortes, Jose L. (2022). "A poset version of Ramanujan results on Eulerian numbers and zeta values". arXiv:2205.05208v3 [math.CO]...
145 KB (17,953 words) - 00:42, 3 August 2025
-complete proper filter on the set κ {\displaystyle \kappa } ; that is, on the poset ( ℘ ( κ ) , ⊆ ) {\displaystyle (\wp (\kappa ),\subseteq )} . If κ {\displaystyle...
5 KB (901 words) - 05:00, 6 June 2025
linear time, if such a diagram exists. In particular, if the input poset is a graded poset, it is possible to determine in linear time whether there is a...
11 KB (1,342 words) - 10:38, 16 December 2024
in terms of category theory. Formally, given two partially ordered sets (posets) ( S , ≤ ) {\displaystyle (S,\leq )} and ( T , ⪯ ) {\displaystyle (T,\preceq...
6 KB (817 words) - 22:01, 18 February 2025
Willigenburg, Stephanie (25 June 2003), "Peak quasisymmetric functions and Eulerian enumeration", Advances in Mathematics, 176 (2): 248–276, arXiv:0706.3486...
4 KB (328 words) - 17:27, 26 May 2025
Stanley; his dissertation was titled Permutation Statistics of Indexed and Poset Permutations. Einar moved to Gothenburg, Sweden in 1990, while still a graduate...
7 KB (602 words) - 05:44, 4 August 2025
Series-parallel partial order (redirect from Series-parallel poset)
three order relations a ≤ b ≥ c ≤ d is an example of a fence or zigzag poset; its Hasse diagram has the shape of the capital letter "N". It is not series-parallel...
18 KB (2,259 words) - 06:42, 10 May 2025
Hausdorff maximal principle. Indeed, let P {\displaystyle P} be a nonempty poset and X : = { C ⊆ P : C is a chain } {\displaystyle X\mathrel {\mathop {:}...
13 KB (2,424 words) - 02:29, 14 July 2025
sets ("posets") is reflexive: every poset is cofinal in itself. It is also transitive: if B {\displaystyle B} is a cofinal subset of a poset A , {\displaystyle...
8 KB (1,337 words) - 03:16, 22 April 2025
Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total...
756 bytes (82 words) - 15:41, 29 August 2023