scientific article; zbMATH DE number 727439
From MaRDI portal
Publication:4324358
zbMath0844.52008MaRDI QIDQ4324358
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomputational complexitymatroidBetti numbersgeometric latticehyperplane arrangementsubspace arrangementintersection semilattice
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Eigenspace arrangements of reflection groups, Some combinatorial-algebraic problems from complexity theory, Möbius functions of lattices, Orbifold cohomology of torus quotients, Subspace arrangements over finite fields: Cohomological and enumerative aspects, Complexity lower bounds for computation trees with elementary transcendental function gates, Resolution of ideals associated to subspace arrangements, Neighborly cubical spheres and a cubical lower bound conjecture, Chains of modular elements and lattice connectivity, Characteristic and Ehrhart polynomials, Equivariant Euler characteristics of discriminants of reflection groups., Topological perplexity of feedback stabilization, On a generalization of Solomon-Terao formula for subspace arrangements, A topological proof of the Gibbard-Satterthwaite theorem, Around Arrow, Combinatorics of certain abelian Lie group arrangements and chromatic quasi-polynomials, On the cohomology of arrangements of subtori, Undecidability of \(c\)-arrangement matroid representations, Representability of matroids by \(c\)-arrangements is undecidable, Extended linial hyperplane arrangements for root systems and a conjecture of Postnikov and Stanley, On minimal Haar coverings of \(\Bbbk^2\) by three-dimensional spaces, The discrete fundamental group of the order complex of \(B_n\), Shellable nonpure complexes and posets. II, Configuration spaces of disks in an infinite strip, Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Combinatorial rigidity of incidence systems and application to dictionary learning, Skeleton simplicial evaluation codes, The axiomatization of affine oriented matroids reassessed, Poset fiber theorems, Derivation radical subspace arrangements, Decision tree complexity and Betti numbers, Polydiagonal compactification of configuration spaces, Convex equipartitions via equivariant obstruction theory, Spectral sequences on combinatorial simplicial complexes, On orbit configuration spaces of spheres, Why the characteristic polynomial factors, The \(h,k\)-equal partition lattice is EL-shellable when \(h \geq k\), Subspace arrangements of type \(B_ n\) and \(D_ n\), Matroids on partially ordered sets, From Bruhat intervals to intersection lattices and a conjecture of Postnikov, The zeta function of a simplicial complex, Formality of Pascal arrangements, Whitney homology of semipure shellable posets, A class of hypergraph arrangements with shellable intersection lattice, Testing isomorphism of graded algebras, Perspectives on \(A\)-homotopy theory and its applications, On cohomology algebras of complex subspace arrangements, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., Homotopy of non-modular partitions and the Whitehouse module, Group actions on arrangements of linear subspaces and applications to configuration spaces, Resolutions of ideals of subspace arrangements, Quotient complexes and lexicographic shellability, Polygraph arrangements, A comparison of Vassiliev and Ziegler-Živaljević models for homotopy types of subspace arrangements, The universal covers of hypertoric varieties and Bogomolov's decomposition
