All Questions
143 questions
25
votes
1
answer
2k
views
The abc-conjecture as an inequality for inner-products?
The abc-conjecture is:
For every $\epsilon > 0$ there exists $K_{\epsilon}$ such that for all natural numbers $a \neq b$ we have:
$$ \frac{a+b}{\gcd(a,b)}\,\ <\,\ K_{\epsilon}\cdot \text{rad}\...
91
votes
13
answers
146k
views
If you break a stick at two points chosen uniformly, the probability the three resulting sticks form a triangle is 1/4. Is there a nice proof of this?
There is a standard problem in elementary probability that goes as follows. Consider a stick of length 1. Pick two points uniformly at random on the stick, and break the stick at those points. What ...
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 ...
13
votes
3
answers
1k
views
Efficient visibility blockers in Pólya's orchard problem
Pólya's orchard problem asks for which radius $\rho$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the exterior of the orchard.
It has been ...
60
votes
1
answer
7k
views
Probability that a stick randomly broken in five places can form a tetrahedron
Edit (June 2015): Addressing this problem is a brief project report from the Illinois Geometry Lab (University of Illinois at Urbana-Champaign), dated May 2015, that appears here along with a foot-...
58
votes
14
answers
19k
views
Open problems in Euclidean geometry?
What are some (research level) open problems in Euclidean geometry ?
(Edit: I ask just out of curiosity, to understand how -and if- nowadays this is not a "dead" field yet)
I should clarify a bit ...
38
votes
1
answer
2k
views
Sofa in a snaky 3D corridor
What is the largest volume object that can pass though a
$1 \times 1 \times L$ "snaky" corridor, where $L$ is large
enough to be irrelvant, say $L > 6$.
...
14
votes
1
answer
2k
views
Dao's theorem on six circumcenters associated with a cyclic hexagon
This questions from Ngo Quang Duong's paper
In 2013, O. T. Dao published without proof a theorem with title Another seven circles theorem in Cut the Knot, a free site for popular expositionsof many ...
10
votes
1
answer
1k
views
Characterizations of Euclidean space
I posted this question at math.stackexchange.com but didn't get an answer. Is it a dumb question, eventually?
There are three ways of characterizing the abstract Euclidean space $E^n$ that are quite ...
88
votes
2
answers
7k
views
60
votes
2
answers
4k
views
Does this geometry theorem have a name?
Start with a circle and draw two tangent circles inside. The (black) inner tangent lines to the smaller circles intersect the large circle. The (red) lines through these intersection points are ...
54
votes
5
answers
2k
views
Unusual symmetries of the Cayley-Menger determinant for the volume of tetrahedra
Suppose you have a tetrahedron $T$ in Euclidean space with edge lengths $\ell_{01}$, $\ell_{02}$, $\ell_{03}$, $\ell_{12}$, $\ell_{13}$, and $\ell_{23}$. Now consider the tetrahedron $T'$ with edge ...
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
1
answer
3k
views
3-piece dissection of square to equilateral triangle?
At a workshop it was suggested that it likely remains an open problem
whether or not there is a 3- or 2 -piece
dissection
of a square to an equilateral triangle.
Can anyone confirm that this is ...
13
votes
1
answer
921
views
Limiting shape for Brillouin zones
Is it true that the limiting shape for Brillouin zones (for any lattice) is a circle?
You can find the definition and the step by step construction of Brillouin zones here. This picture is taken from ...
13
votes
1
answer
615
views
Find structure geometry of $A_1, A_2,...,A_n$ such that $\prod_{i<j} A_iA_j$ is maximum
In any triangle we have the well-known inequality:
$$\sin{A}\sin{B}\sin{C} \le \frac{3\sqrt{3}}{8} (1)$$
Signification of inequality (1): Let three points $A, B, C$ lie on a circle then $AB.BC.CA$ ...
12
votes
1
answer
5k
views
Closest 3D rotation matrix in the Frobenius norm sense
Given a 3 by 3 matrix $M$ I would like to find the rotation matrix $R$ minimizing the Frobenius norm:
\begin{equation}
\|R-M\|_F
\end{equation}
Is there a closed form solution for $R$, or is it ...
11
votes
3
answers
6k
views
Random Sampling a linearly constrained region in n-dimensions...
Hi,
So here is my problem:
Given a nonlinear, discontinous, cost function $f(x_1,x_2,..,x_N)$ along with linear constraints $x_n \ge 0, \forall n$
$x_n \le c_n$
and $\sum_{n=1}^N x_n = 1$ find an ...
10
votes
3
answers
2k
views
On maximal regular polyhedra inscribed in a regular polyhedron
Let T, C, O, D, or I be regular tetrahedron, cube, octahedron, dodecahedron, and icosahedron, respectively. Suppose that the outer polyhedron have edge-length 1.
For example, it's easy to prove that ...
9
votes
2
answers
594
views
Strengthened version of Isoperimetric inequality with n-polygon
Let $ABCD$ be a convex quadrilateral with the lengths $a, b, c, d$ and the area $S$. The main result in our paper equivalent to:
\begin{equation} a^2+b^2+c^2+d^2 \ge 4S + \frac{\sqrt{3}-1}{\sqrt{3}}\...
8
votes
3
answers
3k
views
Reconstructing an Euclidean point cloud from their pairwise distances
I have a collection of points $P_1, ..., P_N$ in some Euclidean space $\mathbb R^m$ and the coordinates $x_1, x_2, ..., x_N$ respectively associated with them, where $x_i$ is the usual Cartesian tuple ...
6
votes
6
answers
3k
views
Circumference of Convex Shapes
Here is a puzzle I found in Mitteilungen der DMV (roughly, "Letters of the German Society of Mathematicians"), issue 19/2011. It was posed by Alfred Schreiber in "Wie man Hasen fangt" (How to catch ...
3
votes
1
answer
327
views
LP Constraints for Connected Subgraphs of Fixed Size
Question:
how can the connectedness-constraint for a subgraph, that is induced by a proper subset $W\subset V$ of the vertices of $G(V,E),\ |V|=n,\ |W|=m$, be formulated in a $LP$ or $ILP$?
...
2
votes
1
answer
423
views
Tools for Removing Radicals from Equations
I am currently doing some investigations on Sylvester's 4 Point Problem Probability of 4 Points being in Convex Configuration
and repeatedly face the problem of solving equations between sums of ...
96
votes
4
answers
5k
views
A curious relation between angles and lengths of edges of a tetrahedron
Consider a Euclidean tetrahedron with lengths of edges
$$
l_{12}, l_{13}, l_{14}, l_{23}, l_{24}, l_{34}
$$
and dihedral angles
$$
\alpha_{12}, \alpha_{13}, \alpha_{14},
\alpha_{23}, \alpha_{24}, \...
35
votes
6
answers
2k
views
Trigonometry / Euclidean Geometry for natural numbers?
Let $d(a,b) = 1 - \frac{2\gcd(a,b)^3}{ab(a+b)}$ be a metric on natural numbers without $0$.
The metric space $X = \{x_0,x_1,\cdots,x_n\},n>2$ is isometric embeddable in $\mathbb{R}^n$ if and only ...
27
votes
5
answers
2k
views
Is the matrix $\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}$ nonsingular?
Suppose we have a $(2m-1) \times (2m-1)$ matrix defined as follows:
$$\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}.$$
For example, if $m=3$, the matrix is
$$\begin{pmatrix}6 & 20 & 6& 0 ...
27
votes
1
answer
2k
views
The Eyeball Theorem generalized
I have not seen the 2D Eyeball Theorem—that tangents from the centers of two circles, each encompassing the other, intersect each circle in the same segment length—generalized to higher ...
25
votes
3
answers
2k
views
Angle of a regular simplex
I find the following question embarrassing, but I have not been able to either resolve it, or to find a reference.
What is the vertex angle of a regular $n$-simplex?
Background: For a vertex $v$ ...
20
votes
2
answers
2k
views
The geometric median of a triangle
Let $\Omega\subset \mathbb R^n$ be a compact domain of dimension $n$. Define the geometric median on $\Omega$ as the point $m_{\Omega}\in \mathbb R^n$ such that the integral $\int_{\Omega}|x-m_{\Omega}...
19
votes
2
answers
2k
views
Is the tensor product of polyhedra a polyhedron?
Conventions: A polytope in a finite-dimensional $\mathbb R$-vector space $V$ is defined to be a convex hull of finitely many points in $V$. A polyhedron in a finite-dimensional $\mathbb R$-vector ...
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|.$$
...
15
votes
1
answer
11k
views
Maximum number of mutually equidistant points in an n-dimensional Euclidean space is (n+1). Proof? [closed]
How to prove that the maximum number of mutually equidistant points in an n-dimensional Euclidean space is (n+1)?
11
votes
1
answer
919
views
Generalized Hlawka inequality
Let $E$ be a vector space over the real (the complex case is interesting too). We consider functions $f:E\rightarrow\mathbb R$ which satisfy the homogeneity property
$$f(\lambda x)=|\lambda|\,f(x).$$
...
11
votes
1
answer
524
views
Elementary proof of a triangular grid lemma
I am looking for an elementary proof of the following lemma, which concerns what Green and Tao call "triangular grids" (see arXiv:1208.4714).
Let $a_1$, $a_2$, $a_3$, $a_4$, $b_1$, $b_2$ be six ...
10
votes
1
answer
551
views
Formula for "cointersection" of three circles?
I am working on the problem of finding "rational" dodecahedrons, and I have run across an interesting subproblem: How do you tell if three circles have a common intersection point?
...
10
votes
1
answer
582
views
Can Tarski decide constructibility in elementary geometry?
Can the decision routine for Tarski's Elementary geometry be extended to decide when an existence claim in that theory can be instantiated by a compass and straightedge construction?
The answer does ...
7
votes
1
answer
5k
views
Shrink polygon to a specific area by offsetting
I have a 2D polygon that I want to shrink by a specific offset (A) to match a certain area ratio (R) of the original polygon. Is there a formula or algorithm for such a problem? I am interested in a ...
7
votes
0
answers
410
views
Can generalization of a generalization Pascal theorem, Pappus theorem to Higher Dimensions? [closed]
Please see a chain of six circles associated with a conic. This is a generalization of Pascal theorem, Pappus theorem. I reformulate as following:
Let $1, 2, 3, 4, 5, 6$ be six arbitrary points in a ...
7
votes
3
answers
221
views
What is special in dimension $2$ (When characterizing isometries using the cofactor matrix)?
Let $A$ be a real $n \times n$ matrix. Denote by $\operatorname{cof} A$ The cofactor matrix of $A$. By definition, $A (\operatorname{cof} A)^T=\det A \cdot I$.
Thus, it is immediate that $A \in \...
6
votes
1
answer
880
views
Relation of some Euclidean geometry theorems and more conjecture generalizations
In this topic I want to share relation of the Pythagorean theorem, the Stewart theorem and the British Flag theorem, the Apollonius' theorem, the Ptolemy's theorem and the Feuerbach-Luchterhand. Since ...
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$ ...
6
votes
0
answers
121
views
How many equilaterals have vertices intersections of angle trisectors of a triangle?
The celebrated Morley’s theorem ensures that the interior trisectors, proximal to sides respectively, meet at vertices of an equilateral.
In the paper Trisectors like Bisectors with Equilaterals ...
5
votes
3
answers
1k
views
Algorithm for the intersection of a vector subspace with a cone of non-negative vectors
Hi,
I would like to know whether there is some more effective way of how to compute an intersection of a vector subspace of $\mathbb{R}^{n}$ with a cone of vectors with non-negative entries than the ...
5
votes
0
answers
342
views
$N$-$th$ closed chain of six circles
Since 2013, I found a very nice configuration: $N$-th closed chain of six circles. This is a generalization of theorem 1, problem 2 in here and theorem 2 in here and here (and is also generalization ...
4
votes
1
answer
387
views
Reference request: Oldest (non-analytic) geometry books with (unsolved) exercises?
Per the title, what are some of the oldest (non-analytic) geometry books out there with (unsolved) exercises? Maybe there are some hidden gems from before the 20th century out there.
4
votes
1
answer
8k
views
Detection of Redundant Constraints
Suppose I pose the following query to a constraint logic programming
system:
?- Y <= 6 - X, Y <= (- 4) + 4 * X, Y <= 4 + X / 3.
Are there systems that would recognize the last inequality as
...
4
votes
1
answer
3k
views
optimization of inverse matrix with constraint on matrix elements
everyone! I have this optimization problem with constraint.
$D$ and $T$ are symmetric matrices, where T is known and D is the unknown parameter.
$x$ and $v$ are two known p-dimensional vectors.
The ...
2
votes
0
answers
105
views
Optimization over a convex cone generated by a set is equal to optimization over the set
Within my research I found an important doubt and that prevents me from advancing, the context of my doubt is as follows:
We considerer the following optimization problem
$$
\left\{\begin{array}{cl} \...
90
votes
5
answers
4k
views
Does this property characterize straight lines in the plane?
Take a plane curve $\gamma$ and a disk of fixed radius whose center moves along $\gamma$. Suppose that $\gamma$ always cuts the disk in two simply connected regions of equal area. Is it true that $\...