TY  - JOUR
VL  - 155
N2  - Given a sequence   S=(s1,?,sm)?[0,1]m , a block B of S is a subsequence   B=(si,si+1,?,sj) . The size b of a block B is the sum of its elements. It is proved in [1] that for each positive integer n, there is a partition of S into n blocks B1,   ?,  B n with   |bi?bj|?1 for every i, j. In this paper, we consider a generalization of the problem in higher dimensions.
AV  - public
EP  - 46
JF  - Acta Mathematica Hungarica
N1  - This version is the author accepted manuscript. For information on re-use, please refer to the publisher?s terms and conditions.
SN  - 1588-2632
ID  - discovery1560883
KW  - sequence
KW  -  block partition
KW  -  transversal
TI  - Block partitions: an extended view
SP  - 36
UR  - http://doi.org/10.1007/s10474-018-0802-2
A1  - Barany, I
A1  - Csoka, E
A1  - Karolyi, G
A1  - Toth, G
Y1  - 2018/06/01/
PB  - SPRINGER
IS  - 1
ER  -