Pseudomodular lattices and continuous matroids
The main result of this paper is that the existence of pseudointersections in suitable sequences of geometric lattices can be used to construct stretch embeddings and thereby continuous analogues. The authors give some nice examples of pseudomodular lattices and prove that a principal extension of a pseudomodular lattice is again pseudomodular (Theorem 3.4). The theorem upon their construction is based is the following: Let L be a pseudomodular lattice and \(a_ 1,...,a_ k\) elements of L such that \(r(a_ 1)+...+r(a_ k)=r(a_ 1\vee...\vee a_ k).\) Then the sublattice generated by the intervals \([0,a_ i]\) is isomorphic to the direct product of these intervals. (Theorem 4.1).
- On pseudomodular matroids and adjoints
- Continuous matroids revisited
- Matroid matching in pseudomodular lattices
- On some dimensions of modular lattices and matroids
- On upper continuous and semimodular lattices
- Uniform semimodular lattices and valuated matroids
- Representations of matroids in semimodular lattices
- Pseudomatroids
- On lattice-theoretical construction of matroids
- On matroid lattices and its properties
- On pseudomodular matroids and adjoints
- Gammoids, pseudomodularity and flatness degree
- Matroid matching with Dilworth truncation
- Continuous matroids revisited
- Modular Substructures in Pseudomodular Lattices.
- The matroid of a graphing
- On algebraic matroids
- Optimizing extension techniques for discovering non-algebraic matroids
- On forbidden configuration of pseudomodular lattices.
- p-independence implies pseudomodularity
This page was built for publication: Pseudomodular lattices and continuous matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784087)