Factoring the characteristic polynomial of a lattice

DOI10.1016/J.JCTA.2015.06.006zbMATH Open1319.05143arXiv1403.0666OpenAlexW1898022286MaRDI QIDQ490907FDOQ490907

Bruce E. Sagan, Joshua Hallam

Publication date: 21 August 2015

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

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.

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

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+function&go=Go M��bius function]factorizationquotientcharacteristic polynomialsupersolvableincreasing forest

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• Rank-metric lattices
• A modular characterization of supersolvable lattices
• On the poset and asymptotics of Tesler matrices
• Increasing spanning forests in graphs and simplicial complexes
• The amazing chromatic polynomial
• A local injective proof of log-concavity for increasing spanning forests
• Immanant varieties
• Why the characteristic polynomial factors
• A Symmetric Function of Increasing Forests
• Factorizing lattices by interval relations
• 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
• Natural factors of the Medvedev lattice capturing IPC
• The category of G-posets
• Applications of quotient posets
• Interview with Bruce Sagan
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling 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)