All Questions
279 questions with no upvoted or accepted answers
2
votes
0
answers
47
views
A linear program where coordinate descent works pretty well
I am working with a polytope $P\subset \mathbb{R}_+^n$ with the property that there are at about $n!$ minimizers of $\sum_{i=1}^n x_i$, in the following sense:
Select any coordinate $j$ and set $...
- 21
2
votes
0
answers
70
views
«Euclidean» local systems
The moduli space of G-local systems on a surface is a fundamental object in mathematics. The cases $G=SU(2)$ and $G=SL_2(\mathbb{R})$ are of particular interest. Consider the group $E$ of isometries ...
- 4,316
2
votes
0
answers
148
views
Generalization of Farkas' Lemma to Hermitian Matrices
I recently stumbled upon a well-known version of Farkas' Lemma which, roughly speaking, I would like to generalize from real vectors to hermitian matrices, as it seems promising for something else I ...
2
votes
0
answers
87
views
Existence of a "generic enough" lattice point interior to a lattice triangle
Let $T$ be a lattice triangle in $\Bbb R^2$ (i.e. the convex hull of three noncolinear points in $\Bbb Z^2$), and assume it has at least one interior lattice point. Is it always possible to find a ...
- 3,079
2
votes
0
answers
261
views
Acute triangles from 100 points
Given $n$ points in general position in the plane, let $P_n$ be the maximum proportion of the $\binom{n}{3}$ triangles with three acute angles. What is the limit $\lim\limits_{n \rightarrow \infty} ...
- 169
2
votes
0
answers
169
views
theories where angles exist without a metric
The underlying basic question, which I'm sure I'm not the first to ask, is what are the possible exotic/nonintuitive models of Euclid's axioms/postulates, outside the one where "lines" are interpreted ...
- 2,041
2
votes
0
answers
166
views
Pascal theorem for three dimensions
A year ago I found the Pascal theorem for three dimentions as follows:
Let $(C_1)$, $(C_2)$ be two conics on the same Ellipsoid, (or Hyperboloid, or Paraboloid). Let $A_1$, $A_2$, $A_3$, $A_4$, $A_5$,...
- 1,776
2
votes
0
answers
283
views
Derivative with multiple summation operators
I have a defined utility function as Eq.(1), and I am seeking the minimized utility subjects to some constraints. The notation used is as following:
\linebreak
$V$ is the set of nodes, $v_i\in V$; $O$...
- 21
2
votes
0
answers
55
views
Collinearity in Enumerations of the Rationals
I am looking for a solution of the No Three-in-a-Line problem for the whole $\mathbb{Z}\times\mathbb{Z}$ plane and had the idea, to use a non-redundant enumeration of the rationals, like the breadth-...
- 13.2k
2
votes
0
answers
43
views
Partitioning $n$-space based on linear combinations
I'm trying to figure out the approximate number of areas the positive $n$-space will be divided into if we partition it as follows: we have $k$ linear functions $F_1$, $F_2$, ..., $F_k$ on $n$ ...
- 21
2
votes
0
answers
2k
views
How to find a positive solution to an under-determined linear system (if such a solution exists)?
Like the title says, if an under-determined system of linear equations does have at least one positive solution, how to find it efficiently?
Suppose we have an under-determined system:
$$Ax = b$$
...
- 121
2
votes
0
answers
80
views
Making a polyhedron integral by selecting value for a specific co-ordinate of constraint vector
I am currently trying to solve a binary integer programming(maximization) problem, where the first row of the constraint matrix corresponds to the constraints on the total number of 1's in the vector ...
- 123
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} \...
- 159
2
votes
0
answers
344
views
Linear programming with an infinite matrix
I would like to solve the following infinite linear system subject to $x_i \ge 0$ that minimizes $x_3$.
The third column contains no additional nonzero values beyond what is shown. Though the first ...
- 283
2
votes
0
answers
126
views
Unveiling hidden structures
One way to unveil a hidden structure of a undirected graph - given as an adjacency matrix - is to permute the rows and columns until a pattern with a maximal geometrical symmetry is found. (The ...
- 9,720
2
votes
0
answers
299
views
Practical application of envelope theorem for linear programs
Assume that we have solved a (standard) linear program
$$
\text{minimize}_{x\in {\mathbb R^n}}\,\, c_0^Tx, \,\,\,\,\, \text{s.t. } A_0x \leq b_0,
$$
and would like to know how sensitive is the optimal ...
- 7,182
2
votes
0
answers
64
views
Finding orthogonal basis with constraint
Is there any fast algorithm that output an orthogonal basis $e_i,i\leq n$ of $R^n$
with $e_i\in V_i$? Where $V_i,i\leq n$ are given linear subspaces of $R^n$.
And is there any condition on $V_i,i\leq ...
- 909
2
votes
0
answers
71
views
Existence of probability distribution satisfying upper/lower bounds on events
Suppose we have a finite sample space $S$ and some events $A_1, \dots, A_k \subseteq S$. We would like to put a probability distribution on $S$ so that no element has probability greater than a ...
- 21
2
votes
0
answers
177
views
Formulating shortest path as submodular minimization
I'm curious about the general question of whether any combinatorial optimization problem with polynomial time solution can necessarily be reformulated as minimizing a submodular function.
The answer ...
- 21
2
votes
0
answers
168
views
Which Coxeter groups can be realized as affine reflection groups?
Every affine reflection group has a Coxeter presentation (https://en.wikipedia.org/wiki/Reflection_group#Relation_with_Coxeter_groups). How do you tell which Coxeter presentations arise from affine ...
- 2,130
2
votes
0
answers
154
views
Listing all Lattice Points in a Box
Let $B := [-1,1]^n$ be an $n$-dimensional box. Moreover, let $v_1,\ldots,v_n \in \mathbb{R}^n$ form a basis of $\mathbb{R}^n$, where the entries of the $v_i$ are explicitly irrational. We can assume ...
- 173
2
votes
0
answers
210
views
Finding optimal linear transformation for intersection of convex polytopes
I previously posted this on MathSE and am now trying here.
I have the following situation, as shown in the following diagram:
$W=\{w_i\}_{i=1..|W|}$ is a set of vertices (show in diagram in blue) ...
- 695
2
votes
0
answers
56
views
Projecting a convex partition onto a convex set
Say that $X$ and $Y$ are two convex regions in the plane, and suppose that $X \subset Y$. Further suppose that $Y$ is partitioned into disjoint convex subsets $Y_1 ,\dots, Y_n$. Is there a way of ...
- 4,049
2
votes
0
answers
265
views
How large can a set of nearly equidistant points be?
Suppose that $D$ is a set of points in $\mathbb{R}^{k}$ such that all pairwise distances between them belong to $[1,1+\epsilon]$.
It seems that such a set cannot be very large and that its ...
- 6,962
2
votes
0
answers
148
views
Derivation of gradient of SSE in Geodesic Regression
On page 79 (or page 5) of this this paper the gradient of the SSE of the Geodesic model is described explicitly. My question is how are these equitations derived in detail; where can I find the ...
- 5,405
2
votes
0
answers
71
views
Select n vectors from k vectors (in 3D) such that each component of the resultant vector >= each component of a given vector M
this was left unanswered for 1 week on MStackExchange, so I thought MOverflow would be more appropriate. Thanks :)
Let $R = (R_x, R_y, R_z)$ be the resultant vector of the n vectors and $M = (M_x, ...
- 21
2
votes
0
answers
189
views
Examples of Geometric Constructions in Higher Dimensions
The classical problem of geometric construction seems to be restricted to planar Euclidean Geometry with straight edge and compass as the only admissible "construction-tools".
I would like to know,...
- 13.2k
2
votes
0
answers
118
views
Containing a "fuzzy" ellipsoid within an ordinary ellipsoid
Consider the ellipsoid described by the inequality $(x - x_c)^T P^{-1} (x - x_c) \leq 1$, where the vector $x_c \in \mathbb{R}^n$ denotes the center of the ellipsoid and the symmetric positive ...
2
votes
0
answers
286
views
Probability of 4 Points being in Convex Configuration
Background of my question is, that I would like to implement a parallel preprocessing for a constructing the convex hull of very huge number of points in the euclidean plane;
the idea is to process 4-...
- 13.2k
2
votes
0
answers
91
views
Algorithms to find the solutions of a homogenous matrix equations for non-commutative rings
In one paper from 1980 I found a note that there are no known algorithms for solving
homogenous matrix equations $x \cdot M = 0$ for matrices which elements belong to a non-commutative ring.
(The non-...
2
votes
0
answers
120
views
integrality of a linear program -- binary equality constaints
Consider the following linear program:
$\left\{
\begin{array}{l}
\underset{x}{max} \;\;c^Tx\\
[I, \;B]x = \mathbf{1}\\
x\geq 0
\end{array}
\right.$
where $c$ is a vector ...
- 127
2
votes
0
answers
39
views
In what paper was the shrinkage parameter introduced to the nelder-mead simplex direct search algorithm?
I have read lots of papers referencing a 4th shrinkage parameter when talking about the Nelder Mead Simplex method. However, I cannot see any shrinkage parameter in the flow chart of the original ...
- 21
2
votes
0
answers
163
views
existence of lattice point in polytope
This question was probably asked before but here goes. I have a convex polytope given by $Ax\leq b$ for a specific integer matrix $A$ and integer vector $b$. I need a simple method/result on how to ...
- 501
2
votes
0
answers
63
views
Put positive polynomial in finite intersection of half-spaces
This is a cross-posting of a MSE question (which did not attract any attention there so far).
Denote by $V={\mathcal P}_{n,d}$ the space of polynomials in $n$ variables with degree at most $d$, ...
- 621
2
votes
0
answers
697
views
Find minimum-area ellipse enclosing a set of ellipses, all centered at the origin
Given a set of N > 2 (two-dimensional and coplanar) ellipses, all centered at the origin, how do I find the ellipse with the minimum area which encloses all of them?
Background:
Thanks to Will Jagy ...
- 21
2
votes
0
answers
281
views
Axiomatization of the incidence geometry of the Euclidean plane
There are several well-known axiomatizations of Euclidean plane geometry, the language of which is usually considered to include at least the relations of
incidence (point-line, point-segment, or ...
user1448
2
votes
0
answers
230
views
Consistency of a system of linear equations
I have a system of linear equations in form of $AX=b$ where $A_{m\times n}$, $X_{n\times 1}$ and $b_{m\times 1}$. Coefficient matrix $A$ is quite sparse. However, using a practical LP solver like ...
- 221
2
votes
0
answers
917
views
Guessing game with guess cost
This is a question about Problem 328 on the website Project Euler. A description of the problem is provided in the previous link. I was wondering if there has been any research done on this question. ...
- 4,952
2
votes
0
answers
215
views
Number of breakpoints in parametric maximum flow problems
The parametric maximum flow problem can be formulated as
$$f(\lambda) = \min_{x\in\{0,1\}^n} \left( \sum_{i}(a_i + b_i\lambda)x_i + \sum_{i,j}c_{ij}x_ix_j \right),
$$
where all $c_{ij}<0$ (so that ...
- 567
2
votes
0
answers
281
views
Recovering a piecewise affine function
Lets say I have an piecewise affine convex function $f(x_1,x_2)$, on which the following operations are possible:
Computing $f(x_1,x_2)$.
Computing a subgradient to $f$ at $(x_1,x_2)$
Computing all ...
- 567
2
votes
0
answers
5k
views
A system of linear equations with linear constraints
Mathematical problem.
Suppose we have $2n$ indeterminates $x_1,\dots,x_n$ and $y_1,\dots,y_n$ (which are denoted by $q$ with indices and called abundances below) and $m$ subsets $P_1,\dots,P_m$ of $\...
2
votes
1
answer
184
views
Four concyclic triangle centers
Can you prove the claim given below? Inspired by Lester's theorem I have formulated the following claim:
Claim. Given any scalene triangle $\triangle ABC$ . Let $D$ be the reflection of incenter in ...
- 2,661
1
vote
0
answers
29
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
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 ...
- 990
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
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
1
vote
0
answers
47
views
Characterization of Gaussian Gram matrices
From Euclidean geometry we know that a matrix $C$ is a matrix of squared Euclidean distances between some points if and only if $-\frac{1}{2} H D H \succeq 0$ (positive semi-definite) with $H = (I - \...
- 407
1
vote
0
answers
94
views
Linear Program Optimal Value
If $f(A,b,c)$ is the optimal value of a linear program
$\min c.x$
subject to $A.x \leq b ; x \geq 0.$
Does $f(A,b,c)$ have a piecewise polynomial/rational upper bound in $(A,b,c)$ on the domain of ...
1
vote
0
answers
23
views
Estimate on the minimum distance from integer points on some fixed hyperplanes to a moving hyperplane
Suppose in $\mathbf{R}^n$ there are $m$ given hyperplanes $\Pi_j:\sum_{i=1}^n c_{i,j}e_i=0$ all of which go through the origin, and all the coefficients $c_{i,j}$ are rational (you can make them all ...
- 909
1
vote
0
answers
36
views
Does Hoffman constant keep the same after a very tiny perturbation on the polyhedron such that the bases are even unchanegd?
Suppose that $P$ is a polyhedron represented by
$$P:=\{x \in \mathbb{R}^n: A x \le b \} \text{ for }A \in \mathbb{R}^{m\times n},\ b \in \mathbb{R}^m,$$
and $P$ contains interior points. Moreover, the ...
- 33