Linear Decision Trees, Subspace Arrangements, and Mobius Functions
From MaRDI portal
Publication:4305906
arrangements of convex setsconvex polyhedronlinear decision treeMöbius functionspartition latticesubspace arrangements
Algebraic combinatorics (05E99) Combinatorics of partially ordered sets (06A07) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Topological manifolds (57N99) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Management decision making, including multiple objectives (90B50)
Recommendations
- Decision trees: Old and new results.
- Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
- Lower bounds for linear decision trees with bounded weights
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
- scientific article; zbMATH DE number 176776
Cited in
(30)- Whitney homology of semipure shellable posets
- General lexicographic shellability and orbit arrangements
- Möbius functions of lattices
- Subspace arrangements over finite fields: Cohomological and enumerative aspects
- Characteristic and Ehrhart polynomials
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Representation stability for families of linear subspace arrangements
- Subspace arrangements of type \(B_ n\) and \(D_ n\)
- On the topology of two partition posets with forbidden block sizes
- Decision trees: Old and new results.
- Homology representations arising from the half cube. II
- Euler characteristics of exotic configuration spaces
- Configuration spaces of disks in an infinite strip
- Homology representations arising from the half cube
- Three Ehrhart quasi-polynomials
- The \(h,k\)-equal partition lattice is EL-shellable when \(h \geq k\)
- Exponential Dowling structures
- Perspectives on \(A\)-homotopy theory and its applications
- On decision trees for orthants
- Group actions on arrangements of linear subspaces and applications to configuration spaces
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
- On the homology of the real complement of the \(k\)-parabolic subspace arrangement
- Shellable nonpure complexes and posets. II
- A broad class of shellable lattices
- Decision tree complexity and Betti numbers
- A homotopy equivalence for partition posets related to liftings of \(S_{n-1}\)-modules to \(S_n\)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
- Connection between coordinate and diagonal arrangement complements
- The discrete fundamental group of the order complex of B_n
- Shellable complexes and topology of diagonal arrangements
This page was built for publication: Linear Decision Trees, Subspace Arrangements, and Mobius Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305906)
