Factoring the characteristic polynomial of a lattice

DOI10.1016/J.JCTA.2015.06.006MaRDI QIDQ490907zbMATH OpenOpenAlexFDO

Authors Joshua Hallam, Bruce E. Sagan

Publication date 21 August 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.0666

zbMATH Keywords

factorizationquotientcharacteristic polynomialsupersolvableincreasing forestMöbius function

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain this factorization. Our main theorem will give two simple conditions under which the characteristic polynomial factors with nonnegative integer roots. We will see that Stanley's Supersolvability Theorem is a corollary of this result. Additionally, we will prove a theorem which gives three conditions equivalent to factorization. To our knowledge, all other theorems in this area only give conditions which imply factorization. This theorem will be used to connect the generating function for increasing spanning forests of a graph to its chromatic polynomial. We finish by mentioning some other applications of quotients of posets as well as some open questions.

Recommendations

• Factorization of the characteristic polynomial of a Lattice using quotient posets
• Why the characteristic polynomial factors
• Why the characteristic polynomial factors
• Characterizations of partition lattices
• Applications of quotient posets

Cites work

• scientific article; zbMATH DE number 3781584 (Why is no real title available?)
• Abstract Theory of Inversion of Finite Series
• Applications of quotient posets
• Broken circuit complexes: Factorizations and generalizations
• Character formulas for the operad of two compatible brackets and for the bi-Hamiltonian operad
• Crosscut-simplicial lattices
• Factorizations of the Orlik-Solomon algebras
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• Higher trivariate diagonal harmonics via generalized Tamari posets
• Möbius functions of lattices
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Signed graph coloring
• Supersolvable lattices
• Why the characteristic polynomial factors

Cited in

(19)

• Increasing spanning forests in graphs and simplicial complexes
• Immanant varieties
• Factorizing lattices by interval relations
• Why the characteristic polynomial factors
• The category of G-posets
• Applications of quotient posets
• Factorization of the characteristic polynomial of a Lattice using quotient posets
• Why the characteristic polynomial factors
• Rank-metric lattices
• A local injective proof of log-concavity for increasing spanning forests
• The amazing chromatic polynomial
• A symmetric function of increasing forests
• Natural factors of the Medvedev lattice capturing IPC
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
• On the poset and asymptotics of Tesler matrices
• Interview with Bruce Sagan
• The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
• The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
• A modular characterization of supersolvable lattices

This page was built for publication: Factoring the characteristic polynomial of a lattice

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