2 citations · 6 across the 10 of their papers we have counts for
11 papers
Neighborly boxes and strings with jokers; constructions and asymptotics
Jarosław Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przesławski
We study families of axis-aligned boxes in a -dimensional Euclidean space whose placement is restricted by bounds on the dimension of their pairwise intersections…
Neighborly boxes and bipartite coverings; constructions and conjectures
Jarosław Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przesławski
Two axis-aligned boxes in are \emph{-neighborly} if their intersection has dimension at least and at most . The maximum number of pairwise -neighbor…
New bounds on the maximum number of neighborly boxes in R^d
Noga Alon, Jarosław Grytczuk, Andrzej P. Kisielewicz +1
A family of axis-aligned boxes in $\er^d$ is \emph{-neighborly} if the intersection of every two of them has dimension at least and at most . Let denote the…
There are at most neighbourly simplices in dimension
Andrzej P. Kisielewicz, Krzysztof Przesławski
A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most neighbourly simplices in , is presented.
A general inequality for packings of boxes
Krzysztof Przesławski
Keller packings and tilings of boxes are investigated. Certain general inequality measuring a complexity of such systems is proved. A straightforward application to the unit cube t…
Nearly neighbourly families of standard boxes
Jacek Bojarski, Andrzej P. Kisielewicz, Krzysztof Przesławski
It is demonstrated that each nearly neighbourly family of standard boxes in has at most 12 elements. A combinatorial classification of all such families that have ex…