Let L be a supersolvable lattice with non-zero Möbius function. We show that the order complex of any rank-selected subposet of L admits a convex-ear decomposition. This proves many new inequalities for the h-vectors of such complexes, and shows that their g-vectors are M-vectors.
For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a ...
International audienceIn this article we study supermodular functions on finite distributive lattice...
AbstractWe introduce the concept of a bounded below set in a lattice. This can be used to give a gen...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
We prove a theorem allowing us to find convex-ear decompositions for rankselected subposets of poset...
AbstractChari proved that if Δ is a (d−1)-dimensional simplicial complex with a convex ear decomposi...
AbstractWe study extremal problems concerning the Möbius function μ of certain families of subsets f...
AbstractDistributive supermatroids generalize matroids to partially ordered sets. Completing earlier...
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find ...
1.1. Superrigidity. In the early seventies, Margulis proved his celebrated super-rigidity theorem fo...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of co...
ABSTRACT. We show analogues of the classical Krein–Milman theo-rem for several ordered algebraic str...
The set of all convex sublattices CS(L) of a lattice L have been studied by a new approach. Introduc...
For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a ...
International audienceIn this article we study supermodular functions on finite distributive lattice...
AbstractWe introduce the concept of a bounded below set in a lattice. This can be used to give a gen...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
We prove a theorem allowing us to find convex-ear decompositions for rankselected subposets of poset...
AbstractChari proved that if Δ is a (d−1)-dimensional simplicial complex with a convex ear decomposi...
AbstractWe study extremal problems concerning the Möbius function μ of certain families of subsets f...
AbstractDistributive supermatroids generalize matroids to partially ordered sets. Completing earlier...
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find ...
1.1. Superrigidity. In the early seventies, Margulis proved his celebrated super-rigidity theorem fo...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of co...
ABSTRACT. We show analogues of the classical Krein–Milman theo-rem for several ordered algebraic str...
The set of all convex sublattices CS(L) of a lattice L have been studied by a new approach. Introduc...
For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a ...
International audienceIn this article we study supermodular functions on finite distributive lattice...
AbstractWe introduce the concept of a bounded below set in a lattice. This can be used to give a gen...