Two Dozen
Unsolved Problems
in Plane Geometry
Erich Friedman
Stetson University
Stetson University
3/27/04
efriedma@stetson e
efriedma@stetson.e
du
Polygons
Polygons
1. Polygonal Illumination Problem
" Given a polygon S constructed with
mirrors as sides, and given a point P
iid d i i t P
in the interior of S,
i th i id f S
is the inside of S
completely
illuminated by a
illuminated by a
light source at P?
1. Polygonal Illumination Problem
" It is conjectured that for every S and P
that the answer is yes but this is not
that the answer is yes, but this is not
known.
" Even this easier problem is open: Does
every polygon S have some point P
where a light source would illuminate
the interior?
1. Polygonal Illumination Problem
" For non-polygonal regions, the
conjecture is false as shown by the
conjecture is false, as shown by the
example below.
" The top and
Th t d
bottom are
elliptical arcs with
lli ti l ith
foci shown,
connected with
t d ith
some circular
2 Overlapping Polygons
2. Overlapping Polygons
" Let A and B be congruent overlapping
" Let A and B be congruent overlapping
rectangles with perimeters AP and BP .
" What is the best possible upper bound
for
length(A)"BP )
R ?
R = ------------------ ?
length(AP )"B)
" It is known that R d" 4.
It is kno n that R d" 4
2 Overlapping Polygons
2. Overlapping Polygons
" We
" We can find R values arbitrarily close
to 3.can find R values arbitrarily close
" Is it true that R d" 3?
I it t th t R d" 3?
2 Overlapping Polygons
2. Overlapping Polygons
" Let A and B are congruent overlapping
" Let A and B are congruent overlapping
triangles with smallest angle ¸ with
perimeters A and B
perimeters AP and BP .
" Conjecture: The best bound is
Conjecture: The best bound is
length(A)"BP )
R" d" csc(¸/2)
R" = ------------------ d" csc(¸/2).
length(AP )"B)
3 Kabon Triangle Problem
3. Kabon Triangle Problem
" How many disjoint triangles can be
H di j i t t i l b
created with n lines?
" The sequence K(n) starts 0, 0, 1, 2, 5, 7,
.&
3 Kabon Triangle Problem
3. Kabon Triangle Problem
" The sequence continues 11 15 20
" The sequence continues & 11, 15, 20, &
" What is K(10)?
What is K(10)?
3 Kabon Triangle Problem
3. Kabon Triangle Problem
" How fast does K(n) grow?
" Easy to show (n-2) d" K(n) d" n(n-1)(n-
2)/6.
" Tamura proved that K(n) d" n(n-2)/3.
" It is not even known if K(n)=o(n2).
4. n-Convex Sets
4. n Convex Sets
" A set S is called convex if the line
between any two points of S is also in
S.
" A set S is called n-convex if given any n
points in S there exists a line between
points in S, there exists a line between
2 of them that lies inside S.
" Thus 2-convex is the
same as convex.
" A5 pointed star is not
" A 5-pointed star is not
convex but is 3-
convex
4. n-Convex Sets
4. n Convex Sets
" Valentine and Eggleston showed that
Valentine and Eggleston showed that
every 3-convex shape is the union of
at most three convex shapes
at most three convex shapes.
" What is the smallest number k so that
every 4-convex shape is the union of k
convex sets?
" The answer is either 5 or 6.
4. n-Convex Sets
4. n Convex Sets
" Here is an
" Here is an
example of
a4-
a 4
convex
shape that
shape that
is the union
of no fewer
of no fewer
than five
convex
convex
sets.
5 S T hi S
5. Squares Touching Squares
" Easy to find the smallest collection
E t fi d th ll t ll ti
of squares each touching 3 other
squares:
" What is the smallest
collection of squares each
collection of squares each
touching 3 other squares at
exactly one point?
exactly one point?
" What is the smallest
number where each
touches 3 other squares
along part of an edge?
5 S T hi S
5. Squares Touching Squares
" What is the smallest
collection of squares so that
each square touches 4 other
squares?
" What is the
Wh t i th
smallest collection
so that each
th t h
square touches 4
other squares at
th t
exactly one point?
Packing
Packing
6. Packing Unit Squares
" Here are the smallest squares that we can
pack 1 to 10 non-overlapping unit squares
p pp g q
into.
6. Packing Unit Squares
" What is the
smallest square
we can pack 11
unit squares in?
" Is it this one,
Is it this one
with side 3.877?
7. Smallest Packing Density
" The packing density of a shape S is the
proportion of the plane that can be
covered by non-overlapping copies of S.
" A circle has packing
A i l h ki
density Ä„/"12 H" .906
" What convex shape has the
smallest packing density?
smallest packing density?
7. Smallest Packing Density
" An octagon that has its
corners smoothed by
hyperbolas has packing
density .902.
" Is this the
smallest
possible?
8 Heesch Numbers
8. Heesch Numbers
" The Heesch number of a shape is the
The Heesch number of a shape is the
largest finite number of times it can be
completely surrounded by copies of
completely surrounded by copies of
itself.
" For example, the
shape to the right
has Heesch number
1.
" What is the
largest Heesch
number?
8 Heesch Numbers
8. Heesch Numbers
" A hexagon
with two
external
notches
and 3
internal
notches
has
Heesch
number 4!
8 Heesch Numbers
8. Heesch Numbers
" The
" The
highest
known
known
Heesch
number
number
is 5.
" Is this the
largest?
largest?
Tiling
Tiling
9. Cutting Rectangles into
Congruent Non-Rectangular
Parts
Parts
" For which values of n is it possible to cut
p
a rectangle into n equal non-rectangular
parts?
p
" Using triangles, we can do this for all
even n.
9. Cutting Rectangles into
Congruent Non-Rectangular
Parts
Parts
" Solutions are known for odd ne"11.
" Here are solutions for n=11 and n=15.
" Are there solutions for n=3, 5, 7, and 9?
10. Cutting Squares Into
0 Cutt g Squa es to
Squares
" Can every
square of side
square of side
ne"22 be cut
into smaller
into smaller
integer-sided
squares so that
squares so that
no square is
used more than
used more than
twice?
10. Cutting Squares Into
0 Cutt g Squa es to
Squares
" Can every
square of side
square of side
ne"29 be cut
into
into
consecutive
squares so
squares so
that each size
is used either
is used either
once or twice?
10. Cutting Squares Into
0 Cutt g Squa es to
Squares
" If we tile a
square with
distinct
squares, are
there always
at least two
squares with
only four
neighbors?
11 Cutting Squares into
11. Cutting Squares into
Rectangles of Equal Area
" For each n, are there only finitely many
ways to cut a square into n rectangles of
ways to cut a square into n rectangles of
equal area?
12 Aperiodic Tiles
12. Aperiodic Tiles
" A set of tiles is called aperiodic if
A set of tiles is called aperiodic if
they tile the plane, but not in a
periodic way.
periodic way.
" Penrose found this set of 2 colored
aperiodic tiles, now called Penrose
Tiles.
Dart
Dart
Kite
12 Aperiodic Tiles
12. Aperiodic Tiles
" This is part of a tiling using Penrose
pg g
Tiles.
" Is there a single tile which is
aperiodic?
13. Reptiles of Order Two
" A reptile is a shape that can be tiled
with smaller copies of itself.
p
" The order of a reptile is the smallest
p
number of copies needed in such a
g.
tiling
" Right triangles are
order 2 reptiles.
13. Reptiles of Order Two
" The only other
known reptile of
known reptile of
order 2 was
discovered by
discovered by
Scherer.
" Here r = "È
" Are there any other
reptiles of order 2?
14. Tilings by Convex
gy
Pentagons
" There are 14 known classes of convex
There are 14 known classes of convex
pentagons that can be used to tile the
plane
plane.
14. Tilings by Convex
gy
Pentagons
" Are there
any
any
more?
15. Tilings with a Constant
5gs t a Co sta t
Number of Neighbors
" There are
tilings of the
tilings of the
plane using one
tile so that each
tile so that each
tile touches
exactly n other
exactly n other
tiles, for n=6, 7,
8 9 10 12 14
8, 9, 10, 12, 14,
16, and 21.
15. Tilings with a Constant
5gs t a Co sta t
Number of Neighbors
" There are tilings of the plane using two
tiles so that each tile touches exactly n
other tiles, for n=11, 13, and 15.
" Can be this be done for other values of
n?
Finite Sets
Finite Sets
16 Distances Between Points
16. Distances Between Points
" A set of points S is in general position if
A set of points S is in general position if
no 3 points of S lie on a line and no 4
points of S lie on a circle.
points of S lie on a circle.
" Easy to see n points in the plane
determine n(n-1)/2 = 1+2+3+& +(n-1)
( 1)/2 1 2 3 ( 1)
distances.
" Can we find n points in general position
so that one distance occurs once one
so that one distance occurs once, one
distance occurs twice,& and one distance
occurs n-1 times?
16 Distances Between Points
16. Distances Between Points
" This is easy to
do for small n.
" An example for
n=4 is shown.
" Solutions are only known for nd"8.
16 Distances Between Points
16. Distances Between Points
" A solution by
" A solution by
Pilásti for n=8 is
shown to the
shown to the
right.
" Are there any
Are there any
solutions for
ne"9?
ne"9?
" Erdös o e ed
dös offered
$500 for
arbitrarily large
17 Perpendicular Bisectors
17. Perpendicular Bisectors
" The 8 points below have the
The 8 points below have the
property that the perpendicular
bisector of the line between any 2
bisector of the line between any 2
points contains 2 other points of the
set
set.
" Are there any
other sets of
other sets of
points with this
property?
property?
18 Integer Distances
18. Integer Distances
" How many points can be in general
position so the distance between each
pair of points is an integer?
" A set with
4 points
is shown.
18 Integer Distances
18. Integer Distances
" Leech
found a
set of 6
points
with this
property.
" Are there
larger
sets?
19 Lattice Points
19. Lattice Points
" A lattice point is a point (x,y) in the
A lattice point is a point (x y) in the
plane, where x and y are integers.
" Every shape that has area at least Ä„/4
can be translated and rotated so that it
covers at least 2 lattice points.
" For n>2, what is the smallest area A so
that every shape with area at least A
can be moved to cover n lattice points?
19 Lattice Points
19. Lattice Points
" There is a convex shape
Th i h
with area 4/3 that covers
a lattice point, no matter
l tti i t tt
how it is placed.
" Is there a smaller shape with this
property?
property?
" What is the convex shape of the
What is the convex shape of the
smallest possible area that must cover
at least n lattice points?
Curves
Curves
20. Worm Problem
" What is the smallest convex set that
contains a copy of every continuous
py y
curve of length 1?
" Is it this
" Is it this
polygon
found by
found by
Gerriets and
Poole with
Poole with
area .286?
21 S mmetric Venn Diagrams
21. Symmetric Venn Diagrams
" A Venn diagram is a collection of n
curves that divides the plane into 2n
p
regions, no two of which are inside
exactly the same curves.
y
" A symmetric Venn diagram ()
yg (SVD) is a
collection of n congruent curves rotated
about some point that forms a Venn
diagram.
21 S mmetric Venn Diagrams
21. Symmetric Venn Diagrams
" SVDs can only exist for n prime.
" Here are SVDs for n=3 and n=5.
H SVD f 3 d 5
21 Symmetric Venn Diagrams
21. Symmetric Venn Diagrams
" Here is a
SVD for n=7.
" Examples are
Examples are
known for n=2,
3 5 7 and
3, 5, 7, and
11.
" Does an
example exist
f 13?
for n=13?
(Venn Diagram pictures by Frank Ruskey:
http://www.combinatorics.org/Surveys/ds5/VennSymmEJC.html)
22. Squares on Closed
q
Curves
" Does every closed curve contain the
vertices of a square?
" This is known for
bo ndaries of
boundaries of
convex shapes, and
piecewise
piecewise
differentiable curves
without cusps
without cusps.
23. Equichordal Points
" A point P is an equichordal point of a
shape S if every chord of S that passes
py p
through P has the same length.
" The center of a circle
Th t f i l
is an equichordal
point.
i t
" Can a convex shape have more than
one equichordal point?
one equichordal point?
24. Chromatic Number of the Plane
" What is the smallest number of
colors Ç with which we can color the
plane so that no two points of the
same color are distance 1 apart?
" The vertices of a
unit equilateral
triangle require 3
different colors, so
Çe"3.
24. Chromatic Number of the Plane
" The vertices of
the Moser
Spindle require
4 colors, so
,
Çe"4.
24. Chromatic Number of the Plane
" The plane
The plane
can be
colored with
colored with
7 colors to
avoid unit
avoid unit
pairs having
the same
the same
color, so Çd"7.
25. Conic Sections Through
g
Any Five Points of a Curve
" It is well known that given any 5 points in
the plane there is a unique (possibly
the plane, there is a unique (possibly
degenerate) conic section passing
through those points
through those points.
" Is there a closed curve (that is not an
(
ellipse) with the property that any 5 points
chosen from it determine an ellipse?
p
" How about |x|2.001 + |y|2.001 = 1 ?
General References
" V. Klee, Some Unsolved Problems in
Pl G t M th M 52 (1979)
Plane Geometry, Math Mag. 52 (1979)
131-145.
" H. Croft, K. Falconer, and R. Guy,
Unsolved Problems in Geometry, Springer
y, p g
Verlag, New York, 1991.
" Eric Weisstein s World of Mathematics
" Eric Weisstein s World of Mathematics,
http://mathworld.wolfram.com
" The Geometry Junkyard,
http://www.ics.uci.edu/~eppstein/junkyard
Wyszukiwarka
Podobne podstrony:
Family problems in child psychiatry13 5 3 Lab Troubleshooting Laptop Problems in Windows 7Solutions to Problems in Sakurai s Quantum Mechanics P Saltsidis, B Brinne12 5 3 Lab Troubleshooting Operating System Problems in Windows 7911 In Plane Site The truth of 9 11, 2004 (ENG)9 11 In Plane SiteLumiste Betweenness plane geometry and its relationship with convex linear and projective plane ge11 6 3 Lab Troubleshooting Hardware Problems in Windows 714 6 3 Lab Troubleshooting Printer Problems in Windows 7Scholz Weyl Geometry in Late 20th CenturyDoran New Advances in Geometric Algebra (2001) [sharethefiles com]problem of crime in modern societyTank Battle Problem No3 Tanks in Combat Against BunkersPambuccian A Methodologically Pure Proof of a Convex Geometry Problemwięcej podobnych podstron