**2**

votes

**1**answer

107 views

### Braid wiring diagrams and matroids

recently I started reading some articles about the presentation of the fundamental group of lines arrangements in $\mathbb{C}^{2}$ via Wiring diagrams.
I also found some relation with matroid theory. ...

**0**

votes

**0**answers

34 views

### Number of faces of polytope projecting to lower dimensional polyhedron

Denote $K=\mathrm{conv}(v_1, \ldots, v_n)\subsetneq\Bbb R^m$ to be convex set spanned by vectors $v_i\in\Bbb R^m$ with $m\leq n$ then what technique could be useful to upper bound minimum number of ...

**3**

votes

**2**answers

283 views

### How to flip one triangulation on a surface into another

Let $S$ be a compact orientable surface and $p_1,\dots, p_n\in S$ be distinct points. We consider all triangulations on $S$ with vertices $p_1,\dots, p_n$.
Is there an algorithm which takes two ...

**10**

votes

**1**answer

246 views

### Soft question: mathematics about truchet tiles

It seems that this is the first question on Truchet tiles on MO.
Shown above is a picture of a random tile, which you can see the resulting configuration is much like many membranes of cells.
I ...

**0**

votes

**0**answers

30 views

### Covering number of the range of a function

I have come across the need to know a bound on a certain curious quantity: the covering number of the range of a continuous function $f: D \rightarrow \mathbb{R}^n$, where $D \subseteq \mathbb{R}^m$. ...

**1**

vote

**0**answers

135 views

### covering high dimensional hypercube by balls

suppose we are given the $d$-dimensional hypercube $H^d$ defined as
$$
H^d:=\left\{\sum_{i=1}^d\epsilon_ie_i:\ \epsilon_i\in \{0,1\}\mbox{ for }i=1,\dots , d\right\}
$$
and $(e_i)_{i=1}^d$ the ...

**8**

votes

**1**answer

105 views

### Tilting the $d$-cube to vertically separate its vertices

Let $C_d$ be a unit edge-length cube in $d$ dimensions.
I would like to orient it ("tilt" it) so that the vertical (last) coordinates
of its $2^d$ vertices are maximally separated, in the sense
that ...

**2**

votes

**1**answer

188 views

### Given a set of 2D vertices, how to create a minimum-area polygon which contains all the given vertices?

Not sure whether this question belongs here or math.stackexchange.
You can assume that all the vertices are unique. The given vertices can be the vertices of the polygon, thus they do NOT have to be ...

**17**

votes

**1**answer

228 views

**11**

votes

**1**answer

280 views

### Are all well behaved “mean” functions on $\mathbb{R}^+$ equivalent?

Given a set $S$, a function $M: S\times S \rightarrow S$ is a mean if it satisfies the properties:
$M(a,a)=a\qquad$ (identity)
$M(a,b)=M(b,a)\qquad$ (commutativity).
and possibly
...

**2**

votes

**1**answer

71 views

### Measuring the Randomness and Statistics of Convex Polygons

How can I tell, how likely it is, that a given convex polygon with a sufficiently high number of edges is random and, if so, what kind of randomness it is (e.g. white noise)?
What is known about ...

**1**

vote

**2**answers

158 views

### Generalization of Bracketing (or one of its many equivalences)

I asked the following question on MathStackExchange, but I have not received any answers after almost 3 days. Although it may not be a research level question, I thought I could ask it here.
*"Is ...

**0**

votes

**0**answers

53 views

### Colorful version of Fisher's inequality for block designs

Is there such a thing? I am thinking of Karatheodory and Tverberg analogues here.

**3**

votes

**1**answer

75 views

### What is Known About the Complexity of Calculating Minimal Surface Polyhedra?

I am currently ruminating about ways of generalizing Minimum Spanning Trees to Minimum Spanning "Hypertrees", where the cost is associated with simplex volumes and, where certain topological ...

**1**

vote

**0**answers

47 views

### Can any Delone set be approximated by a model set?

Let $\Lambda \subset \mathbb{R}^d$ be a Delone set (uniformly discrete and relatively dense). I would like to know whether $\Lambda$ can be approximated by a model set in the Hausdorff distance.
...

**1**

vote

**0**answers

132 views

### Find m most distant points from a set of n points [closed]

I would like to find the $m$ (where $n$ $\geq$ $m$ > 1) maximally distant subset of points from a collection of $n$ $d$-dimensional points. Maximally distant means the sum of the pairwise distances ...

**6**

votes

**0**answers

174 views

### Minimal “basis” in $n$ dimensional unit cube

Let's
$$
B^n=\{\bar\alpha=(\alpha_1,\alpha_2,\ldots,\alpha_n)|\alpha_i\in \{0,1\}\};~~~~n=1,2,\ldots
$$
and let's
$$
C\subseteq B^n,
$$
$$
S(C)=\{\bar\alpha\oplus\bar\beta\ | \bar\alpha,\bar\beta\in ...

**6**

votes

**0**answers

106 views

### How big can a family of pairwise intesecting affine spaces be?

I apologize if this question might seem to be a bit too elementary.
Let $\mathbb{P}^n$ be the projective space over $k$ - an algebraically closed field of characteristic 0. Let $1\leq l\leq n-1$, and ...

**17**

votes

**0**answers

252 views

### Large almost equilateral sets in finite-dimensional Banach spaces

Question: Does there exist a function $C:~(0,1)\to
(0,\infty)$ such that for each $\varepsilon\in(0,1)$ every Banach space
$X$ of dimension $\ge C(\varepsilon)\log n$ contains an $n$-point
set ...

**4**

votes

**1**answer

197 views

### Panning for gold nuggets: a type of isoperimetric problem

Let $C$ be a unit-radius circle in the plane.
Suppose you have a total length $L$ of string available, and
your task is to connect chords of $C$ using no more
than $L$ of string to minimize the ...

**4**

votes

**1**answer

131 views

### The Universality Theorem by Mnev for uniform oriented matroids of rank 4 and higher

According to the Universality Theorem by Mnev (see below theorem 8.6.6 from [1]), for any open semialgebraic variety V there is a uniform oriented matroid of rank 3 whose realization space is stably ...

**3**

votes

**1**answer

121 views

### Three-dimensional Apollonian spirals

Given mutually (externally) tangent spheres $S_1$, $S_2$, $S_3$, $S_4$, let $S_n$ be the unique sphere externally tangent to $S_{n-1}$, $S_{n-2}$, $S_{n-3}$, and $S_{n-4}$ for $n \geq 5$.
Let ...

**8**

votes

**0**answers

126 views

### Randomly placing nonoverlapping unit cuboids

Suppose one places unit cuboids of dimension $d$ with min-corners
uniformly distributed to lie in $[0,n]^d$, but with cuboid (strict) overlap forbidden.
At some point, the region is "saturated," ...

**6**

votes

**4**answers

187 views

### Inside-out polygonal dissections

A dissection of a polygon $P$
is a partition of $P$ into a finite number of pieces, which can then be rearranged
(via planar translations and rotations) and joined (without overlap) to form a new ...

**6**

votes

**2**answers

230 views

### Counting valid coordinates

We are given a matrix $D = (d(i,j))_{1 \leq i,j \leq n}$ such that $d(x,z) \leq d(x,y) + d(y,z)$ for each $1 \leq x,y,z \leq n$. It is also known that $d(x,y) \in \mathbb{N}$ (In this question $0 \in ...

**6**

votes

**2**answers

316 views

### Are angles between points enough to decide the realizability?

Let n points in the plane be given whose coordinates we don't know.
Assume, however, that for any triple of the points we know the angle.
Question: Can we decide whether the n points are realizable ...

**7**

votes

**2**answers

381 views

### Visibility interpretation of Riemann zeta zeros on the critical line?

This is a long shot, but ...
The fraction of $\mathbb{Z}^2$ lattice points
visible from the origin
$1/\zeta(2)=6/\pi^2 \approx 61$%.
The fraction of $\mathbb{Z}^3$ lattice points visible
from the ...

**2**

votes

**1**answer

64 views

### Visibility kernels of embedded graphs

Let $G$ be a connected graph embedded in the plane with all edges straight segments.
For $\alpha \in (0,\pi)$, define an $\alpha$-path as a path in $G$ with
all turns at vertices within ...

**3**

votes

**2**answers

206 views

### A problem on chains of squares — can one find an easy combinatorial proof?

Consider the unit square $ S = [0,1] \times [0,1] $. For each $ n \in \mathbb{N} $, we can tessellate $ S $ by the collection
$$
A
= \left\{
\left[ \frac{i}{n},\frac{i + 1}{n} \right] \times
...

**3**

votes

**1**answer

94 views

### Points with pairwise integer distances in the plane

Consider $n>3$ points with pairwise integer distances in the plane! What is the relationship between these $n(n-1)/2$ integers? Do we have a theorem or result about these points? Does there exist a ...

**6**

votes

**1**answer

223 views

### Thinnest 2-fold coverings of the plane by congruent convex shapes

It is an unsolved problem to determine the "thinnest" $2$-fold covering of
the plane by disks.
The $2$-fold coverage problem by disks is to find the minimum number of congruent
(unit-radius) disks ...

**3**

votes

**2**answers

63 views

### Average vertex degree in finite Delaunay triangulations in high dimensions

In $\mathbb{R}^2$ it's known that with a "random" point configuration, the average degree of a vertex in its Delaunay triangulation is 6.
Does anyone know of a similar result in higher dimension? I ...

**8**

votes

**1**answer

331 views

### Coloring of the plane

I would like to know the minimum number k such that the plane R^2 can be coloured with k colors such that no colour contain all the possible distances. In other words, a colouring such that each color ...

**3**

votes

**0**answers

64 views

### A taut string of equilateral triangles

Let $T$ be a unit edge-length equilateral triangle composed of three cylinders each
of (small) radius $r>0$. (By "small" I mean approximately $< 0.1$.)
Think of $T$ as a physical, rigid ...

**2**

votes

**0**answers

161 views

### Dissection of a polygon into convex polygons

Problem: for a fixed integer $m\geqslant 3$ find all $n$ such that no $n$-gon can be dissected into convex $m$-gons.
I would be very grateful for any information on this problem.
Remark 1. There ...

**4**

votes

**2**answers

117 views

### (non-)existence of the aperiodic monotile

The aperiodic monotile problem asks whether there exists a single tile that every tiling made with it results non-periodic. What is known about this problem? If this tile exists, how can it be/not be? ...

**7**

votes

**1**answer

139 views

### How many maximal triangulations of a rectangle?

I posted the following question on MathStackExchange, but I didn't any answer. So please let me post it on MathOverflow.
Let $L_{m,n}\subset\mathbb R^2$ be a rectangle given by $[0,m]×[0,n]$ with ...

**29**

votes

**2**answers

570 views

### what-if.xkcd.com: stabbing (simply connected) regions on the 2-sphere with few geodesics

In the latest what-if Randall Munroe ask for the smallest number of geodesics that intersect all regions of a map. The following shows that five paths of satellites suffice to cover the 50 states of ...

**6**

votes

**2**answers

118 views

### Number of edges in linklessly embeddable graphs

Consider graphs over $n$ nodes.
What is the maximum number of edges of a linklessly embeddable graph?
A more general question is the following. Given $\mu$ what is the maximum number of edges of ...

**22**

votes

**2**answers

582 views

### Random points on the unit sphere

Suppose you have $n$ points picked uniformly at random on the surface of $\mathbb{S}^d,$ and let the volume of the convex hull of these points be $V_{n, d}.$ Clearly, $V_{n, d}$ converges to the ...

**6**

votes

**2**answers

183 views

### Pictures of the von Neumann polytope

Are there any graphic portrayals of von Neumann polytopes in low dimensions?

**6**

votes

**1**answer

339 views

### Groups and pregeometries

Definition.
For an infinite structure $\mathcal{A}$ and $cl : P(dom(\mathcal{A})) \longrightarrow P(dom(\mathcal{A}))$ , we say
that $(\mathcal{A}, cl)$ is a structure carrying an $\omega$-homogeneous ...

**2**

votes

**1**answer

105 views

### Distance from constant width bodies

EDIT As @David has observed, my conjecture was clearly wrong for $\ n:=2.\ $ Let me still give it a chance for $\ n\ge 3$.
I'll call a family $\ F\ $ of bound closed convex subsets of $\ \mathbb ...

**6**

votes

**1**answer

149 views

### Minimizing deep holes in sphere packings

What's the current state of knowledge regarding packings of spheres in $n$-space that minimize the supremum of the sizes of the holes? This notion of tightness is more rigid than asymptotic density. I ...

**5**

votes

**1**answer

122 views

### Ham sandwich theorem for discrete measures - reference request

A discrete version of the ham sandwich theorem states as follows (see for instance "Common Hyperplane Medians for Random Vectors" - Hill):
For every $\mu_1,...,\mu_n$ discrete (i.e., purely atomic) ...

**3**

votes

**1**answer

94 views

### Covering points with a shortest lattice spiral

Let $S$ be a finite set of lattice points in $\mathbb{Z}^2$.
My question is, roughly:
Q. How can a shortest lattice spiral that passes through
every point of $S$ be found?
A lattice spiral (my ...

**9**

votes

**1**answer

231 views

### A random variation on Polya's orchard problem

Polya's orchard problem is as follows:
"How thick must the
trunks of the trees in a regularly spaced circular orchard grow if they are
to block completely the view from the center?"
See, ...

**19**

votes

**5**answers

1k views

### What arrangement of unit cubes minimizes surface area?

For each of these two questions, one can assume that the arrangements are polycubes (for which a definition can be found in the excerpt-image below).
Question A. How does one arrange $n$ unit cubes ...

**3**

votes

**5**answers

258 views

### Approaching convex and discrete geometry from other disciplines

I would like to learn some convex and discrete geometry (number 52 in MSC2010). I thought that it would be interesting to approach it from some other parts of mathematics - either by learning ...

**0**

votes

**0**answers

116 views

### “Open Points” in the 1983 proof of Szemerédi-Trotter theorem

I was reading through the 1983 paper "Extremal Problems in Discrete Geometry" and I was confused about the definition of "open point" appearing in this paper. By this point in the paper, the authors ...