**4**

votes

**0**answers

73 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 ...

**4**

votes

**1**answer

82 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 ...

**1**

vote

**1**answer

189 views

### Convex polyhedron and its Gauß-curvature [on hold]

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.
...

**0**

votes

**0**answers

33 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

173 views

### Cardinality of non-integer points in the translation of the Minkowski sum of convex hull.

Let $\operatorname{conv}(a_1,\ldots,a_m)$ denote the convex hull of $\{a_1,\ldots,a_m\}$. Let $\mathbb{Z}_+=\mathbb{N}\cup\{0\}$ and $\mathbb{Q}_+$ denotes the positive (inluding 0) rational numbers. ...

**1**

vote

**0**answers

91 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)$ ...

**6**

votes

**2**answers

369 views

### Embedding of planar graphs

I've recently come across the following lemma.
Lemma (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 ...

**4**

votes

**1**answer

112 views

### Motzkin polynomials and enumeration of chord diagrams

On page 12 of the paper Enumeration of chord diagrams on many intervals and their non-orientable analogs" by Alexeev, Andersen, Penner, and Zograf is a list of polynomials which are a refinement of ...

**20**

votes

**2**answers

1k views

### Erdős-Szekeres for first differences

The classical Erdős-Szekeres theorem says that any sequence of $n^2+1$
real numbers contains a monotonic $(n+1)$-term subsequence. Suppose, however,
that we want to find a subsequence which is not ...

**3**

votes

**1**answer

96 views

### Special case of Erdos Distance Problem in a plane

Erdos in his Distinct distance Problem in a plane conjectured that the minimal number of distinct distance determined by $n$ points in a plane be $g(n)$,
$$g(n) \sim \frac{cn}{\sqrt{\log n}}$$
But ...

**2**

votes

**1**answer

129 views

### Number of lines of symmetry of a set of lattice points

Given some finite $S\subseteq\mathbb R^2$, it is clearly possible for $S$ to have arbitrarily many lines of symmetry. However, it is not very clear if the same is necessarily true for subsets of ...

**3**

votes

**2**answers

291 views

### Geometry, Number Theory and Graph Theory of n-gon, permutation and graph labeling?

Given $n$ and $t$ lengths $ l_i, 1\leq l_1<l_2<\cdots<l_t\leq n-1$, of directed diagonals within an $n$-gon such that $l_1+\cdots+l_t\neq 0 \pmod n)$. Does it exist a directed path within ...

**3**

votes

**1**answer

102 views

### Do random triangulation edge-flips maintain randomness?

Let $S$ be a fixed set of $n$ points in the plane in general position.
Let $T$ be a triangulation
of $S$, (somehow) selected
uniformly at random from all triangulations of $S$.
(There are an ...

**2**

votes

**1**answer

93 views

### Maximal neighbour-full partition of $\{0,1\}^n$

What is the largest complete minor of the $n$-dimensional hypercube? (which we call $k(n)$)
Alternatively, what is the partition of $\{0,1\}^n$ with each set connected and neighboring each other that ...

**10**

votes

**2**answers

277 views

### Double kissing problem

Consider two touching unit balls which will be called central balls. What is the maximum number $k$ of non-overlapping unit balls so that each ball touches as least one of two central balls?
An easy ...

**8**

votes

**4**answers

253 views

### Diameter of random segment intersection graph?

I have an even number of points $n$ randomly distributed (uniformly) in a disk.
Then the points are randomly connected to form $n/2$ segments, a perfect
matching.
Finally, I form the intersection ...

**3**

votes

**1**answer

166 views

### Blowing up spheres in a face centered cubic (fcc) packing geometry just enough to cover the volume of the lattice

Imagine I have an infinite lattice of spheres packed in a face centered cubic (fcc) lattice geometry which has the basis: $((-1, -1, 0), (1, -1, 0), (0, 1, -1))$. Here, provided that sphere-sphere ...

**12**

votes

**3**answers

257 views

### Smallest containing simplex

Let $V_n$ be the least real number such that for every convex subset of $\mathbb{R}^n$ with hypervolume $1$ there is a containing simplex with hypervolume $V_n$.
What is known about $V_n$? Is there a ...

**6**

votes

**1**answer

149 views

### Existence of finite set of points in the revolving circles

Let $k$ and $n$ be two fixed integers. Let $C$ denotes the circle with radius $4n$ (in the plane $\mathbb{R}^2$). Suppose $\{C_1,C_2\}$ shows the set of two arbitrary tangent circles with radius $2n$ ...

**4**

votes

**1**answer

106 views

### Best polygonal approximation to a polynomial $\pm$ c

Let a planar region $R$ be defined
by the vertical range bounded by
a polynomial $f(x) \pm c$ with $c>0$ a constant,
and with $x$ varying between the smallest and largest
roots of $f(x)$.
For ...

**6**

votes

**5**answers

210 views

### Packing obtuse vectors in $\mathbb{R}^d$

I came across this attractive theorem:
Theorem. In $\mathbb{R}^d$, there can be at most $d+1$ vectors that
form an obtuse angle with one another.
This was proved1 as a corollary of a lemma about ...

**21**

votes

**7**answers

1k views

### What's that shape? Inferring a 3D shape from random shadows

Let $P$ be a bounded, simply connected region of $\mathbb{R}^3$.
$P$ could be a polyhedron, or a smooth shape, or an arbitrary shape;
I'll assume below that $P$ is a (non-degenerate, perhaps ...

**38**

votes

**3**answers

5k views

### Can we cover the unit square by these rectangles?

The following question was a research exercise (i.e. an open problem) in R. Graham, D.E. Knuth, and O. Patashnik, "Concrete Mathematics", 1988, chapter 1.
It is easy to show that
$$\sum_{1 \leq k } ...

**1**

vote

**1**answer

188 views

### Ask the name of a combinatorial theorem

It is a classical theorem. For given integer $n \ge 1$, among ${n\choose{n/2}} = 2^{(1-o(1)n)}$ strings in the cube $\{0, 1\}^n$ with weights $n/2$, i.e., $n/2$ indices are 1, there are at least ...

**11**

votes

**2**answers

302 views

### The most number of points that realize only $k$ distinct distances

For $k \ge 1$, let $f_d(k)$ be the largest possible number of points $p_i$
in $\mathbb{R}^d$ that determine at most $k$ distinct (Euclidean) distances,
$\|p_i-p_j\|$.
Example. For points in the plane ...

**3**

votes

**1**answer

239 views

### On Dehn's infinitesimal rigidity theorem

Dehn's theorem states that any simplicial strictly convex polyedron P in Euclidean 3-space is infinitesimally rigid (that is, any non-trivial first order deformation of P induces a variation of its ...

**4**

votes

**3**answers

531 views

### Number of Hyper-cube cuts

In how many ways a single hyperplane can cut a hypercube? Two "ways" are considered different, if the sets into which they divide vertices of the hypercube are different. So e.g. a line can cut ...

**4**

votes

**2**answers

239 views

### Breaking a rectangle into smaller rectangles with small diagonals

Say I am given a rectangle with dimensions $a \times b$ and an integer $n$. I'd like to break this rectangle into $n$ smaller rectangles $R_i$, and I'd like to make the maximum diagonal of any of ...

**3**

votes

**2**answers

162 views

### Examples of toric threefolds

I am looking for examples of smooth projective toric threefolds $\mathbb P_\Delta$ such that the rational polytope $\Delta$ has only pentagonal faces and hexagonal faces.
I quickly searched for ...

**4**

votes

**2**answers

62 views

### Expressing a convex Polytope as a sublevel set of a function

Given an n-dimensional polytope $P$ in $\mathbb R^n$, Given as a convex hull of a finite set of points, $S$ I would like to construct an expliict formula for a function $f\colon \mathbb R^n \to ...

**2**

votes

**0**answers

126 views

### Find the intersection between two convex hulls, in this specific case

We work over $\mathbb{R}^K$. Let $V$ be the set of vectors whose coordinates take values $0$ or $1$, or equivalently the corners of the unit cube $[0,1]^K$.
Let $d:\{0, \ldots, K\} \to \mathbb{R}_+$ ...

**33**

votes

**6**answers

3k views

### Is it possible to partition $\mathbb R^3$ into unit circles?

Is it possible to partition $\mathbb R^3$ into unit circles?

**8**

votes

**5**answers

752 views

### covering by spherical caps

Consider the unit sphere $\mathbb{S}^d.$ Pick now some $\alpha$ (I am thinking of $\alpha \ll 1,$ but I don't know how germane this is). The question is: how many spherical caps of angular radius ...

**2**

votes

**1**answer

81 views

### Epsilon-approximations of set systems with finite VC-dimension

ECorollary 6.9 in A Guide to NIP theories by Pierre Simon proves the following
Theorem. For every positive integer $k$ and every positive real $\varepsilon$ there is an integer $n=n(k,\epsilon)$ ...

**5**

votes

**1**answer

221 views

### Looking for reference or proof to some facts stated on Anand Pillay's book

In my current work I am using facts 2.1.11 and 2.1.12 from Anand Pillay's book Geometric Stability Theory.
The facts are stated as follows:
Fact 2.1.11. Let $(S,\mbox{cl})$ be a locally ...

**1**

vote

**1**answer

148 views

### Enumerating Lattice points

Let $A \in \mathbb{R}^{d\times d}$ be an invertible matrix. Consider the set
$$P_d := A\mathbb{Z}^d = \{A x| x \in \mathbb{Z}^d \} \subset \mathbb{R}^d$$.
and
$$ Q_d := [-1,1]^d.$$
I am interest in ...

**46**

votes

**5**answers

2k views

### Do unit quaternions at vertices of a regular 4-simplex, one being 1, generate a free group?

Choose unit quaternions $q_0, q_1, q_2, q_3, q_4$ that form the vertices of a regular 4-simplex in the quaternions. Assume $q_0 = 1$. Let the other four generate a group via quaternion ...

**1**

vote

**0**answers

55 views

### Presentation of the Rybnikov matroid

In this well celebrated work Gregory Rybnikov exhibit an example of two arrangements with the same underlying matroid, but with fundamental groups which are not isomorphic. This is a key ...

**5**

votes

**1**answer

138 views

### Integer decomposition of dilated integral polytopes

For $n > 0$, let $P$ be an integral polytope, that is, the convex hull in $\mathbb{R}^n$ of points in $\mathbb{Z}^n$. Suppose that $\dim(P) = n$.
Question: Given $d > n + 2$ is it true that
$$ ...

**59**

votes

**6**answers

2k views

### Does every polyomino tile R^n for some n?

This is a question posed by Adam Chalcraft. I am posting it here because I think it deserves wider circulation, and because maybe someone already knows the answer.
A polyomino is usually defined to ...

**8**

votes

**2**answers

467 views

### When does every point in a polytope lie along a chord between its edges?

Consider the 3-simplex, or tetrahedron, in 3-space. Regardless of the positions of the vertices, every point in the simplex lies on a chord between two non-adjacent edges of the simplex. Or, ...

**6**

votes

**1**answer

435 views

### Using mirrors to make a non-convex polygon visible from a fixed interior point

Take a point $A$ inside a non-convex polygon $P$. Is it always possible to place a finite set of mirrors given by straight segments (not necessarily along the boundary of $P$, any position inside $P$ ...

**1**

vote

**3**answers

175 views

### Isometric imbedding of finite metric space into standards spaces [duplicate]

Is it true that any metric space consisting of $n$ points can be isometrically imbedded into $n-1$ dimensional Euclidean space? Hyperbolic space?
(For $n=3$ this is true.) If not, what are ...

**23**

votes

**1**answer

441 views

### Expected number of vertices of a hypercube slice — is this new/interesting?

I am a (mostly) amateur mathematician, but my education and work have featured a lot of mathematics, and recently I bumped into a mathematical problem for which I can find no references, and I am ...

**2**

votes

**0**answers

39 views

### A weaker version of Randell Isotopy Theorem

I am studying a problem in hyperplane arrangement theory related to the homotopy type of the complement manifold of a certain class of hyperplane arrangements.
In a well celebrated paper Richard ...

**15**

votes

**2**answers

643 views

### Tiling the square with rectangles of small diagonals

For a given integer $k\ge3$, tile the unit square with $k$ rectangles so that the longest of the rectangles' diagonals be as short as possible. Call such a tiling optimal. The solutions are obvious in ...

**3**

votes

**1**answer

308 views

### On distances between points on the plane

Take a set of $2n$ points in the plane and assume that no open set of diameter $1$ contains more than $n$ of these points.
Question: can we pair up the points so that the distance between the points ...

**4**

votes

**2**answers

253 views

### What are the applications of Voronoi diagrams in pure mathematics? [closed]

Voronoi diagrams have interesting mathematical properties and applications in algorithms and modeling. But what are its applications in pure mathematics? For example, what theorems can be proved using ...

**7**

votes

**1**answer

176 views

### Fractional Helly for more than one piercing

Fractional Helly Theorem says the following:
For every $0<\alpha\leq 1$ there exists $\beta = \beta(d, \alpha)$ with the following property. Let $C_1 , C_2 , ..., C_n$ be convex sets in $R^d$, $n ...

**19**

votes

**1**answer

440 views

### Update to Shephard's “Twenty Problems on Convex Polyhedra”

Forty-three years ago, Geoffrey Shephard published an influential list of open problems
on convex polyhedra.
Progress has been made on several of his problems, and perhaps some have been completely ...