All Questions
739 questions
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....
1
vote
0
answers
122
views
Growth polynomial of the Associahedron graph ? (Is it approximately Gaussian ?)
Consider Associahedron, consider graph build from its vertices and edges. Choose some vertex. Let us count the number of vertices on distances $k$ from the selected vertex. Write a generating ...
- 24.9k
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
1
vote
0
answers
56
views
Tiling with one of each 3D shape
Encouraged by the positive solutions to my question,
Tiling with one of each shape,
I'd like to pose the $\mathbb{R}^3$ equivalent:
Q. Is there a tiling of $\mathbb{R}^3$ by (bounded) polyhedra, one ...
- 151k
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
14
votes
1
answer
556
views
What is the "schematic" point of view for regular polyhedra?
Last week, I read Wikipedia's article on Alexander Grothendieck. It lists his twelve greatest contributions to mathematics as accounted for in Grothendieck's own Récoltes et Semailles. The final item ...
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 &...
5
votes
2
answers
217
views
Smooth toric variety which is a cube is a bott tower (reference request)
According to Lee, Masuda and Park (page 3), the following result is "well-known in toric topology". I've found a proof, but I would like a published reference.
Let $X$ be a toric variety. ...
- 156k
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
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
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
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
5
votes
0
answers
82
views
What tools can show that (possibly irregular) dodecahedra do not fill space?
(Formerly on MSE.)
Here is a fairly natural question: Can three-dimensional space be filled with convex polyhedra of the same incidence structure (if not the same geometry) as the regular dodecahedron,...
- 3,068
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
2
votes
3
answers
1k
views
Concrete works by Alexandre Grothendieck, other than Dessin d'Enfants?
For me "Dessin d'Enfants" by Alexandre Grothendieck is the more concrete research work he has done. I would like to know if there are others.
When he was teaching at Montpellier University (...
- 85
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
0
votes
0
answers
52
views
Polyhedra volume, faces and edges from vertices
Given a set of vertices in 3D corresponding to a convex polyhedron, what is the most efficient way to find its volume, faces, and edges?
I've found some techniques using convex hulls. But I think I ...
- 101
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
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 ...
3
votes
1
answer
239
views
The realization space of non-convex polyhedra - What is known?
The space $\mathfrak R_{\mathrm c}(P)$ of convex realizations of a (3-dimensional, spherical) polyhedron $P$ is known to be well-behaved: it is a contractible manifold of dimension $\#\text{edges}+6$ (...
- 13.6k
1
vote
0
answers
69
views
Polyhedra with equal faces
It is easy to see that for isosceles tetrahedra (https://en.wikipedia.org/wiki/Disphenoid) all faces are equal acute triangles. If we consider regular tetrahedra and attach a regular triangular ...
- 691
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 ...
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
1
vote
0
answers
51
views
Enumeration of uniform polyhedra
[I already asked this question on MSE (here) but got no answer so I am trying here]
It is known that there are two infinite classes of polyhedra (prisms and antiprisms) together with $75$ uniform ...
- 1,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
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
0
votes
1
answer
127
views
4 triangular faces 6 vertices not tetrahedron [closed]
I have made a solid and would like to know its' name, volume and related formulas. It is made using a flat potato chip bag. The end opposite the factory seal is sealed perpendicular to the factory ...
- 21
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
0
votes
0
answers
36
views
ILPs with square constraint matrix
Given the Integer Linear Programming ($\text{ILP}$) problem
\begin{array}{ll}
\text{minimize} & c^T x \\
\text{subject to}& \mathbf{A}^T x \ge b \\
\text{where}&c,x,b\in\mathbb{N}_0^n,\\ &...
- 13.2k
0
votes
0
answers
26
views
Monotony of enforced subtour merging
Is it true that for a symmetric TSP instance in the sequence of edges generated by successively:
calculating the optimal 2-factor
adding cardinality constraints on the edgesets of the 2-factor's ...
- 13.2k
0
votes
0
answers
171
views
Solve NP-hard type problems with linear programming
I would like to know if there is any way to solve an NP-hard type problem, for example, the TSP, sum of subsets or knapsack problem, by using linear programming and not by brute force.
I ask this ...
0
votes
0
answers
64
views
Alternatives to McCormick Envelope
I have an optimization problem for which I have the optimal solution obtained by the ILP.
However, when I introduced the McCormick Envelope to replace the product of a bi-linear term in its LP ...
- 3
2
votes
0
answers
119
views
Seeking insights on bounded set positive solutions for a set of linear systems in $\mathbb{R}^n$
Before delving into my query, I'd like to provide some context. Consider a continuous function $f:\mathbb{R}^{k}\rightarrow\mathbb{R}^{m}$ and a compact set $\mathcal{B}\subset \mathbb{R}^{k}$ (...
0
votes
1
answer
169
views
How to integrate an indicator function/constraint into the cost function of a linear program?
I have a mathematical model $P$ for which I optimize two cost functions say $F_1$ and $F_2$ subject to a set of constraints $C1$–$C10$.
In $F_2$, I want it to be included only when its expression ...
- 3
0
votes
0
answers
164
views
Inf-convolution of norm 1 and norm 2 square
The inf-convolution of the functions $f$ and $g$ defined on $\mathbb{R}^n$ is
$$
h(x)=\inf _{y \in \mathbb{R}^n} f(y)+g(x-y) .
$$
We can prove that if $f,g$ are convex functions, then $h$ is convex.
...
- 129
0
votes
1
answer
28
views
Calculating vertex potentials from optimal matchings
Question:
can the solution to the dual of a Linear Program be calculated directly from the solution of the primal Linear Program?
If yes, what are known algorithms and their bounds on complexity.
As ...
- 13.2k
4
votes
3
answers
1k
views
Is there a pyramid with all four faces being right triangles? [closed]
If such a pyramid exists, could someone provide the coordinates of its vertices?
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 ...
0
votes
1
answer
114
views
Mixed integer program and continuous Diophantine approximation
Let $n\in\mathbb{N}$ such that $n\geq 2$ and let $0<r<1$ be a real number. We wish to solve the following problem.
$$\min_{(t,(z_j)_{j=2}^n) \in \mathbb{R}\times \mathbb{Z}^{n-1}} t$$
subject to ...
1
vote
0
answers
82
views
A face and all its neighbors: terminology?
Suppose $F$ is a face of a 2-complex, and $F_1,\dotsc,F_n$ are the faces that are adjacent to (i.e., share an edge with) $F$. Is there a standard term for a collection of faces of the form $\{F,F_1,\...
- 19.7k
5
votes
1
answer
190
views
Regular polyhedral spaces
By symmetrically gluing together opposite faces of a dodecahedron together, one of three spaces can be obtained, depending on the angle the faces are rotated by before twisting. In fact, this can be ...
- 2,773
2
votes
1
answer
240
views
Is the problem of vertex enumeration from an H-representation of a polytope NP-hard?
According to the Wikipedia page on the issue, the vertex enumeration problem is NP-hard.
However, double description and reverse linear search are algorithms listed to solve the problem. Moreover, ...
- 123
2
votes
0
answers
306
views
Why is it impossible to create a numerically balanced die with more than 120 sides?
I allow myself to contact you as a mathematics enthusiast. I have recently been intrigued by the concept of balance in dice and the assertion that it would be impossible to create a numerically ...
0
votes
0
answers
55
views
Relationship of optimal solutions between the total function and the sub function
This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x)$, where $x\in\mathbb{R}^...
- 1
5
votes
1
answer
204
views
Orienting the dual of the associahedron
Let $A_n$ be the dual simplicial complex to the associahedron on $n$ letters. The complex $A_n$ is thus a simplicial triangulation of an $(n-3)$-dimensional sphere. The vertices of $A_n$ correspond ...
- 53
0
votes
0
answers
85
views
Show that $\max_{P_X : X\in (0,1) } \left| \frac{\mathbb{E} [ f'(X) ]}{ \mathbb{E} [ f(X) ] } \right|$ is maximized by at most two mass points
Let $f$ be some given well-behaved function. Consider the following optimization problem overall probability distribution on $[0,1]$
\begin{align}
\max_{P_X : X\in [0,1] } \left| \frac{\mathbb{E} [ ...
- 671
1
vote
1
answer
69
views
$A^*$ algorithm to find shortest path when weights in my graph are the inverse of distance
Given a graph G=(V,E) where the weights on my edges are inverse of Euclidian distance between nodes, I want to know if I can use A* algorithm to find the shortest path. How I need to modify the ...
- 111