Why the characteristic polynomial factors
From MaRDI portal
(Redirected from Publication:4235481)
Why the characteristic polynomial factors (scientific article; zbMATH DE number 1267647)
Why the characteristic polynomial factors (scientific article; zbMATH DE number 1267647)
factorization of characteristic polynomialfinite ranked latticesfree arrangementhyperplane arrangementMöbius functionMöbius inversion theorypartially ordered setsigned graphsubspace arrangementsupersolvable latticeWeyl arrangements
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02) Combinatorics of partially ordered sets (06A07) Semimodular lattices, geometric lattices (06C10) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
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.
Recommendations
Cites work
- \(R\)-sequenceability and \(R^*\)-sequenceability of Abelian 2-groups
- A class of lattices with Möbius function \(\pm 1,0\)
- A generalization of semimodular supersolvable lattice
- Basic derivations for subarrangements of Coxeter arrangements
- BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
- Characteristic and Ehrhart polynomials
- Characteristic polynomials of subspace arrangements and finite fields
- Combinatorics of inductively factored arrangements
- Conjectures on the quotient ring by diagonal invariants
- Deformations of Coxeter hyperplane arrangements
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Free arrangements of hyperplanes and unitary reflection groups
- Free arrangements of hyperplanes over an arbitrary field
- Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
- Group actions on arrangements of linear subspaces and applications to configuration spaces
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3781584 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 718864 (Why is no real title available?)
- scientific article; zbMATH DE number 727439 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 3803606 (Why is no real title available?)
- scientific article; zbMATH DE number 3366941 (Why is no real title available?)
- Hyperplane arrangements, interval orders, and trees.
- Möbius functions of lattices
- Non-broken circuits of reflection groups and factorization in \(D_ n\)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
- Posets of shuffles
- Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
- Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
- Shellable Nonpure Complexes and Posets. I
- Shellable nonpure complexes and posets. II
- Sign Types Corresponding to an Affine Weyl Group
- Subspace arrangements of type \(B_ n\) and \(D_ n\)
- Supersolvable lattices
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The Broken-Circuit Complex
- The Geometry of Root Systems and Signed Graphs
- The homology of ``\(k\)-equal manifolds and related partition lattices
- The homology representations of the 𝑘-equal partition lattice
- The Jacobians and the discriminants of finite reflection groups
- The Kazhdan-Lusztig cells in certain affine Weyl groups
- The lattice of integer partitions
Cited in
(17)- On intervals in some posets of forests
- On the poset and asymptotics of Tesler matrices
- ad-nilpotent ideals of a Borel subalgebra: generators and duality
- Why the characteristic polynomial factors
- Extended linial hyperplane arrangements for root systems and a conjecture of Postnikov and Stanley
- Supersolvable LL-lattices of binary trees
- Determinants associated to zeta matrices of posets
- The characteristic polynomial of the mixed arrangement
- Irreducible representations of semisimple algebraic groups and supersolvable lattices.
- Factorization of the characteristic polynomial of a Lattice using quotient posets
- Factoring the characteristic polynomial of a lattice
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- Applications of quotient posets
- Free but not recursively free arrangements
- The geometry of geometries: matroid theory, old and new
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
- Characteristic polynomials of the weak order on classical and affine Coxeter groups
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)
