No label defined (Q3138290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 431514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 431514 |
Statements
28 August 1994
0 references
rank-rectangle
0 references
bounds
0 references
subrectangles
0 references
rectangle
0 references
0.7651033401489258
0 references
0.7610008716583252
0 references
0.7604358196258545
0 references
0.7574551701545715
0 references
The author presents upper and lower bounds for the maximum number of subrectangles, called \(f(n)\), that a rectangle can be partitioned into so that any line that is parallel to a side of the rectangle intersects at most \(n\) subrectangles. Bounds are also presented for the problems where ``rectangle'' is replaced by ``rank-rectangle'' (in which subrectangles that stretch from a side to the opposite side are deleted), and where the lines can have arbitrary slope. Conjectures for improvements of these bounds, including the conjecture that \(f(n)= 3\cdot 2^{n-1}- 2\) (the current lower bound) for the original problem, as well as a list of open problems, are also provided. For the entire collection see [Zbl 0778.00037].
0 references