Whitney Number Inequalities for Geometric Lattices

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial inequalities (05A20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

On the foundations of combinatorial theory I. Theory of M�bius Functions
Title not available (Why is that?)
Stirling Behavior is Asymptotically Normal
A Catalogue of Combinatorial Geometries
Concavity properties and a generating function for stirling numbers
Title not available (Why is that?)
On the Foundations of Combinatorial Theory II. Combinatorial Geometries
The Slimmest Geometric Lattices
Proof of a conjecture on finite modular lattices
Title not available (Why is that?)
A rank inequality for finite geometric lattices
Title not available (Why is that?)

Cited In (35)

Essence of independence: Hodge theory of matroids since June Huh
Complementing permutations in finite lattices
The Kazhdan-Lusztig polynomial of a matroid
Matchings and Radon transforms in lattices. I: Consistent lattices
On the unimodality of the independent set numbers of a class of matroids
Applications of lattice theory to graph decomposition
The Broken-Circuit Complex
A proof of a consequence of Dirac's conjecture
Matchings and Radon transforms in lattices II. Concordant sets
Modular Constructions for Combinatorial Geometries
Communication complexity and combinatorial lattice theory
Coloring complexes and combinatorial Hopf monoids
Right \(l\)-groups, geometric Garside groups, and solutions of the quantum Yang-Baxter equation
Cartesian lattice counting by the vertical 2-sum
The Slimmest Geometric Lattices
On the lines-planes inequality for matroids
Some properties of characteristic polynomials and applications to T- lattices
Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
Constructible Sheaf Complexes in Complex Geometry and Applications
Communication complexity in lattices
The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements
Degenerate \(r\)-Whitney numbers and degenerate \(r\)-Dowling polynomials via boson operators
The independent sets of rank k of a matroid
Classifications of finite highly transitive dimensional linear spaces
Combinatorics and Hodge theory
Combinatorial geometry takes the lead
Top-heavy phenomena for transformations
On the ``log rank-conjecture in communication complexity
Consistent dually semimodular lattices
A flag Whitney number formula for matroid Kazhdan-Lusztig polynomials
Pairings from down-sets and up-sets in distributive lattices
The Radon transforms of a combinatorial geometry, I
Arrangements, matroids and logarithmic vector fields. Abstracts from the workshop held June 16--21, 2024
Matching in modular lattices
The work of June Huh

This page was built for publication: Whitney Number Inequalities for Geometric Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050604)