TY - CONF
AB - What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.
AU - Ziegler, Martin
AU - Emamy-Khansari, M. Reza
ID - 18166
T2 - Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)
TI - New Bounds for Hypercube Slicing Numbers
VL - AA
ER -