Why the characteristic polynomial factors

DOI10.1090/S0273-0979-99-00775-2zbMATH Open0921.06001arXivmath/9812136OpenAlexW2150710569MaRDI QIDQ4235481FDOQ4235481

Authors: Bruce E. Sagan 

Publication date: 22 March 1999

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Abstract: We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on Zaslavsky's theory of signed graphs. The second approach is algebraic and employs results of Saito and Terao about free hyperplane arrangements. Finally, we consider a purely combinatorial theorem of Stanley about semimodular supersolvable lattices and its generalizations.

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

Recommendations

• Why the characteristic polynomial factors
• Factorization of the characteristic polynomial of a Lattice using quotient posets
• Factoring the characteristic polynomial of a lattice
• Characteristic polynomials of subspace arrangements and finite fields

zbMATH Keywords

signed graphsubspace arrangementhyperplane arrangementpartially ordered setWeyl arrangementsfree arrangementsupersolvable latticefinite ranked latticesMöbius functionfactorization of characteristic polynomialMöbius inversion theory

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Semimodular lattices, geometric lattices (06C10) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Conjectures on the quotient ring by diagonal invariants
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Title not available (Why is that?)
• Shellable nonpure complexes and posets. II
• The lattice of integer partitions
• Combinatorics of inductively factored arrangements
• Supersolvable lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Kazhdan-Lusztig cells in certain affine Weyl groups
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• Shellable Nonpure Complexes and Posets. I
• Title not available (Why is that?)
• The Geometry of Root Systems and Signed Graphs
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• The Broken-Circuit Complex
• Free arrangements of hyperplanes and unitary reflection groups
• Deformations of Coxeter hyperplane arrangements
• Characteristic polynomials of subspace arrangements and finite fields
• Sign Types Corresponding to an Affine Weyl Group
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• Möbius functions of lattices
• Hyperplane arrangements, interval orders, and trees.
• A class of lattices with Möbius function \(\pm 1,0\)
• Characteristic and Ehrhart polynomials
• Subspace arrangements of type \(B_ n\) and \(D_ n\)
• The homology of ``\(k\)-equal manifolds and related partition lattices
• Basic derivations for subarrangements of Coxeter arrangements
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries
• Title not available (Why is that?)
• Free arrangements of hyperplanes over an arbitrary field
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• A generalization of semimodular supersolvable lattice
• Posets of shuffles
• \(R\)-sequenceability and \(R^*\)-sequenceability of Abelian 2-groups
• Group actions on arrangements of linear subspaces and applications to configuration spaces
• The Jacobians and the discriminants of finite reflection groups
• BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
• Non-broken circuits of reflection groups and factorization in \(D_ n\)
• Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
• Title not available (Why is that?)
• The homology representations of the 𝑘-equal partition lattice

Cited In (17)

• Supersolvable LL-lattices of binary trees
• Extended linial hyperplane arrangements for root systems and a conjecture of Postnikov and Stanley
• On intervals in some posets of forests
• Free but not recursively free arrangements
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• Irreducible representations of semisimple algebraic groups and supersolvable lattices.
• Factorization of the characteristic polynomial of a Lattice using quotient posets
• On the poset and asymptotics of Tesler matrices
• Characteristic polynomials of the weak order on classical and affine Coxeter groups
• Why the characteristic polynomial factors
• ad-nilpotent ideals of a Borel subalgebra: generators and duality
• Factoring the characteristic polynomial of a lattice
• Determinants associated to zeta matrices of posets
• Applications of quotient posets
• The characteristic polynomial of the mixed arrangement
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
• The geometry of geometries: matroid theory, old and new

This page was built for publication: Why the characteristic polynomial factors

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