Skip to Main content Skip to Navigation
Conference papers

New Bounds for Hypercube Slicing Numbers

Abstract : 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01182976
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 2:38:52 PM
Last modification on : Thursday, July 26, 2018 - 3:20:10 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:11:40 AM

File

dmAA0111.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01182976, version 1

Collections

Citation

M. Reza Emamy-Khansary, Martin Ziegler. New Bounds for Hypercube Slicing Numbers. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.155-164. ⟨hal-01182976⟩

Share

Metrics

Record views

269

Files downloads

678