**0**

votes

**0**answers

26 views

### Efficient sampling from a polytope with large number of contraints [duplicate]

As far as I know, the most popular way to sample from a polytope (in H-representation)
\begin{equation}
\mathcal{P} := \{z \in \mathbb{R}^n | (Az)_j \le b_j\; \forall j=1,2,\ldots,m\}
\end{equation}
...

**11**

votes

**1**answer

185 views

### Is there a proof of the uniformization theorem using circle packing?

In this paper: http://www.dm.unipi.it/~benedett/rodin-sullivan.pdf
Rodin and Sullivan show that circle packings converge to the Riemann map. Later, Scharmm and He found another proof of the same ...

**5**

votes

**1**answer

134 views

### Are the primary parallelotopes classified? (equivalently, Voronoi cells of lattices)

A primary parallelohedron is a polyhedron that can fill space with infinite translated copies.
It is known (e.g., Coxeter, H. S. M. Regular Polytopes, 3rd ed. New York: Dover, pp. 29-30, 1973; or, ...

**1**

vote

**0**answers

44 views

### Number of simplices contained in a convex body

I am interested in the following question:
Given a convex body $K$ in $\mathbb{R}^d$ and an $\epsilon>0$ small enough, how many $d$-simplices $\{D_i\}_{i=1}^m\subset K$ do we need at least so that ...

**0**

votes

**1**answer

58 views

### A bound on the Haussdorff distance

Let $X, Y \subset \mathbb{Z}^2$ be two discrete and bounded sets. Let $f_X$ be the Euclidean signed distance function of $X$ (similarly for $Y$) and $d_H(X,Y)$ the Euclidean Haussdorff distance ...

**9**

votes

**3**answers

268 views

### Labeling edges of an icosahedron with sum constraints

The question is inspired by this previous MO question. There it was shown that it's possible to label the edges of a cube by the numbers $\{1,2,\ldots,6,8,9, \ldots, 13\}$ in such a way that:
Three ...

**3**

votes

**1**answer

188 views

### Status of Zeeman's collapsability Conjecture

Zeeman's conjecture in topological combinatorics states that if K is a contractible polyhedron of dimension 2, then K×I has a collapsible subdivision.
What is the status of this conjecture ...

**15**

votes

**5**answers

603 views

### The smallest disk containing all sides of an $n$-gon

Start with a regular $n$-gon of side 1 and consider its sides as open segments that can be moved around in the plane, allowing only translations. Two segments may not intersect.
What is the ...

**0**

votes

**0**answers

63 views

### Maximum value of linear function on the intersection of a parametrized family of balls

Let $C$ be a (nonempty) closed convex subset of $\mathbb{R}^n$ and $a, b \in \mathbb{R}^n$. Using the normal cone characterization of the euclidean projection operator $\mathrm{proj}_C$ (recall that ...

**3**

votes

**1**answer

147 views

### How many points are in such set with the same norm-2

Let $L=[a,b]\cap\mathbb{N}$ with $a,b\in\mathbb{N}$, let $D\in\mathbb{N}$, and let $C=L^D$. Then I would like to know how many points are there in $C$ with the same given norm-2 $d$. I.e., I'm looking ...

**3**

votes

**1**answer

124 views

### How to show it is contained in a convex hull?

There are $(d+1)f$ points (denote the set of all points as $S$) in $\mathbb{R}^d$, that can be divide into $d+1$ disjoint sets $F_1,...,F_{d+1}$, each set of size $f$. If we have
$$
...

**20**

votes

**1**answer

729 views

### Covering of a surface of a cube $n\times n \times n$ by pieces of paper $1\times 6$

When I was too young one of my problems was in the list of problems of All-Russian Olympiad. The problem is the following:
Problem. We have a surface of a cube $n\times n \times n$ such that each ...

**1**

vote

**0**answers

66 views

### Affine-regular hexagon in convex body

An affine-regular $n$-gon is a non-degenerate affine image of the regular $n$-gon. It seems to be a standard fact in combinatorial geometry that inside every convex compact set $K\subseteq \mathbb ...

**5**

votes

**1**answer

156 views

### Intersection of rotating regular polygons

This question has a recreational flavor, but may not be
entirely uninteresting.
Let $P_k$ be a unit-radius regular polygon of $k$ sides,
and $P_n$ a unit-radius regular polygon of $n \ge k$ sides.
...

**4**

votes

**0**answers

80 views

### Finding closest set of K disjoint hyperspheres to a point in $\mathbb{R}^n$ with uniform radius

I am interested in the following problem: in $\mathbb{R}^n$, we have $N$ overlapping hyperspheres all with the same radius. Given a point $p$ in $\mathbb{R}^n$, the objective is to find the $K$ non ...

**6**

votes

**1**answer

90 views

### A question about simple closed plane polygons

For any positive integer $n$ greater than $3$, let $P(1),P(2),...,P(n)$ be a set of $n$ pairwise distinct points in the Euclidean plane, no three of which are collinear. Let $H(P(1),P(2),...,P(n))$ be ...

**25**

votes

**0**answers

513 views

### Tiling a square with rectangles

Is it possible to completely tile a square with different rectangles of integer sides but all with the same area?
The original problem, not requiring integer sides for rectangles, was proposed by Joe ...

**5**

votes

**0**answers

136 views

### Is there a decomposition strengthening of the Sauer-Shelah Lemma?

Let $S \subset \{-1,1\}^n$. For a subset $A \subset [n]$ let $P_A$ denote the coordinate projection operator on S; in other words let $P_A(S)$ be the coordinate projection of $S$ onto the coordinates ...

**14**

votes

**1**answer

289 views

### separating points in $\mathbb{R}^d$ by minimal number of planes

Given $n$ points of general position in $\mathbb{R}^d$ (say, $n>d$ and no $d+1$ lie in a hyperplane.) We want to draw $k$ hyperplanes not passing through those points so that they all are in ...

**14**

votes

**1**answer

298 views

### Number of height-limited rational points on a circle

Consider origin-centered circles $C(r)$ of radius $r \le 1$.
I am seeking to learn how many rational points might lie on $C(r)$,
where each rational point coordinate has height $\le h$.
For example, ...

**7**

votes

**3**answers

239 views

### Embedding planar graphs into the grid

I've seen the following lemma in a paper. The result is by Valiant.
A planar graph $G$ with maximum degree $4$ can be embedded in the plane using $O(|V|)$ area in such a way that its vertices are at ...

**6**

votes

**1**answer

227 views

### Lattice points on the boundary of an ellipse

How many points of the integer lattice ${\mathbb Z}^2$ can an axis-parallel ellipse of radius $r$ contain on its boundary? (that is, we consider ${\mathbb Z}^2$ as lying in ${\mathbb R}^2$). ...

**6**

votes

**1**answer

201 views

### What's the difference between a PL simplicial sphere and a shellable simplicial sphere?

Shellability of a simplicial sphere tells us that we can build up the complex one facet at a time such that at each step (except the last step) the complex is a PL-ball. At the last step it is of ...

**6**

votes

**1**answer

93 views

### Above/below directed graph on cells of arrangement of lines

This question concerns the structure of a directed graph
built on the cells of an arrangement of lines.
My basic question is whether this graph has been
studied before, perhaps in another guise. I ...

**2**

votes

**1**answer

75 views

### distinct multiple points in a space with at least one point lying in a subspace

Let $X$ be a topological space and $A$ a subspace of $X$. Given $k\geq 2$, let the unordered configuration space be
$$
B(X,k)=\{(x_1,x_2,\cdots,x_k)\in X^k\mid x_i\neq x_j \text{ for any } i\neq j\}
...

**0**

votes

**0**answers

48 views

### Finding spanning vector sets

Let $V$ be the set of all vectors over the non-negative integers. For any two subsets $S$ and $T$ of $V$, define $S + T$ to include:
All vectors in $S$
All vectors in $T$
All vectors that can be ...

**1**

vote

**0**answers

235 views

### Reduction to some physical interpretation of this formula

Problem Given N 3-dimensional points which are {$p_1,p_2,..,p_n$} where $p_i = (x_i,y_i,z_i) $ . I have to find the value of the formula
$$ \sum \limits_{i=0}^n \sum \limits_{j=i+1}^n \frac{ \mid ...

**7**

votes

**0**answers

148 views

### Which -icial sets produce the “standard” representations of symmetric groups?

Suppose you have a system of cell complexes (say, even convex polyhedra) $(P_n)_{n\geqslant0}$ which occur as faces of each other and are used to define the corresponding notion of "$P_*$-set". So ...

**4**

votes

**0**answers

45 views

### How does one go from convexity to submodularity?

If I have a function which is convex in the hypercube, $[-1,1]^n$ then when would it imply that its restriction to $\{-1,1\}^n$ is submodular?
It would be helpful is someone can share some specific ...

**9**

votes

**2**answers

114 views

### Generate polyhedra by collapsing vertices of a polyhedron

I am looking for basic information about the following idea:
(I) Consider a square. By collapsing two adjacent vertices, we obtain a triangle.
(II) Consider a three-dimensional cube. By collapsing a ...

**6**

votes

**3**answers

170 views

### Probability of random geodesics on the half-sphere intersecting

4 end points (a,b,c,d say) are chosen uniformly randomly and connected a to b and c to d by two geodesics on the 2-dim half-sphere. Here, uniform means that, probability that a point lies on a surface ...

**2**

votes

**1**answer

113 views

### Choosing the weights of a Voronoi diagram — is this function always the gradient of another function?

This question is related to the earlier question Weighted area of a Voronoi cell . As in that question, let $X = \{ x_1,\dots,x_n\} $ denote a set of $n$ points in the unit square $S = ...

**3**

votes

**2**answers

88 views

### Basic question about discrete minimal surfaces

Let $P$ be a convex polygon with $n > 3$ vertices $v_1, \ldots, v_n \in \mathbb{R}^2$, let $x$ be a point in the interior of $P$, and let $u$ be a function with prescribed values at the vertices of ...

**5**

votes

**0**answers

83 views

### Algorithm to express a point from a H-polyhedron as convex combination of extreme points

Let $P\subset\mathbb{R}^n$ be a convex polyhedron described as an intersection of hyperspaces, that is,
$$P:=\{\boldsymbol{x}: A\boldsymbol{x} \leq \boldsymbol{b}\}$$
Let $\boldsymbol{x} \in P$. We ...

**10**

votes

**1**answer

290 views

### What can we learn from the newly discovered monohedral convex pentagonal tiling?

Wikipedia: https://en.wikipedia.org/wiki/Pentagonal_tiling#Stein_.281985.29_and_Mann.2FMcLoud.2FVon_Derau_.282015.29
Media coverage: ...

**9**

votes

**4**answers

621 views

### Is this an instance of any existing convex pentagonal tilings?

Inspired by Wikipedia's article on pentagonal tiling, I made my own attempt.
I believe this belongs to the 4-tile lattice category, because it's composed of pentagons pointing towards 4 different ...

**5**

votes

**1**answer

194 views

### Smoothening a measure, II

There is an almost invisible, but significant difference between the question below and that recently answered by Boris Bukh.
Given a probability measure $\mu$ supported on a finite set ...

**3**

votes

**1**answer

133 views

### Smoothening a probability measure

Given a probability measure $\mu$ supported on a finite set $S\subset{\mathbb R}^2$, define
$$ f(z):=\max\left\{\frac{\mu(x)+\mu(y)}2\colon \frac{x+y}2=z,\ x,y\in S \right\},
\ z\in{\mathbb ...

**8**

votes

**1**answer

232 views

### Set of balls which the number of the ball intersects lines on the plane is bounded

Does there exist the set of balls(may be not disjoint) $X=\{B_i\subset\mathbb{R^2};i\in I\}$, satisfing following properties?(Note that the ball has a positive real radius)
Let the set of all lines ...

**5**

votes

**2**answers

101 views

### Inscribed parallelotope in a $d$-simplex

The problem setup is simple: Given a $d$-simplex $\Delta_d:=\{(x_1,\cdots,x_d):x_i\geq 0,\sum_i x_i\leq 1\}$, can we construct a finite sequence of parallelotope $A_i$ so that $\Delta_d=\cup_{i=1}^N ...

**21**

votes

**0**answers

337 views

### Minimal number of intersections in a convex $n$-gon?

For a convex polygon $P$, draw all the diagonals of $P$ and consider the intersection points made by those diagonals. Let $f(n)$ be the minimal number of such intersections where $P$ ranges over all ...

**2**

votes

**0**answers

104 views

### From Planar Graphs To Tangent Circles

I have a conjecture:
"For each planar graph with vertices $V_1, V_2,\ldots, V_n$ there exist disjoint circles $w_1,w_2,\ldots,w_n$ in the plane, such that for every $i,j$, $w_i$ is tangent to $w_j$ ...

**3**

votes

**1**answer

130 views

### Maximal $\pi/2$-separated subset of the sphere

A subset $A$ of a metric space is called $\varepsilon$-separated if
$$dist(x,y)> \varepsilon \mbox{ for all } x\ne y\in A.$$
(Notice that the inequality in my definition is strict.)
What is the ...

**7**

votes

**1**answer

422 views

### Approximating a real by a ratio of primes

Let $x$ and $y$ be positive reals in $(0,1)$ with $x < y$ and $y-x =\epsilon$.
I seek smallest primes $p$ and $q$ such that
$$x \le \frac{p}{q} \le (x+\epsilon) = y \;.$$
Q. What upper bound ...

**3**

votes

**1**answer

107 views

### The circle with minimal radius covering known finite set of points on a plane

Given some points on a plane, how to determine the circle with minimal radius covering all these points?

**5**

votes

**0**answers

117 views

### Visibility in a prime orchard

This suggests a variant on Polya's orchard problem.
That problem asks1
for which radius $\epsilon$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the ...

**5**

votes

**1**answer

99 views

### How to prove the existence of the polytope in $\mathbb{R}^d$ with a given number of faces, minimizing the isoperimetric ratio?

This is the isoperimetric type question. We know that in $\mathbb{R}^d$, balls are the sets that minimize the isoperimetric ratio $\frac{S^{d}}{V^{d-1}}$, where $S$ is the surface area and $V$ is the ...

**2**

votes

**0**answers

51 views

### Algebraic independence in normed spaces

A set of $n$ points in $\mathbb{R}^2$ is algebraically independent over $\mathbb{Q}$ if there is no polynomial dependency among the $2n$ coordinates.
A result (Lemma 3.3) from "Globally linked pairs ...

**1**

vote

**1**answer

213 views

### Convex polyhedron and its Gauß-curvature [closed]

I have asked this question on MathSE and no one could give me an answer. So I'll post my question here.
What I am trying to prove:
A convex polyhedron has positive Gauß-Curvature at every vertex.
...

**2**

votes

**0**answers

102 views

### need clarification of a paper by Fejes Toth

I would like some clarification about the following from Fejes Toth's paper "A stability criterion to the moment theorem"
The setup is:
For each positive integer $n$, let $r(H_n)$ and $R(H_n)$ ...