Partitions ofN-Space by Hyperplanes
From MaRDI portal
Publication:5543061
DOI10.1137/0114068zbMath0161.13601OpenAlexW2025762001MaRDI QIDQ5543061
Publication date: 1966
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0114068
Related Items
Exactly computing bivariate projection depth contours and median, PARTITION OF SYSTEMS' BEHAVIORS, Computation of projection regression depth and its induced median, Random polytopes in the d-dimensional cube, Counting the faces of randomly-projected hypercubes and orthants, with applications, On lattice point counting in \(\varDelta\)-modular polyhedra, The capacity of feedforward neural networks, Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids, Universality of approximate message passing with semirandom matrices, Algorithms for high dimensional stabbing problems, McCulloch-Pitts Brains and Pseudorandom Functions, The active bijection for graphs, On sparse spanners of weighted graphs, Enumeration in torus arrangements, A combinatorial analysis of topological dissections, A bijection for Eulerian-equivalence classes of totally cyclic orientations, Upper bounds on geometric permutations for convex sets, Neural networks as systems for recognizing patterns, The expected number of extreme points of a random linear program, The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region, Activity preserving bijections between spanning trees and orientations in graphs, The number of partitions of a set of N points in k dimensions induced by hyperplanes, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
