On combinatorial problem concerning partitions of a box into boxes
| dc.creator | Tyszka, Apoloniusz | |
| dc.date | 2006-11-26 | |
| dc.date | 2006-11-28 | |
| dc.date.accessioned | 2026-07-07T07:33:21Z | |
| dc.date.available | 2026-07-07T07:33:21Z | |
| dc.description | We consider partitions of n-dimensional boxes in R^n, n>1, into a finite number of boxes with pairwise disjoint interiors. We study sets X \subseteq (0,\infty) with the Property (W_n): for every n-dimensional box P and every partition of P, if each constituent box has one side with the length belonging to X, then the length of one side of P belongs to X. We prove that the set X \subseteq (0,\infty) has Property (W_n) if and only if X is closed with respect to the operations: x+y and x+y+z-2min(x,y,z). | |
| dc.description | 3 pages, LaTeX2e, added the address http://www.cyf-kr.edu.pl/~rttyszka/jnatgeom1994.doc to item 4 of the References | |
| dc.identifier | https://arxiv.org/abs/math/0611798 | |
| dc.identifier | http://arxiv.org/abs/math/0611798 | |
| dc.identifier | Journal of Natural Geometry 8 (1995), no. 2, pp. 129-132 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119427 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 52C22, 05B45 | |
| dc.title | On combinatorial problem concerning partitions of a box into boxes | |
| dc.type | text |