|
|
A110356
|
|
Array read by antidiagonals: T(n,k) (n>=3, k>=3) = minimal number of polygonal pieces in a dissection of a regular n-gon to a regular k-gon (conjectured).
|
|
2
|
|
|
|
OFFSET
|
3,2
|
|
COMMENTS
|
I do not know which of these values have been proved to be minimal.
Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets.
See A110312 for further references and illustrations.
|
|
REFERENCES
|
G. N. Frederickson, Dissections: Plane and Fancy, Cambridge, 1997.
|
|
LINKS
|
|
|
EXAMPLE
|
Array begins:
6 6 1 7 ...
5 5 7 1 ...
8 7 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|