Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.

learn more… | top users | synonyms (1)

0
votes
0answers
100 views

Construction of Penrose Tiling (P3) from Wieringa Roof [on hold]

I am trying to find sources detailing the construction of the Wieringa* Roof with the purpose of projecting the roof onto the plane and generating a Penrose Tiling (P3). The method can be seen in ...
1
vote
0answers
41 views

Modeling bubble rafts

If you go to images.google.com and search on "bubble rafts", you'll see various pictures of disk packings that in large patches look like the six-around-one dense packing of the plane by equal-sized ...
9
votes
1answer
132 views

Optimal shape for stabbing balls in $\mathbb{R}^3$

I have radius $r < \frac{1}{2}$ congruent balls with centers randomly distributed uniformly within a region, say, within a unit-radius sphere $S$. I shoot a ray/path through $S$, hoping to ...
2
votes
0answers
67 views

Infinite counter-examples to Borsuk conjecture

When I formulate the Borsuk conjecture in the form of a coloring problem, Aigner told me that the formulation is not quite correct: It only works if the set is finite. He's right. All the ...
13
votes
1answer
327 views

Is the Ford disk packing optimal?

Given two unit-diameter disks tangent to a given line and to each other, determining a region bounded by two circular arcs and a line segment, is the Ford disk packing of that region the unique ...
7
votes
0answers
77 views

Points on $k$ Circles

Let $k$ be a fixed positive integer. We want to find the minimum number $f(k)$, such that for a set of finite points in the plane, if any $f(k)$ of them are on $k$ circles, then all of them are on $k$ ...
12
votes
0answers
238 views

Grothendieck on polyhedra over finite fields

In Grothendieck's Sketch of a Programme he spends a few pages discussing polyhedra over arbitrary rings and concludes with some intriguing remarks on specializing polyhedra over their "most singular ...
1
vote
0answers
63 views

degenerate abelian surfaces

I am wondering if the family of degenerate abelian surfaces constructed by K. Hulek, C. Kahn and S.H. Weintraub in "Moduli spaces of Abelian Surfaces: Compactification, Degenarations, and Theta ...
3
votes
1answer
122 views

Packing bounds for sumsets, or, very discrete balls

Let $D\subset \mathbb{F}_2^n$ with $D=-D$ and $0\in D$. Write $k D$ for the set of all sums of $k$ (not necessarily distinct) elements of $D$. (This is the "ball" in the title.) Now let $d(g,h)$ be ...
1
vote
0answers
72 views

An exact fraction of a matrix

Let $A$ be a $n \times m$ real matrix with $n<<m$ and of rank $r<n$. It is known that $A$ has exactly two distinct non-zero singular values: $\sigma_{\max}$ and $\sigma_{2}$, and also that ...
1
vote
1answer
63 views

Complex lines arrangements from a given wiring diagram

I'm working on some presentation of the fundamental group of the complement of a complex lines arrangement in $\mathbb{C}^{2}.$ In particular, in Arvola's article "The fundamental group of the ...
6
votes
2answers
152 views

Geometric dominating set: NP-complete?

Let $G=(V,E)$ be a geometric graph, a graph embedded in the plane whose edge lengths are the Euclidean distance between its endpoint vertices. Say that a set of vertices $D \subseteq V$ is a geometric ...
4
votes
0answers
77 views

Can we replace 2-fold cover by n rectangles with 1-fold cover by n rectangles?

Suppose that $n$ rectangles cover every point of their union exactly twice (except for points on their boundaries). Can we partition this union into at most $n$ rectangles? I think it's pretty ...
3
votes
1answer
126 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
0answers
40 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
2answers
297 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
1answer
265 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
0answers
32 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
0answers
141 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
1answer
107 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
1answer
201 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 ...
11
votes
1answer
281 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
1answer
73 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
2answers
162 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
0answers
55 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
1answer
78 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
0answers
50 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
0answers
143 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
0answers
176 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
0answers
107 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
0answers
259 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
1answer
199 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
1answer
137 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
1answer
125 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
0answers
127 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
4answers
190 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
2answers
231 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
2answers
318 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
2answers
383 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
1answer
65 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
2answers
211 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
1answer
98 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
1answer
228 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
2answers
74 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
1answer
335 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
0answers
65 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
0answers
170 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
2answers
118 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
1answer
142 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 ...