Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Partitions of Discrete Boxes Ron Holzman
 

Summary: On Partitions of Discrete Boxes
Noga Alon
Tom Bohman
Ron Holzman
Daniel J. Kleitman§
February 22, 2002
Abstract
We prove that any partition of an n-dimensional discrete box into
nontrivial sub-boxes must consist of at least 2n
sub-boxes, and consider
some extensions of this theorem.
1 The theorem
A set of the form
A = A1 × A2 × · · · × An,
where A1, A2, . . . , An are finite sets with |Ai| 2, will be called here an
n-dimensional discrete box. A set of the form B = B1 × B2 × · · · × Bn,
where Bi Ai, i = 1, . . . , n, is a sub-box of A. Such a set B is said to be
nontrivial if = Bi = Ai for every i.
The following theorem answers a question posed by Kearnes and Kiss [1,
Problem 5.5].

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics