scientific article; zbMATH DE number 727439

From MaRDI portal
Revision as of 21:52, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4324358

zbMath0844.52008MaRDI QIDQ4324358

Anders Bjoerner

Publication date: 22 August 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (57)

Eigenspace arrangements of reflection groupsSome combinatorial-algebraic problems from complexity theoryMöbius functions of latticesOrbifold cohomology of torus quotientsSubspace arrangements over finite fields: Cohomological and enumerative aspectsComplexity lower bounds for computation trees with elementary transcendental function gatesResolution of ideals associated to subspace arrangementsNeighborly cubical spheres and a cubical lower bound conjectureChains of modular elements and lattice connectivityCharacteristic and Ehrhart polynomialsEquivariant Euler characteristics of discriminants of reflection groups.Topological perplexity of feedback stabilizationOn a generalization of Solomon-Terao formula for subspace arrangementsA topological proof of the Gibbard-Satterthwaite theoremAround ArrowCombinatorics of certain abelian Lie group arrangements and chromatic quasi-polynomialsOn the cohomology of arrangements of subtoriSubspace arrangements as generalized star configurationsUndecidability of \(c\)-arrangement matroid representationsRepresentability of matroids by \(c\)-arrangements is undecidableExtended linial hyperplane arrangements for root systems and a conjecture of Postnikov and StanleyOn minimal Haar coverings of \(\Bbbk^2\) by three-dimensional spacesThe discrete fundamental group of the order complex of \(B_n\)Shellable nonpure complexes and posets. IIConfiguration spaces of disks in an infinite stripLower bound on testing membership to a polyhedron by algebraic decision and computation treesCombinatorial rigidity of incidence systems and application to dictionary learningSkeleton simplicial evaluation codesThe axiomatization of affine oriented matroids reassessedPoset fiber theoremsDerivation radical subspace arrangementsDecision tree complexity and Betti numbersPolydiagonal compactification of configuration spacesConvex equipartitions via equivariant obstruction theorySpectral sequences on combinatorial simplicial complexesOn orbit configuration spaces of spheresWhy the characteristic polynomial factorsThe \(h,k\)-equal partition lattice is EL-shellable when \(h \geq k\)Underlying flag polymatroidsSubspace arrangements of type \(B_ n\) and \(D_ n\)Matroids on partially ordered setsFrom Bruhat intervals to intersection lattices and a conjecture of PostnikovThe zeta function of a simplicial complexFormality of Pascal arrangementsWhitney homology of semipure shellable posetsA class of hypergraph arrangements with shellable intersection latticeTesting isomorphism of graded algebrasPerspectives on \(A\)-homotopy theory and its applicationsOn cohomology algebras of complex subspace arrangementsGraph 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 moduleGroup actions on arrangements of linear subspaces and applications to configuration spacesResolutions of ideals of subspace arrangementsQuotient complexes and lexicographic shellabilityPolygraph arrangementsA comparison of Vassiliev and Ziegler-Živaljević models for homotopy types of subspace arrangementsThe universal covers of hypertoric varieties and Bogomolov's decomposition





This page was built for publication: