All Questions
2,368 questions
18
votes
2
answers
667
views
Total length of a set with the same projections as a square
Take some convex polygon $P$. I'm mostly asking about the unit square, but would also appreciate thoughts on general polygons. We want to take a family of line segments inside $P$ that have the same ...
18
votes
1
answer
748
views
Banach-Mazur distance between the cube and the octahedron
The Banach-Mazur distance $d(X, Y)$ between two normed spaces $X, Y$ of the same dimension is defined as $d(X, Y) = \log\inf \|T\| \cdot \|T^{-1}\|$, where the $T:X \to Y$ is a linear and invertible ...
18
votes
3
answers
2k
views
Are the Platonic solids shadows of 4-polytopes?
Say that a 3D shadow of a 4-polytope is a parallel projection to 3-space, not necessarily orthogonal to that 3-space (that would make it an orthogonal projection).
I am wondering if each of the five ...
18
votes
2
answers
573
views
Can the graph of a symmetric polytope have more symmetries than the polytope itself?
I consider convex polytopes $P\subseteq\Bbb R^d$ (convex hull of finitely many points) which are arc-transitive, i.e. where the automorphism group acts transitively on the 1-flags (incident vertex-...
18
votes
1
answer
1k
views
Are there analogues of Desargues and Pappus for block designs?
Finite projective planes are fascinating objects from many perspectives. In addition to the geometric view, they can be viewed as combinatorial block designs.
From the geometric perspective, there ...
18
votes
2
answers
2k
views
♢ ⧫ ⬠: the fourth kind of Penrose tiling?
It’s known that Penrose tilings have several implementations that are mutually locally derivable; but the sources (such as en.wikipedia) list no more than three essentially different variants. There ...
18
votes
2
answers
979
views
Arrangements of points in the plane
Let $p_1,\ldots,p_n$ be a collection of distinct points in $\mathbb{R}^2$, no three of which lie on a line. For each $p_i$, let $\omega_i(p_1,\ldots,p_n)$ be the following ordered list (well-defined ...
18
votes
1
answer
1k
views
Sperner's Lemma implies Tucker's Lemma - simple combinatorial proof
Sperner’s Lemma is often called the "combinatorial analog" of Brouwer’s Fixed Point Theorem, and similarly Tucker’s Lemma is often called the combinatorial analog of Borsuk–Ulam’s Theorem.
We can ...
17
votes
3
answers
2k
views
Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?
What is the best upper bound known on the (absolute value of) the
Euler characteristic of a simplicial complex
in terms of the number of its facets ?
In particular, I am interested in proving or ...
17
votes
4
answers
823
views
Sweep-segment bot: Will this random walk sweep the plane?
This model is inspired by the random behavior of the
Roomba sweeping robot.
Let a unit segment $ab$ in the plane be placed
initially with $a=(0,0)$ and $b=(1,0)$.
The segment is first rotated a ...
17
votes
4
answers
1k
views
Can I build infinitely many polytopes from only finitely many prescribed facets?
Given a finite set of convex $d$-dimensional polytopes $\mathcal P$, for some $d\ge 2$.
Question: Is it true that there are only finitely many different convex $(d+1)$-dimensional polytopes whose ...
17
votes
3
answers
2k
views
When is the number of areas obtained by cutting a circle with $n$ chords a power of $2$?
Also posted on the Math Stackexchange: When is the number of areas obtained by cutting a circle with $n$ chords a power of $2$?
Introduction
Recently, a friend told me about the following ...
17
votes
3
answers
6k
views
The cone of positive semidefinite matrices is self-dual? (reference needed)
I'm seeking a reference for the following fact.
The cone of positive semidefinite matrices is self-dual (a.k.a. self-polar).
This result is relatively easy to prove, has been known for a long time,...
17
votes
5
answers
883
views
Rigidity of convex polyhedrons in $\mathbb R^3$ with faces removed
Take a convex polyhedron $P$ in $\mathbb R^3$ and remove all the faces, i.e. leave only the edges. Call this graph $E$. Let us now try to continuously deform $E$ in $\mathbb R^3$ so that all the edges ...
17
votes
3
answers
2k
views
The minimum of a sum of absolute values of inner products in $\mathbb{R}^d$
Consider a collection of unit vectors $v_1, \ldots, v_n$ in $\mathbb{R}^d$ (we think of $n$ being much larger than $d$). I would like to minimize the sum:
$$\sum_{i\neq j}|\langle v_i,v_j\rangle|.$$
...
17
votes
4
answers
772
views
Partitions of $\mathbb{R}^d$ by implicit polynomial equations
Given a polynomial
$p(x_1,x_2,\ldots,x_d)$
in $d$ variables, with maximum degree $k$,
what is the maximum number of
components of $\mathbb{R}^d$ minus $p(\ldots)=0$?
In other words, into how many ...
17
votes
2
answers
975
views
Which right square pyramids are scissors congruent to a cube?
Consider a right square pyramid whose base has side length $2r$ and whose height is $h$. Let the dihedral angle between the base and each triangular side be $\theta$, and the dihedral angle between ...
17
votes
2
answers
2k
views
Random walk is to diffusion as self-avoiding random walk is to ...?
One can view a random walk as a discrete process whose continuous
analog is diffusion.
For example, discretizing the heat diffusion equation
(in both time and space) leads to random walks.
Is there a ...
17
votes
3
answers
2k
views
Applications of Kirchhoff's circuit laws to graph theory
Is there a good survey on applications of Kirchhoff's circuit laws to graph theory or/and discrete geometry?
Examples:
Matrix tree theorem,
Squaring the square,
Electrician’s proof of Euler’s ...
17
votes
1
answer
622
views
Longest of random worm-like paths in $\mathbb{Z}^2$
Imagine at each lattice point of $\mathbb{Z}^2$ within $[1,3n]^2$,
with coordinates
$\equiv 2 \bmod 3$,
we place, with equal probability, one of these six patterns:
The result ...
17
votes
1
answer
929
views
Holes in double-tileable polynominoes
This question was communicated to me by Evgeniy Romanov.
Consider a connected polyomino $P$ that can be completely tiled in two different ways: with disjoint $2 \times 2$ square tetraminoes, and with ...
17
votes
1
answer
457
views
The sparsest planar net that captures every unit segment
Let $\cal C = \lbrace C_i \rbrace$ be a collection
of rectifiable curves in the plane with the property that
every unit-length segment meets at least one curve
in at least one point.
Call such a ...
17
votes
1
answer
580
views
Aperiodic monotile in $\mathbb{R}$
Motivation. Recently a group of researchers found an aperiodic monotile in $\mathbb{R}^2$, answering a long-standing question. There are many results in higher dimensions, so let's explore the lower ...
17
votes
1
answer
1k
views
The optimal constant in Vitali covering lemma
Let me restate Vitali covering lemma.
Let $\{B_i\}_{i\in F}$ be a finite collection of balls in the $\mathbb{R}^n$. Then there is $S\subset F$ such that the balls $\{B_i\}_{i\in S}$ are disjoint and
...
17
votes
1
answer
390
views
17
votes
0
answers
488
views
Large almost equilateral sets in finite-dimensional Banach spaces
Question: Does there exist a function $C:~(0,1)\to
(0,\infty)$ such that for each $\varepsilon\in(0,1)$ every Banach space
$X$ of dimension $\ge C(\varepsilon)\log n$ contains an $n$-point
set $\{x_i\...
17
votes
0
answers
731
views
Does every connected set that is not a line segment cross some dyadic square?
A dyadic square is a subset of $R^2$ of the form $x + 2^{-n} [0,1]^2$ with $x \in 2^{-m} Z^2$, for integers $m,n \geq 0$. We say that a set $A$ crosses a square $S$ if there exists a connected subset ...
16
votes
3
answers
1k
views
Can a convex polytope with $f$ facets have more than $f$ facets when projected into $\mathbb{R}^2$?
Let $P$ be a convex polytope in $\mathbb{R}^d$ with $n$ vertices and $f$ facets.
Let $\text{Proj}(P)$ denote the projection of $P$ into $\mathbb{R}^2$.
Can $\text{Proj}(P)$ have more than $f$ facets?
...
16
votes
3
answers
2k
views
Are infinite planar graphs still 4-colorable?
Imagine you have a finite number of "sites" $S$ in the positive quadrant
of the integer lattice $\mathbb{Z}^2$,
and from each site $s \in S$, one connects $s$ to every lattice point to which it
has a ...
16
votes
3
answers
2k
views
Fano plane drawings: embedding PG(2,2) into the real plane
By a drawing of the Fano plane I mean a system of seven simple curves and
seven points in the real plane such that
every point lies on exactly three curves, and every curve contains
exactly three ...
16
votes
4
answers
3k
views
covering by spherical caps
Consider the unit sphere $\mathbb{S}^d.$ Pick now some $\alpha$ (I am thinking of $\alpha \ll 1,$ but I don't know how germane this is). The question is: how many spherical caps of angular radius $\...
16
votes
6
answers
2k
views
Optimal pebble-packing shape
Suppose you throw many ($n$) congruent convex bodies (in $\mathbb{R}^3$) of unit volume (or of unit area in $\mathbb{R}^2$) into a large container, and shake it until little else changes.
Q. ...
16
votes
5
answers
717
views
Minimal blocking objects with shadows like a cube
This is a more geometric version of the previous question,
"Lattice-cube minimal blocking sets". I will first specialize to $\mathbb{R}^3$, $d=3$.
View an $n \times n \times n$ cube $C_3(n)$ as ...
16
votes
4
answers
2k
views
Point sets in Euclidean space with a small number of distinct distances
It is well known and not hard to prove that the regular simplex in n-dimensions is the only way to place n+1 points so that the distance between distinct pairs of points is always the same. My general ...
16
votes
2
answers
1k
views
Integer lattice points on a hypersphere
Is the following statement true?
For every integer $n\ge2$ and every integer $k\ge0$ there exists a hypersphere in $\mathbb{R}^n$ (circle, sphere etc) containing exactly $k$ integer lattice points ...
16
votes
2
answers
1k
views
Randomly walking a leashed dog
Let a human $h(t)$ random walk on $\mathbb{Z}^2$ by taking a unit-length step at every
time step $t$. A dog $d(t)$ on a leash of length $\lambda$ follows $h(t)$, also
taking a unit-length step at ...
16
votes
1
answer
888
views
Kakeya crossed-needles problem
The Kakeya needle problem asks for the
minimum area planar region in which one can completely turn around a line segment through
a series of translations and rotations. There is no minimum: There are &...
16
votes
5
answers
712
views
The smallest disk containing all sides of an $n$-gon
Start with a regular $n$-gon of side 1 and consider its sides as open segments that can be moved around in the plane, allowing only translations. Two segments may not intersect.
What is the radius ...
16
votes
4
answers
1k
views
Squaring a square and discrete Ricci flow
Is this a theorem?
Every $3$-connected planar graph $G$ may be represented as
a tiling of a square by squares,
one square per node of $G$, with nodes connected in $G$
corresponding to tangent squares....
16
votes
2
answers
5k
views
Weighted area of a Voronoi cell
Let $X = \{ x_1,\dots,x_n\} $ denote a set of $n$ points in the unit square $S = [0,1]\times[0,1]$, and let $w = \{w_1,\dots,w_n\}$ denote a set of weights corresponding to the $n$ points in $X$. ...
16
votes
3
answers
2k
views
A random walk on random lines
I am wondering if this random walk remains finite with positive probability.
Start with three lines $A,B,C$ that are extensions of an equilateral triangle.
Let $p_0$ be one corner. Generate a line $...
16
votes
2
answers
466
views
Does a certain points and lines configuration exist?
For which $n$ we may mark $n$ red and $n$ blue points on the Euclidean plane, not all on a line, so that any line which passes through two points of different colour contains another point?
For $n=...
16
votes
2
answers
1k
views
Are Penrose tilings universal? Do aperiodic universal tilings exist?
Consider a tiling of the plane using tiles of at least two types (e.g, a Penrose tiling such as that shown at the bottom of this question, which tiles the plane with two types of tiles). List the tile ...
16
votes
2
answers
951
views
Tiling the square with rectangles of small diagonals
For a given integer $k\ge3$, tile the unit square with $k$ rectangles so that the longest of the rectangles' diagonals be as short as possible. Call such a tiling optimal. The solutions are obvious in ...
16
votes
1
answer
1k
views
Random polycube shapes
I am wondering if it is hopeless to obtain any firm results
on the following model of a "random polycube shape."
First, a polycube in $\mathbb{R}^3$
is a connected face-to-face gluing of unit cubes.
(...
16
votes
1
answer
774
views
Minimizing the excursion of a sum of unit vectors
I have $n$ unit-length vectors $v_i$ in $\mathbb{R}^3$, whose
sum is zero:
$$ v_1 + v_2 + \cdots + v_n = 0 \; .$$
Now I form the closed polygon $P$ in space by placing them head to tail.
So the ...
16
votes
1
answer
350
views
Relatively primes spirals
When exploring the structure of points of the integer lattice
whose two coordinates are relatively prime
(call these r-prime points),1
I looked at spirals analogous to "Gaussian prime spirals."2
Start ...
16
votes
2
answers
503
views
Number of height-limited rational points on a circle
Consider origin-centered circles $C(r)$ of radius $r \le 1$.
I am seeking to learn how many rational points might lie on $C(r)$,
where each rational point coordinate has height $\le h$.
For example, ...
16
votes
1
answer
537
views
Balls in Hilbert space
I recently noticed an interesting fact which leads to a perhaps difficult question. If $n$ is a natural number, let $k_n$ be the smallest number $k$ such that an open ball of radius $k$ in a real ...
16
votes
1
answer
755
views
Are there general principles that allow us to easily determine whether coins in simple arrangements in a frame can move?
Circular coins in a frame may all be stuck in their positions; for example:
Another possibility is that they can all move simultaneously; I claim the following examples:
It is not always obvious ...