Macaulay posets are posets for which there is an analogue of the classical Kruskal-Katona theorem for finite sets. These posets are of great importance in many branches of combinatorics and have numerous applications. We survey mostly new and also some old results on Macaulay posets. Emphasis is also put on construction of extremal ideals in Macaulay posets
We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG (n; 2...
International audienceWe present here a family of posets which generalizes both partition and pointe...
AbstractLet Bn be the poset of subsets of {1,2,…,n} ordered by inclusion and Mn be the poset of mono...
Macaulay posets are posets for which there is an analogue of the classical Kruskal-Katona theorem fo...
We develop a new approach for establishing the Macaulayness of posets representable as cartesian pow...
We develop a new approach for establishing the Macaulayness of posets representable as cartesian pow...
AbstractWe develop a new approach for establishing the Macaulayness of posets representable as carte...
AbstractWe prove that the f-vector of members in a certain class of meet semi-lattices satisfies Mac...
AbstractLet Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same...
AbstractIt is a well known fact that a supersolvable lattice is EL-shellable. Hence a supersolvable ...
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length ...
This dissertation builds upon two well-known theorems: Macaulay's theorem on the Hilbert functions o...
If P is an upper semilattice whose Hasse diagram is a tree and whose cartesian powers are Macaulay, ...
We say that a Cohen-Macaulay poset (partially ordered set) is "superior" if euery open intenrnl ( x ...
AbstractWe say that a Cohen-Macaulay poset (partially ordered set) is "superior" if every open inter...
We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG (n; 2...
International audienceWe present here a family of posets which generalizes both partition and pointe...
AbstractLet Bn be the poset of subsets of {1,2,…,n} ordered by inclusion and Mn be the poset of mono...
Macaulay posets are posets for which there is an analogue of the classical Kruskal-Katona theorem fo...
We develop a new approach for establishing the Macaulayness of posets representable as cartesian pow...
We develop a new approach for establishing the Macaulayness of posets representable as cartesian pow...
AbstractWe develop a new approach for establishing the Macaulayness of posets representable as carte...
AbstractWe prove that the f-vector of members in a certain class of meet semi-lattices satisfies Mac...
AbstractLet Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same...
AbstractIt is a well known fact that a supersolvable lattice is EL-shellable. Hence a supersolvable ...
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length ...
This dissertation builds upon two well-known theorems: Macaulay's theorem on the Hilbert functions o...
If P is an upper semilattice whose Hasse diagram is a tree and whose cartesian powers are Macaulay, ...
We say that a Cohen-Macaulay poset (partially ordered set) is "superior" if euery open intenrnl ( x ...
AbstractWe say that a Cohen-Macaulay poset (partially ordered set) is "superior" if every open inter...
We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG (n; 2...
International audienceWe present here a family of posets which generalizes both partition and pointe...
AbstractLet Bn be the poset of subsets of {1,2,…,n} ordered by inclusion and Mn be the poset of mono...