All Questions
1,020 questions
2
votes
1
answer
136
views
Does this result above six points follow have a name?
Does this result above six points follow have a name?
Let $A$, $B$, $C$, $D$, $E$, $F$ be six points in the plane and $AB, CF, ED$ are concurrent and $BC, DA, FE$ are concurrent then $CD, EB, AF$ ...
- 1,776
1
vote
0
answers
28
views
Integral hull of a polyhedron Q is polyhedron
Let $Q \subseteq R^n$ be a rational polyhedron and let $Q_I=Convexhull(Q \cap Z^n)$. By finite basis theorem, we have $Q=P+C$ for some rational polytope $P$ and finitely generated cone $C$ where $C=R_+...
- 21
-1
votes
0
answers
41
views
Is it possible to backtrack an optimization solver? [closed]
I have an optimization problem and was using a linear programming optimizer to find solutions. However, I find that past a certain size, the problem becomes "infeasible" and has no solutions....
2
votes
0
answers
67
views
Pólya's orchard problem among Gaussian primes
Quoting myself from an earlier post:
Pólya's orchard problem asks for which radius $r$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the exterior of ...
- 151k
0
votes
0
answers
21
views
Easy instance of set cover
I am trying to prove that a natural greedy algorithm solves the following instance of the set cover problem: for a set of elements $e\in U$ with a set of weights $w_e$, we define the cost of a subset ...
- 4,049
0
votes
0
answers
14
views
Sum of Simplex Volumes with Corners from Points in Convex Configuration
Question:
given $k,\,k>n$ points in convex configuration and general position in $n$ dimensional Euclidean space, i.e. no $n+1$ points of which are co-hyperplanar,
what can be said about how the ...
- 13.2k
2
votes
1
answer
213
views
How can one test whether a given analytic curve in the plane is algebraic or not?
Suppose $\Gamma$ is an analytic Jordan curve in the complex plane $\mathbb{C}$. What are ways to test whether $\Gamma$ is (contained in) an algebraic curve, i.e., whether there exists a real ...
- 2,154
7
votes
2
answers
242
views
Prove that $ n \leq d+1 $ under ordering constraints in $\mathbb{R}^d$
Let $x_1, \dotsc, x_n \in \mathbb{R}^d$ and $\theta_1, \dotsc, \theta_n \in \mathbb{R}^d$ be vectors such that for every $k \in [n]$, the following inequality holds:
$$
\langle x_k, \theta_k \rangle &...
2
votes
0
answers
37
views
Theta series of well-rounded lattices
I've started looking into well-rounded Euclidean lattices and I was interested in learning whether their theta series have any interesting properties, but haven't found much in terms of bibliography ...
- 223
2
votes
4
answers
212
views
Efficient algorithm for graph problem
Let $D=(V,E)$ be a directed graph, $S,T\subset V$ and $f:V\rightarrow \{1,\ldots, k\}$ a positive, bounded weight-function and $l\in \mathbb{N}$, find a path $v_1,\ldots, v_l\in V$ with $v_1\in S$ and ...
- 157
10
votes
5
answers
738
views
Dissection proof of Heron's formula?
In his recent book, Love Triangle, Matt Parker playfully complains that Heron's formula is an "opaque formula, and I feel like you just chuck in the side-lengths, turn a series of arbitrary ...
- 82.6k
1
vote
1
answer
106
views
Iterated optimal transport
Suppose we are interested in two consecutive transport plans (in the Kantorovich formulation). That is, we are given finite sets $X$, $Y$ and $Z$, endowed with probability measures $\mu_X$, $\mu_Y$ ...
- 13
30
votes
2
answers
2k
views
Is every connected subgroup of a Euclidean space closed?
The question listed above (in the context of the complex numbers, but it is a reasonable question to ask in any dimension) was asked by a student in my complex analysis class, and I did not have an ...
- 114k
0
votes
0
answers
106
views
Upper bounds for minimum angle
What are the latest and best results on the asymptotic upper bound for the minimum angle between any pair of rays among $n$ rays in $\mathbb{R}^3$?
Any helpful answer would be appreciated. Thank you!
- 61
2
votes
2
answers
242
views
A necessary and sufficient condition for three diagonals of a hexagon to be concurrent
When talking about the condition for the three diagonals of a hexagon to be concurrent, we will think of Brianchon's theorem. Using software, I discovered a necessary and sufficient trigonometric ...
- 1,776
5
votes
1
answer
1k
views
Is this a new result about hexagon?
Let a hexagon $AB'CA'BC'$ let $AB' \cap A'B=C''$, $BC' \cap B'C = A''$, $CA' \cap C'A = B''$ then three conditions as follows equivalent:
Three lines $AA', BB', CC'$ are concurrent (let the point of ...
- 1,776
2
votes
0
answers
113
views
Another Butterfly theorem — Conway like circle
Have You seen these result as follows before?
In Figure 1: $AA'=BB'=tAB$; $CC'=DD'=tCD$, where t is real number then $ABCD$ is a cyclic quadrilateral iff $A'B'C'D'$ is a cyclic quadrilateral.
In the ...
- 1,776
3
votes
0
answers
110
views
How many Tverberg partition are in cloud of points? [closed]
Tverberg's Theorem: A collection of $(d+1)(r-1) +1$ points in $\mathbb{R}^d$ can always be partitioned into $r$ parts whose convex hulls intersect.
For example, $d=2$, $r=3$, 7 points:
Let $p_1, p_2,...
- 214
0
votes
0
answers
48
views
A question on a quantitative form of Farkas' lemma
Suppose A is an $m \times n$ matrix whose entries are non-negative integers and $\mathbf{b}$ is a vector with rational entries. A version of Farkas lemma implies that if the equation $$A\mathbf{x}=\...
- 6,214
3
votes
1
answer
144
views
Incenter-of-mass of a polygon
"Circumcenter of mass"
is a natural generalization of circumcenter to non-cyclic polygons.
CCM(P) can be defined as the weighted average of the circumcenters
of the triangles in any ...
- 221
2
votes
0
answers
318
views
What's the number of facets of a $d$-dimensional cyclic polytope?
A face of a convex polytope $P$ is defined as
$P$ itself, or
a subset of $P$ of the form $P\cap h$, where $h$ is a hyperplane such that $P$ is fully contained in one of the closed half-spaces ...
- 43
9
votes
1
answer
519
views
If we know the combinatorics of a polyhedron, and all but one of its dihedral angles, does that uniquely determine the remaining dihedral angle?
If we know the combinatorics of a polyhedron, and all but one of its dihedral angles, does that uniquely determine the remaining dihedral angle?
I’m happy to assume the polyhedron is simply connected, ...
- 2,896
3
votes
1
answer
145
views
Triangle centers formed a rectangle associated with a convex cyclic quadrilateral
Similarly Japanese theorem for cyclic quadrilaterals, Napoleon theorem, Thébault's theorem, I found a result as follows and I am looking for a proof that:
Let $ABCD$ be a convex cyclic quadrilateral.
...
- 1,776
1
vote
0
answers
99
views
Minimum of the maximum element frequency given the family size and the universe size
[Crossposted at math.stackexchange].
Consider families of sets $\mathcal{F}$ with size $n = |\mathcal{F}|$ and universe $U(\mathcal{F})$ with size $q = |U(\mathcal{F})|$.
I have written and solved ...
- 988
9
votes
1
answer
553
views
Does the sequence formed by Intersecting angle bisector in a pentagon converge?
I asked this question on MSE here.
Given a non-regular pentagon $A_1B_1C_1D_1E_1$ with no two adjacent angle having a sum of 360 degrees, from the pentagon $A_nB_nC_nD_nE_n$ construct the pentagon $...
- 541
9
votes
0
answers
311
views
What axiomatic system does AlphaGeometry use?
In January 2024, researchers from DeepMind announced AlphaGeometry, a software able to solve geometry problems from the International Mathematical Olympiad using a combination of AI techniques and a ...
- 241
5
votes
1
answer
383
views
Shortest polygonal chain with $6$ edges visiting all the vertices of a cube
I am trying to find which is the minimum total Euclidean length of all the edges of a minimum-link polygonal chain joining the $8$ vertices of a given cube, located in the Euclidean space. In detail, ...
- 1,451
0
votes
0
answers
115
views
Software for computing polytopes
As can be inferred from the title, I want to do some computation on the facets representation of the polytopes given the vertices. My advisor recommended me Polymake, which is indeed useful even with ...
- 1
1
vote
0
answers
112
views
Is the formula known? and can we generalized for higher dimensions?
In this configuration as follows, we have a nice formula:
$$\cos(\varphi)=\frac{OF.OE+OB.OC}{OF.OB+OE.OC}$$
Is the formula known? and can we generalized for higher dimensions?
- 1,776
2
votes
1
answer
61
views
$k$-subset with minimal Hausdorff distance to the whole set
Let $(\mathcal{M}, d)$ be a metric space. Let $k \in \mathbb{N}$. Let $[\mathcal{M}]^k$ be the set of $k$-subsets of $\mathcal{M}$. Consider the following problem:
$$ \operatorname*{argmin}_{\mathcal{...
- 2,203
9
votes
1
answer
845
views
Convergence of sequences formed by orthocenters, incenters, and centroids in repeated triangle constructions
I asked this question on MSE here.
Given a scalene triangle $A_1B_1C_1$ , construct a triangle $A_{n+1}B_{n+1}C_{n+1}$ from the triangle $A_nB_nC_n$ where $A_{n+1}$ is the orthocenter of $A_nB_nC_n$, ...
- 541
5
votes
1
answer
176
views
Efficient counting of integer solutions to linear system
In my research, I have a particular 18x18 matrix $\mathbf{A}$ which defines the linear system $\mathbf{A}\cdot \mathbf{x} \leq \mathbf{-1}$ over the nonnegative integers. And I'm interested in ...
- 151
0
votes
0
answers
77
views
In how many ways is it possible to order the sides and diagonals according to their length for all n-gons?
If we'd do it for example for 4-gons, for quadrilaterals, we could start with all the possible quadrilaterals.
We could say that the four vertices are a,b,c and d.
And then we'd have 6 lines, I mean,
...
- 89
2
votes
0
answers
259
views
Least number of circles required to cover a continuous function on $[a,b]$
I asked this question on MSE here.
Given a continuous function $f :[a,b]\to\mathbb{R}$, what is the least number of closed circles with fixed radius $r$ required to cover the graph of $f$?
It is ...
- 541
7
votes
1
answer
1k
views
An unpublished calculation of Gauss and the icosahedral group
According to p. 68 of Paul Stackel's essay "Gauss as geometer" (which deals with "complex quantities with more than two units") , Gauss calculated the coordinates of the vertices ...
- 2,099
15
votes
1
answer
530
views
Dividing a polyhedron into two similar copies
The paper Dividing a polygon into two similar polygons proves that there are only three families of polygons that are irrep-2-tiles (can be subdivided into similar copies of the original).
Right ...
5
votes
3
answers
560
views
An inequality in an Euclidean space
For $n\geq 1$, endow $\mathbb{R}^n$ with the usual scalar product. Let $u=(1,1,\dots,1)\in\mathbb{R}^n$, $v\in {]0,+\infty[^n}$ and denote by $p_{u^\perp}$ and $p_{v^\perp}$ the orthographic ...
- 449
8
votes
4
answers
927
views
What are the $\inf$ and $\sup$ of the area of quadrilateral given its sides length?
I asked this question on MSE here.
Given a quadrilateral with side lengths $a,b,c$ and $d$ (listed in order around the perimeter), t's known that the area, is always less than or equal to $\frac{(a+...
- 541
6
votes
1
answer
253
views
Inscribing one regular polygon in another
Say that one polygon $P$ is inscribed in another one $Q$, if $P$ is contained entirely in (the interior and boundary of) $Q$ and every vertex of $P$ lies on an edge of $Q$. It's clear that a regular $...
- 161
2
votes
1
answer
86
views
Difference of probabilities of two random vectors lying in the same set
Suppose I have to random vectors:
$$\mathbf{z} = (z_1, \dots, z_n)^T, \quad \mathbf{v} = (v_1, \dots, v_n)^T$$
and set $A \subset \mathbb{R}^n$.
I want to find an upper bound $B$ for the following ...
- 33
15
votes
2
answers
2k
views
How can I (semi-formally) convince myself that Euclidean geometry comports with visual intuition?
I originally posted this question on Math.SE and received some interesting comments but no answers. Now that some time has passed I thought that it might be appropriate to post here as well; perhaps ...
- 309
4
votes
0
answers
46
views
Implementation of Friedman's algorithm of reconstructing simple polytopes
In Finding a Simple Polytope from Its Graph in Polynomial Time, Friedman gave a polynomial time algorithm on reconstructing a simple polytope from its graph. Has this algorithm been actually ...
20
votes
1
answer
1k
views
Does a function from $\mathbb R^2$ to $\mathbb R$ which sums to 0 on the corners of any unit square have to vanish everywhere?
Does a function from $\mathbb{R}^2$ to $\mathbb{R}$ which sums to 0 on the corners of any unit square have to vanish everywhere?
I think the answer is yes but I am not sure how to prove it.
If we ...
- 4,862
11
votes
1
answer
211
views
Is it possible for the dihedral angles of a polyhedron to all grow simultaneously?
(Originally on MSE.)
Suppose $P$ and $Q$ are combinatorially equivalent non-self-intersecting polyhedra in $\mathbb{R}^3$, with $f$ a map from edges of $P$ to edges of $Q$ under said combinatorial ...
- 3,068
0
votes
0
answers
39
views
Max-flow modeling with unified vehicle and commodity variables
I am working on a network flow problem that involves routing through a time-space network. The network consists of:
A single source node and a single demand node.
A fleet of vehicles with specified ...
- 101
0
votes
0
answers
30
views
Application of greedy approach for optimization
I want to maximize an objective given by $$\max_{\{q_n,p_n\}} \sum_{n=0}^\infty (\alpha_1 - \beta_1 n) p_n + (\alpha_2 - \beta_2 n) q_n$$
where $\alpha_1 > \beta_1 >0$ and $\alpha_2 > \beta_2 ...
- 23
1
vote
0
answers
86
views
The intersection of $ n $ cylinders in $ 3D$ space
I posted the question on here, but received no answer
I recently found out about the Steinmetz Solids, obtained as the intersection of two or three cylinders of equal radius at right angles. If we set ...
- 387
4
votes
1
answer
146
views
Bounding distance to an intersection of polyhedra
Let $P$ and $Q$ be polyhedra in ${\mathbb R}^m$ with a non-empty intersection. I believe there should exist a constant $C_{PQ}>0$ such that for any point $x\in {\mathbb R}^m$ the following ...
- 1,579
3
votes
2
answers
205
views
Bounding distance to a polyhedron
I need to estimate the Euclidean distance from a point $x\in {\mathbb R}^m$ to a polyhedron $P\subset {\mathbb R}^m$ in terms of distances from $x$ to the tangent hyperplanes which define $P$. By a ...
- 1,579
2
votes
1
answer
213
views
Is matrix B obtained from matrix A?
Assuming a matrix $\mathbf{A} \in \mathbb{R}^{4096 \times 4096}$ sampled from a standard normal distribution $N(0, 1)$, and another matrix $\mathbf{B} \in \mathbb{R}^{4096 \times 4096}$ either sampled ...
- 49