New Bounds for Hypercube Slicing Numbers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

New Bounds for Hypercube Slicing Numbers

Martin Ziegler
  • Function : Author
  • PersonId : 945585

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.
Fichier principal
Vignette du fichier
dmAA0111.pdf (107.4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01182976 , version 1 (06-08-2015)

Identifiers

Cite

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, ⟨10.46298/dmtcs.2296⟩. ⟨hal-01182976⟩

Collections

INSMI TDS-MACS
63 View
717 Download

Altmetric

Share

Gmail Facebook X LinkedIn More