On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
Consider partitions of a rectangle into rectangles with restricted number of cross sections. The problem has an information theoretic flavor (in the spirit of ): richness of two dimensional pictures under 1–dimensional restrictions of from local information to global information.
We present two approaches to upper bound the cardinality of such partitions: a combinatorial recursion and harmonic analysis.
KeywordsLine Parallel Discrete Mathematic Common Boundary Extremal Graph Horizontal Side
Unable to display preview. Download preview PDF.
- 2.Bourgain, J.: Harmonic analysis and combinatorics: how much may they contribute to each other? In: Arnold, V., Atiyah, M., Lax, P., Mazur, B. (eds.), pp. 13–32. Mathematics: Frontiers and Perspectives (2000)Google Scholar
- 3.Ahlswede, R.: Coloring hypergraphs: A new approach to multi–user source coding, Part I. Journ. of Combinatorics, Information and System Sciences 4(1), 76–115 (1979); Part II 5(3), 220–268 (1980)Google Scholar