All Questions
1,021 questions
0
votes
0
answers
92
views
Lines through the origin every pair of which meet at the same angle
This item isn't getting attention, so I'll try it here:
begin quote
The three lines through antipodal pairs of centers of faces of a cube meet each other pairwise at $90^\circ$ angles.
The three lines ...
8
votes
2
answers
1k
views
Minesweeper as a linear algebra problem
I've written a computer program to generate and solve minesweeper games. Once I've eliminated the obvious mines and safe squares I look at each remaining connected setsin turn and formulate a linear ...
- 361
0
votes
0
answers
68
views
Convex optimization under asymmetric loss in infinite dimensional space
The following problem is common in financial economics
$$ \min_{m \in L^2} \mathbb{E}[ \phi(y(\theta)-m)] \quad \text{s.t. } \mathbb{E}[ mx ]= q $$
That is, given a random variable $y(\theta)$ ($\...
- 45
1
vote
0
answers
40
views
Maximizing the volume of the intersection of a fixed ball with a cube with varying width and location
Given a ball $B$ and a linear subspace $L$ in $\mathbb{R}^n$, what is the maximum value of
$\frac{vol(B \cap C)}{vol(C)}$
where $C$ is a cube of the form $x + [0, h]^n$ for $x \in L$ and $h \in \...
- 5,339
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 $\...
- 4,459
2
votes
1
answer
139
views
linear programming with $n$ choose $r$ variables
Given parameters $r < n$, define $m = {n \choose r}$ and let $A$ be the $n\times m$ matrix whose columns are all the vectors with $r$ $1$'s and $n-r$ $0$'s. Let $b$ be a positive $n$-vector. Is ...
- 51
2
votes
0
answers
80
views
Can an exterrior of a ball in Euclidean space be considered a ball itself under any proposed generalization?
If we take an n-dimensional Euclidean space and cut off a ball centered at origin, we get a set that has boundary equal to the surface area of the cut off ball.
I wonder whether there were any ...
- 10.1k
8
votes
0
answers
205
views
Which subsets of the plane are similar to all their affine images?
A parabola P in the plane has the nice property that the image of P under any affine transformation is similar to P itself.
Which other subsets of the plane have this property?
I wondered aloud about ...
- 2,896
2
votes
1
answer
763
views
Integer solution of optimal transport
Let us consider two vectors $\mathbf{a}=(a_1,...,a_n)$ and $\mathbf{b}=(b_1,...,b_m)$ so that each quantity is an integer $a_i,b_j \in \mathbb{N}$. It represents for example supply and demand. Let $\...
- 407
1
vote
1
answer
3k
views
How to minimize l1-norm constrained by "infinity norm"
Let $A \in \mathbb{R}^{m \times n}$ and $b \in \mathbb{R}^m $. I have the following two problems:
P.1.
\begin{equation}
\underset{x\in\mathbb{R}^n}{\text{minimize}} \| Ax-b \|_1 \\
\text{s.t. } \| x \...
- 13
3
votes
1
answer
106
views
Solid angles at points in an orthosimplex
Given a point ${\bf x} = (x_1,x_2,\dots,x_n)$ in the orthosimplex $K = \{(x_1,x_2,\dots,x_n)\ : \ 0 \leq x_1 \leq x_2 \leq \dots \leq x_n \leq 1\}$, what proportion of a ball of radius $\epsilon$ ...
- 19.7k
0
votes
1
answer
126
views
An otherwise linear matrix equation with the presence of a signum function : reference request
Consider the equation $$\pmb{c}+\text{sign}(G\pmb{c}) = L$$
$\pmb{c}$ is a $n\times1$ matrix.
$G$ is a $n\times n$ matrix which is also positive definite.
matrices $G$ and $c$ are real.
$L$ is a $n\...
- 698
3
votes
0
answers
122
views
Convex optimization upper bound for a non-linear optimization
Is there any good convex optimization problem based upper-bound for the following non-linear optimization problem?
\begin{align}
\max_{x_1,\ldots,x_N}&\quad \sum_{n=1}^{N} \log(1+\frac{x_n}{1+\...
- 287
5
votes
0
answers
313
views
Trade-off between covering number, ball radius and diameter of $d$-dimensional shapes
Given any $d$-dimensional shape $X$ in the Euclidean space, let $\ell(X)$ be the length of the longest line segment connecting two points of $X$. How can we prove the following statement?
There exists ...
- 1,677
7
votes
1
answer
155
views
Can prolates overlap more easily than oblates?
Context:
When modeling anisotropic particles, the two common types of shapes of interest are cylindrical and disk-like particles. For simplicity let us say we model these as prolates and oblates ...
- 649
0
votes
0
answers
108
views
Solutions to matrix equations in the non-negative integers
For an integer matrix $S$, and an integer vector $y$, I'm looking for solutions to $xS = y$ where the entries in $x$ are in the non-negative integers.
I've been doing this with Sage's mixed integer ...
- 101
1
vote
0
answers
68
views
Fundamental regions in convex programming
In linear programming, the fundamental regions are polyhedra, since those are the intersection of half-spaces defined by linear inequalities. In semidefinite programming, the fundamental regions are ...
- 13.9k
1
vote
0
answers
41
views
If the volume-ratio of an inscribed convex set to the circumscribing convex set is rational, can anything of consequence be further deduced?
Say, one has two $n$-dimensional convex sets $A$ and $B$, with $B$ being inscribed in the strictly larger set $A$. ($A$ and $B$ have at least one boundary point in common. $B$ “fits snugly” in $A$ ...
- 723
1
vote
0
answers
147
views
Convergence of infinite linear programming
Suppose we have the following linear program (LP1),
$$\min_{f \in \mathcal{C}} \int_{\mathbb{R}} f(t) \cos(2 \pi x_0 t) dt \\ \text{subject to } \int_{\mathbb{R}}f(t)dt = 1 \\\forall x\in [0,1]: \int_{...
- 53
4
votes
1
answer
363
views
Trade-off between hypervolume and diameter of $d$-dimensional shapes having a hypercubic smallest bounding box
Given any $d$-dimensional shape $X$, let $V(X)$ be its $d$-dimensional volume, and let $\ell(X)$ be the length of the longest line segment connecting two points of $X$.
Let $\mathcal{S}_C$ be the set ...
- 1,677
-1
votes
1
answer
103
views
How to solve MILP problem on several linear subspaces
I have a set of close mixed-integer programming problems. More exactly, all the problems share the same set of (binary and continuous) variables, the same set of linear inequality constraints, and the ...
- 39
3
votes
1
answer
805
views
Brother of Japanese theorem for cyclic quadrilaterals
I am looking for a proof of a like result as follows and Higher-dimensional generalizations?
Let $A, B, C, D$ be four point with lengths of $AB, BC, CD, DA$ are $a, b, c, d$ respectively. Let $F \in ...
- 1,776
2
votes
0
answers
46
views
Notion of distance between linear programs
Consider the linear programming problem
\begin{align}
\max_{x}&~c^Tx \\~s.t.~~a^Tx &\leq B~,~0\leq x_i \le1
\end{align}
where $c$ and $a$ are $n \times 1$ given non-negative vectors. $B$ is a ...
- 1,421
3
votes
0
answers
73
views
On isospectral planar domains (and a paper by Buser, Conway, Doyle and Semmler)
I have never seen a short, elegant way (from the viewpoint of a non-topologist) which constructs isospectral planar domains from Sunada group triples, although essentially those triples live at the ...
- 4,547
5
votes
4
answers
613
views
Optimizing the gradient norm on the unit sphere
Let $ \Bbb S^{d-1}=\{(x_1,\cdots ,x_d): x_1^2+ \cdots +x_d^2=1\}\subset \Bbb R^d$ be the unit
sphere. Let $\nabla u= (\partial_{x_1}u,\cdots, \partial_{x_d}u)$ be the gradient of a function $u\in C_c^\...
- 1,101
2
votes
1
answer
98
views
There is no general method to construct n-regular polygon such that the given n-polygon inscribed the n-regular polygon
Conjecture 1: With $n\ge 5$, given general n-polygon, there is no general method to construct n-regular polygon such that the given n-polygon inscribed the n-regular polygon (with one and only one ...
- 1,776
3
votes
0
answers
60
views
A canonical map from a Euclidean cone-manifold $M^3$ to $\mathbb{E}^3/\mathrm{Hol}(M)$
Suppose we have a 3-dimensional Euclidean cone-manifold $M$—in my book that just means $M$ is a manifold whose geometry is constructed by gluing it out of Euclidean tetrahedra, with faces paired by ...
- 458
1
vote
0
answers
82
views
What is the relation between different generalizations of linear programming?
Linear programming subsumed by each of
Semidefinite programming (SDP)
Convex programming (CXP)
SOS programming (SSP)
Is there any relation between each pair in the three?
Are all three equivalent in ...
- 1,826
1
vote
0
answers
84
views
How can construct the equilateral $A''B''C''$ such that area of $A''B''C''$ is biggest
Let $ABC$ be arbitrary triangle in a plane. Let $A'B'C'$ and $A''B''C''$ be two equilateral triangles such that $A \in B'C'$, $B \in C'A'$, $C \in A'B'$ and $A \in B''C''$, $B \in C''A''$, $C \in A''B'...
- 1,776
1
vote
2
answers
166
views
ratio between a polygon bounded in another polygon [closed]
Let A be a convex polygon with area SA. Construct a new polygon B by orderly connecting the midpoints of the segments of A. Denote the area of B by SB. Claim : the ratio SB/SA is constant for all ...
- 61
3
votes
1
answer
303
views
How can construct three circles in a given triangle such that three internal tangent form an equilateral triangle
How can construct three circles in a given triangle such that three internal tangent form an equilateral triangle?
See also:
Malfatti circles
- 1,776
1
vote
0
answers
78
views
Reference for the algorithm to find the intersection between a subspace and positive orthant
I came across this algorithm, in this question Algorithm for the intersection of a vector subspace with a cone of non-negative vectors ;
Is there any reference for the algorithm described in the ...
18
votes
2
answers
1k
views
Emergence of the orthogonal group
Do we know what mathematician first considered, and perhaps named, what we call the group $\mathrm O(n)$, or $\mathrm{SO}(n)$, for some $n>3$?
I mean it specifically as group (not Lie algebra) ...
- 31.5k
0
votes
1
answer
139
views
Linear programming with exponential inequalities and rational variables
If we are given a set of real linear inequalities then using elimination theory or just linear programming we can decide. If the program also has inequalities of form $2^x\leq g$ in addition to linear ...
- 1,826
2
votes
1
answer
591
views
Intersection of a vector subspace with a cone
Given a set of vectors $S=\{v_1, v_2,...,v_d\} \subset \mathbb{R}^{N}, \, N>d$, is there any algorithm to decide if there exist a vector with all coordinates strictly positive in the generating ...
1
vote
0
answers
67
views
What are the corners of this polytope?
Let $f$ be a non-negative function on the positive integers such that $f(s+t)\geq f(s) + f(t)$ for all $s,t\in\mathbb{Z}^+$. Consider the polytope consisting of all $x\in \mathbb{R}^n$ such that $$\...
- 11
3
votes
1
answer
418
views
Generalization of Tucker circle, Conway circle and van Lamoen circle
Theorem 9.1 in this paper as follows is a generalization of Turker circle. Turker circles is a generalization of many circles as: Cosine Circle, circum circle, First Lemoine Circle, Gallatly Circle, ...
- 1,776
4
votes
0
answers
225
views
Studying finite groups with Euclidean geometry?
Since each finite group $G$ can be considered as a subgroup of the symmetric group, by Cayley's theorem, we might see the elements of $G$ as permutations $\pi$.
Consider for each $\pi \in G$ the set:
...
user6671
4
votes
1
answer
216
views
Is this elementary formula for the parabolic segment new?
Recently (May 2020) a formula for the area of the parabolic segment (i.e. the region enclosed by a parabola and a line), in terms of the coefficients of the Cartesian equations, has been published by ...
0
votes
1
answer
226
views
Fractional values in linear programming
Consider the linear programming problem
\begin{align}
f^* = \max_{x}&~p^Tx~\\~&A^Tx\leq b~,~0\leq x_i\leq 1
\end{align}where $p$ is a $n\times 1 $ vector, $A$ is a $n\times c$ matrix and $b$ ...
- 1,421
0
votes
0
answers
109
views
Comparing Euclidean norm of two normal vectors
Let $X_i$ ($i = 1,2$) be two random vectors in $\mathbb R^n$, with normal distribution with scalar covariance matrix $\sigma_i^2$ and center $\mu_i$ (in my case, $n = 2$). Is there a way to estimate ...
- 101
0
votes
1
answer
320
views
Sub optimal algorithm for linear programming
Consider the linear programming problem
\begin{align}
f^* = \max_{x}&~p^Tx~\\~&A^Tx\leq b~,~0\leq x_i\leq 1
\end{align}where $c$ is a $n\times 1 $ vector, $A$ is a $n\times c$ matrix and $b$ ...
- 1,421
27
votes
1
answer
995
views
The lion and the zebras
The lion plays a deadly game against a group of $N$ zebras that takes place in the steppe (= an infinite plane). The lion starts in the origin with coordinates $(0,0)$, while the $N$ zebras may ...
- 2,619
2
votes
0
answers
66
views
Proving the existence of a dual for an infinite linear program
I am concerned with proving the existence of the dual of an infinite linear program. In addition to the writings of Rockafellar, Luenberger, and Boyd & Vandenberghe on: subdifferentials, Legendre-...
- 121
0
votes
1
answer
144
views
Maximize function on rotation matrices [closed]
Let $A$ be a fixed 3-by-3 matrix and $Q$ be a rotation matrix whose yaw, pitch, and roll angles are $\phi\in[0,\pi]$, $\theta\in[0,\pi]$, and $\psi\in[0,\pi/2]$, respectively:
\begin{equation}
Q=
\...
8
votes
0
answers
264
views
What is a geometric construction corresponding to elliptic curve addition for Poncelet's Porism?
Background
At least since Griffiths and Harris [1] we know that the geometric construction "draw the next tangent" appearing in Poncelet's Porism corresponds to addition of a constant in the elliptic ...
- 1,444
2
votes
1
answer
127
views
Distance between two polyhedra that takes incidence structure into account
Suppose that we have two polyhedra $P_1$ and $P_2$ in $\mathbb{R}^3$. I would like to define such a metric $\rho(P_1, P_2)$ that depends on several factors, but currently I don't know how to do it ...
- 123
3
votes
0
answers
163
views
A new "adversarial" Wasserstein distance?
Let us consider $\mu_1, \mu_2$ and $\mu_3$ three probability measures living on $[0,1]^{k_1}, [0,1]^{k_2}$ and $[0,1]^k$respectively, with $k_1 +k_2=k$. Let us denote by $\Gamma(\mu,\nu)$ the set of ...
- 555
11
votes
2
answers
963
views
Why is modular forms applicable to packing density bounds from linear programming at $n\in\{8,24\}$?
Sphere packing problem in $\mathbb R^n$ asks for the densest arrangement of non-overlapping spheres within $\mathbb R^n$. It is now know that the problem is solved at $n=8$ and $n=24$ using modular ...
- 1,826
2
votes
1
answer
485
views
Odd cycle transversal
Suppose we have a graph G. Say B a fundamental basis of the cycle space of G. Say LP a linear programming problem where there is a variable for each vertex of G, each variable can take value $\geq 0$, ...
