Packing lines in a hypercube

DOI10.1016/0012-365X(93)90327-PMaRDI QIDQ686153zbMATH OpenOpenAlexFDO

Authors Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman

Publication date 20 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90327-p

zbMATH Keywords

\(n\)-cubehypercubepacking lines

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

The authors characterize the \(n\)-tuples \((a_ 1,\dots,a_ n)\) for which one can find \(a_ i\) lines in the \(i\)th direction in the \(n\)-cube, \(i=1,2,\dots,n\), so that all lines are disjoint.

Recommendations

• Packing the hypercube
• Covering the cube by affine hyperplanes
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• CUBE PACKINGS IN EUCLIDEAN SPACES
• A note on perfect packing of \(d\)-dimensional cubes

Cited in

(14)

• Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
• Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
• Domination in certain chemical graphs
• Domination parameters in coronene torus network
• Partitioning the n-space into collinear sets of orthants
• Matchings in Lattice Graphs and Hamming Graphs
• A Short Introduction to Optimal Line Packings
• The fullerene graphs with a perfect star packing
• The maximum number of appearances of a word in a grid
• Packing the hypercube
• scientific article; zbMATH DE number 2230313 (Why is no real title available?)
• The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
• Diagonalization Games
• Packing in honeycomb networks

This page was built for publication: Packing lines in a hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686153)