Why the characteristic polynomial factors

DOI10.1090/S0273-0979-99-00775-2zbMath0921.06001arXivmath/9812136OpenAlexW2150710569MaRDI QIDQ4235481

Bruce E. Sagan

Publication date: 22 March 1999

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

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

zbMATH Keywords

Möbius functionpartially ordered setsigned graphhyperplane arrangementsubspace arrangementWeyl arrangementsfree arrangementsupersolvable latticefinite ranked latticesfactorization of characteristic polynomialMöbius inversion theory

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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