Meet-distributive lattices and the anti-exchange closure

@article{Edelman1980MeetdistributiveLA,
  title={Meet-distributive lattices and the anti-exchange closure},
  author={Paul H. Edelman},
  journal={algebra universalis},
  year={1980},
  volume={10},
  pages={290-299}
}
This paper defines the anti-exchange closure, a generalization of the order ideals of a partially ordered set. Various theorems are proved about this closure. The main theorem presented is that a latticeL is the lattice of closed sets of an anti-exchange closure if and only if it is a meet-distributive lattice. This result is used to give a combinatorial interpretation of the zetapolynomial of a meet-distributive lattice. 
Note on the description of join-distributive lattices by permutations
Let L be a join-distributive lattice with length n and width(JiL) ≤ k. There are two ways to describe L by k − 1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman andExpand
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
TLDR
This paper shows that the correspondence discovered by Koshevoy and Johnson and Dean is a duality between two semilattices of such operators, and uses this duality to obtain results concerning the "ordinal" representations of path independent choice functions from the theory of anti-exchange closure operators. Expand
Join-semidistributive lattices and convex geometries
Abstract We introduce the notion of a convex geometry extending the notion of a finite closure system with the anti-exchange property known in combinatorics. This notion becomes essential for theExpand
Coordinatization of finite join-distributive lattices
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as lattices with unique irreducible decompositions, introduced by R.P. Dilworth in 1940, andExpand
On the widths of finite distributive lattices
TLDR
It is shown that as one considers increasingly large distributive lattices, the maximum sized antichain contains a vanishingly small proportion of the elements. Expand
Closure Operators and Lattice Extensions
TLDR
In this chapter, the context is used to describe the extensions of a finite lattice that preserve various properties. Expand
An incidence Hopf Algebra of Convex Geometries
A lattice L is "meet-distributive" if for each element of L, the meets of the elements directly below it form a Boolean lattice. These objects are in bijection with "convex geometries", which are anExpand
CD-INDEPENDENT SUBSETS IN MEET-DISTRIBUTIVE LATTICES ∗
A subset X of a finite lattice L is CD-independent if the meet of any two incomparable elements of X equals 0. In 2009, Czedli, Hartmann and Schmidt proved that any two maximal CD-independent subsetsExpand
Coordinatization of join-distributive lattices
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts haveExpand
CD-independent subsets in meet-distributive lattices
A subset X of a finite lattice L is CD-independent if the meet of any two incomparable elements of X equals 0. In 2009, Czédli, Hartmann and Schmidt proved that any two maximal CD-independent subsetsExpand
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Combinatorial reciprocity theorems
On The Foundations of Combinatorial Theory: Combinatorial Geometries
It has been clear within the last ten years that combinatorial geometry, together with its order-theoretic counterpart, the geometric lattice, can serve to catalyze the whole field of combinatorialExpand