Matroid Representations and free Arrangements
From MaRDI portal
Publication:3348923
DOI10.2307/2001687zbMath0727.05019OpenAlexW4248720610MaRDI QIDQ3348923
Publication date: 1990
Full work available at URL: https://doi.org/10.2307/2001687
hyperplane arrangementTerao's conjectureFreenessabstract matroidsfield characteristicmodule of logarithmic forms
Multiplicity theory and related topics (13H15) Polyhedra and polytopes; regular figures, division of spaces (51M20) Combinatorial aspects of matroids and geometric lattices (05B35) Lattices of subspaces and geometric closure systems (51D25)
Related Items
Addition-deletion theorems for factorizations of Orlik-Solomon algebras and nice arrangements, Non-recursive freeness and non-rigidity, A generalization of semimodular supersolvable lattice, Inductive and Recursive Freeness of Localizations of Multiarrangements, Free arrangements and rhombic tilings, On the fundamental group of the complement of a complex hyperplane arrangement, Supersolvable resolutions of line arrangements, A homological characterization for freeness of multi-arrangements, Fiber-type arrangements and factorization properties, Modular construction of free hyperplane arrangements, Freeness of hyperplane arrangements and related topics, Broken circuit complexes: Factorizations and generalizations, Supersolvable and modularly complemented matroid extensions, Free arrangements over finite field, Graded derivation modules and algebraic free divisors, Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements, Cohomology of Local Sheaves on Arrangement Lattices, Factorizations of the Orlik-Solomon algebras, Divisionally free restrictions of reflection arrangements, Basic derivations for subarrangements of Coxeter arrangements, Combinatorial construction of logarithmic differential forms, On the geometry of real or complex supersolvable line arrangements, A pattern avoidance criterion for free inversion arrangements, A geometric condition for a hyperplane arrangement to be free, Free but not recursively free arrangements, Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\), Hyperplane arrangements and linear strands in resolutions, Computing the nonfree locus of the moduli space of arrangements and Terao’s freeness conjecture
Cites Work
- A formula for the characteristic polynomial of an arrangement
- Free arrangements of hyperplanes and supersolvable lattices
- Line-closed combinatorial geometries
- Free arrangements of hyperplanes over an arbitrary field
- Free arrangements of hyperplanes and unitary reflection groups
- Computational algebraic geometry of projective configurations
- Combinatorial construction of logarithmic differential forms
- Modular elements of geometric lattices
- Supersolvable lattices
- On the Uniqueness of Matroid Representations Over GF(4)
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Theory of Matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
