What is known about unit cubes

  title={What is known about unit cubes},
  author={Chuanming Zong},
  journal={Bulletin of the American Mathematical Society},
  • C. Zong
  • Published 26 January 2005
  • Computer Science
  • Bulletin of the American Mathematical Society
Unit cubes, from any point of view, are among the simplest and the most important objects in n-dimensional Euclidean space. In fact, as one will see from this survey, they are not simple at all. On the one hand, the known results about them have been achieved by employing complicated machineries from Number Theory, Group Theory, Probability Theory, Matrix Theory, Hyperbolic Geometry, Combinatorics, etc.; on the other hand, the answers for many basic problems about them are still missing. In… 

Tables from this paper

Workshop: Discrete Geometry Table of Contents

A number of remarkable recent developments in many branches of discrete geometry have been presented at the workshop, some of them demonstrating strong interactions with other fields of mathematics

Slices, Slabs, and Sections of the Unit Hypercube

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a

Rank-3 Projections of a 4-Cube

The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area

A Remark on the Extremal Non-Central Sections of the Unit Cube

In this paper, we investigate extremal volumes of non-central slices of the unit cube. The case of central hyperplane sections is known and was studied by Ball, Hadwiger and Hensley. The case of

Cube packings, second moment and holes

Alternating links, rational balls, and cube tilings

. When does the double cover of the three-sphere branched along an alternating link bound a rational homology ball? Heegaard Floer homology generates a necessary condition for it to bound: the link’s

Enumeration and investigation of acute 0/1-simplices modulo the action of the hyperoctahedral group

Abstract The convex hull of n + 1 affinely independent vertices of the unit n-cube In is called a 0/1-simplex. It is nonobtuse if none its dihedral angles is obtuse, and acute if additionally none of

Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities

The formula for the volume of hypercube clipped by a single hyperplane is generalized to the case of more than one hyperplane and an important foundation for the result is Lawrence's formula.

Multiple Lattice Tilings in Euclidean Spaces

Abstract In 1885, Fedorov discovered that a convex domain can form a lattice tiling of the Euclidean plane if and only if it is a parallelogram or a centrally symmetric hexagon. This paper proves the

Characterization of the Two-Dimensional Six-Fold Lattice Tiles

In 1885, Fedorov discovered that a convex domain can form a lattice tiling of the Euclidean plane if and only if it is a parallelogram or a centrally symmetric hexagon. It is known that there is no



Triangulations for the Cube

Simplexity of the cube


Let C"={x~R": Ix~]<-i i=1 , . . . ,n} be the n-dimensional cube and A be a d-dimensional subspace of R" having no point in common with the ( n d 1 ) dimensional faces of C". We want to find a lower

Simplices of maximal volume in hyperbolicn-space

An n-simplex in H n with vertices v0, ..., v , 6 Hn U ~H ~ is the dosed subset of Hn bounded by the n + I spheres which contain all the vertices except one and which are orthogonal to S "-1. k

A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes

It is shown that T(n) ?H(n), where H( n) is the ratio of the hyperbolic volume of the ideal cube to the ideal regular simplex, is equivalent to 12·6n/2(n+ 1)?n+12n!.

Lattice Tilings by Cubes: Whole, Notched and Extended

A new class of simple shapes that admit lattice tilings, the "extended cubes", which are unions of two axis-aligned rectangles that share a vertex and have intersection of odd codimension are exhibited.

A reduction of Keller's conjecture

A family of translates of a closedn-dimensional cube is called a cube tiling if the union of the cubes is the wholen-space and their interiors are disjoint. According to a famous unsolved conjecture

Lectures on 0/1-Polytopes

Several aspects of the complexity of higher-dimensional 0/1-polytopes are studied: the doubly-exponential number of combinatorial types, the number of facets which can be huge, and the coefficients of defining inequalities which sometimes turn out to be extremely large.

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes

All questions related to minimal triangulations of a three-dimensional convex polytope P have an affirmative answer and the gaps of size produced by allowing interior vertices or by using dissections may be linear in the number of points.