Emamy-Khansary, M. Reza and Ziegler, Martin - New Bounds for Hypercube Slicing Numbers

dmtcs:2296 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
New Bounds for Hypercube Slicing Numbers

Authors: Emamy-Khansary, M. Reza and Ziegler, Martin

What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k 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 for S(d,k), d ≤ 8. These strengthen earlier results on hypercube cut numbers.


Source : oai:HAL:hal-01182976v1
Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Section: Proceedings
Published on: January 1, 2001
Submitted on: November 21, 2016
Keywords: Hypercube cut number,linear separability,combinatorial geometry,[INFO] Computer Science [cs],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Consultation statistics

This page has been seen 48 times.
This article's PDF has been downloaded 31 times.