Whitney Numbers of Some Geometric Lattices

Ernesto Damiani, Ottavio M. D'Antona, Francesco RegonatiJ. Comb. Theory a 1994

TL;DR

This paper establishes a deep connection between the combinatorial concept of Whitney numbers and the algebraic structure of geometric lattices. The authors develop a framework to translate properties of polynomial sequences and their connection constants to the Whitney numbers of supersolvable geometric lattices, leading to unifying proofs for various lattice types.

What Problem Does This Paper Address?

The paper delves into the fascinating world of geometric lattices, which are combinatorial structures with rich algebraic properties. A key feature of these lattices is their characteristic polynomial, which encodes important information about the lattice's structure. The Whitney numbers are coefficients of these characteristic polynomials, and understanding their behavior is crucial for characterizing different types of lattices.

The authors aim to bridge the gap between the study of polynomial sequences and their connection constants (how one sequence can be expressed in terms of another) and the properties of Whitney numbers in specific classes of geometric lattices, namely supersolvable and modularly complemented ones. They seek to leverage existing results on polynomial sequences to gain new insights into the structure and properties of these lattices.

Methods

The paper employs a multi-pronged approach, combining abstract combinatorial theory with concrete lattice structures:

  • Polynomial Sequences and Connection Constants: The paper starts by defining and exploring properties of "persistent" polynomial sequences and their connection constants, drawing heavily on previous work (e.g., [Dam1]). This involves establishing recurrence relations and closed-form formulas for these constants based on the roots of the polynomials.
  • Lattice Theory Fundamentals: Key concepts like ranked posets, Moebius function, characteristic polynomials, uniform lattices, modular elements, and supersolvable lattices are defined and utilized.
  • Transfer of Properties: The core of the paper lies in transferring properties from the realm of polynomial sequences to Whitney numbers. This is achieved by establishing isomorphisms between lattice intervals and specific polynomial sequences, allowing theorems about polynomial connection constants to be applied to Whitney numbers.
  • Recursive and Explicit Formulas: The authors derive new recursive and explicit formulas for Whitney numbers of supersolvable geometric lattices, often expressed in terms of symmetric functions.
  • Log-Concavity Analysis: The paper investigates the log-concavity of sequences related to Whitney numbers, providing lattice-theoretic interpretations of results from symmetric function theory.
  • Characterization of Lattice Chains: A significant part of the work involves characterizing infinite chains of modularly complemented geometric lattices, identifying specific types of lattices that form such chains.

Datasets

Not discussed in the paper. The paper deals with theoretical structures rather than empirical data.

Key Insights and Ideas

  • Bridging Combinatorics and Lattice Theory: The paper masterfully connects abstract algebraic properties of polynomial sequences with the concrete combinatorial structure of geometric lattices through Whitney numbers. This allows for a unified approach to studying diverse lattice types.
  • Unifying Proofs: By translating known results about polynomial sequences, the authors provide unifying proofs for properties of Whitney numbers across various important lattice families (Boolean algebras, subspace lattices, partition lattices, Dowling lattices).
  • Lattice-Theoretic Interpretation of Log-Concavity: The paper offers a geometric interpretation of log-concavity for sequences related to symmetric functions, linking it to the presence of modular coatoms in general position within lattices.
  • Characterization of Infinite Chains: The identification of specific lattice types (Boolean algebras, subspace lattices, Dowling lattices) that form infinite chains of modularly complemented geometric lattices is a significant structural result.
  • The Power of Isomorphisms: The strategic use of isomorphisms between lattice intervals and specific polynomial sequences is a powerful technique for transferring complex results.

Key Results

  • Recursive and Explicit Formulas for Whitney Numbers: The paper provides new recursive and explicit formulas for Whitney numbers of supersolvable geometric lattices, expressed in terms of symmetric functions. For example, Theorem 3.1 gives:
  • $W_{n,k} = W_{n-1,k-1} - a_k W_{n-1,k}$

    • $W_{n,k} = W_{n-1,k-1} + a_{k+1} W_{n-1,k}$ where $a_i$ are related to the number of atoms in specific lattice intervals.
  • Log-Concavity Conditions: Lemma 4.1 establishes that if certain lattice intervals contain at least three modular coatoms in general position, then the sequence $a_1, a_2, a_3, \dots$ is log-concave. Theorem 4.2 extends this to Polya frequency and log-concave properties for various sequences of Whitney numbers.

  • Characterization of Infinite Chains: Theorem 5.2 states that an infinite chain of modularly complemented geometric lattices $L_0, L_1, L_2, \dots$ exists if and only if $L_n$ is either a Boolean algebra, a subspace lattice of a projective geometry, or a Dowling lattice.

Limitations and Future Work

  • Open Problem: The paper explicitly states that it remains an open problem to determine if the examples of geometric lattices provided (Boolean algebras, subspace lattices, Dowling lattices) are the only infinite sequences of geometric lattices satisfying the assumptions of their theorems. They note that Aigner's work addresses this for binary lattices.
  • Generalization: While the paper focuses on supersolvable and modularly complemented geometric lattices, further research could explore these connections for broader classes of lattices.
  • Injective Proofs: For some results, particularly concerning log-concavity, the authors refer readers to other works for injective proofs, suggesting that lattice-theoretic proofs might be more involved or less direct.
  • Further Exploration of Lattice Types: The characterization in Theorem 5.2 is a strong result, but further investigation into the specific properties and interrelationships of these identified lattice types could be fruitful.

Summary updated

BibTeX
@article{damiani1994whitney,
  author = {Ernesto Damiani and Ottavio M. D'Antona and Francesco Regonati},
  title = {{Whitney Numbers of Some Geometric Lattices}},
  journal = {J. Comb. Theory a},
  year = {1994},
}

Loading related content...

Figure