All Questions
11 questions
6
votes
1
answer
435
views
On the aperiodic monotile
One of the more mind-boggling aspects of the Penrose tiles is that there are uncountably many distinct tilings of the plane, but every tiling contains every finite region that appears in another ...
- 561
15
votes
1
answer
838
views
Ratio of circumscribed/inscribed $(n{-}1)$-gons
As a discrete analog of the MO question,
"Löwner-John Ellipsoid: incribed and circumscribed,"
I've been wondering what might be the maximum ratio
of this quantity?
Let $P$ be a convex ...
- 2,821
5
votes
0
answers
235
views
Arrangement of points, lines, and planes
Is it possible to construct a finite nontrivial arrangement of points, lines, and planes in 3-dimensional Euclidean space with the following properties?
every line is incident with four points and ...
- 1,444
2
votes
2
answers
163
views
Maximum possible number of similar three-colored triangles
I want to maximize the number of similar triangles with vertices from three fixed sets, one vertex from each set. For example, if you fix two points $X$, $Y$ (i.e. two sets with only one member), then ...
- 2,821
1
vote
1
answer
129
views
Coloring lines in plane
We assume that all the lines in the plane are each colored with one of two colors: red or blue. Given angle $\alpha.$
My question 1. Is there possible to get two lines with the same color and angle ...
CommunityBot
- 1
6
votes
1
answer
767
views
Using mirrors to make a non-convex polygon visible from a fixed interior point
Take a point $A$ inside a non-convex polygon $P$. Is it always possible to place a finite set of mirrors given by straight segments (not necessarily along the boundary of $P$, any position inside $P$ ...
- 4,713
11
votes
1
answer
712
views
Polygons uniquely inducing arrangements
A beautiful, relatively recent result is that,
Every simple arrangement $\cal{A}$ of $n$ lines in the plane is induced by a simple $n$-gon $P$.
In a simple arrangement, every pair of lines intersect ...
CommunityBot
- 1
10
votes
0
answers
1k
views
Interpolating points with minimum curvature constraint
I have $n$ points $p_i$ strictly interior to a rectangle $R$,
and I would like to connect them with a curve $C$ whose curvature is as low as possible.
Let $\kappa_\max(C)$ be the sharpest (largest ...
- 151k
8
votes
4
answers
530
views
Inside-out polygonal dissections
A dissection of a polygon $P$
is a partition of $P$ into a finite number of pieces, which can then be rearranged
(via planar translations and rotations) and joined (without overlap) to form a new ...
- 151k
8
votes
2
answers
371
views
Are angles between points enough to decide the realizability?
Let n points in the plane be given whose coordinates we don't know.
Assume, however, that for any triple of the points we know the angle.
Question: Can we decide whether the n points are realizable ...
- 6,101
24
votes
3
answers
1k
views
Tetrahedron insphere iteration
I know that iterating the following incircle construction approaches an equilateral triangle in the limit:
Starting with any triangle $T$, one forms $T'$ by connecting ...
- 24.7k