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

learn more… | top users | synonyms (1)

1
vote
1answer
154 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 ...
0
votes
0answers
46 views

Hexagonal lattice in a disk when the distance between points is $R_l$ [on hold]

Consider a hexagonal tiling of a 2D plane where hexagons are of identical size and of radius $R_l$. I assume we can say that the vertices together with the center of each hexagon form an integer ...
0
votes
0answers
25 views

upper bound and a lower bound on the number of points that are uniformly distributed on a surface [migrated]

Can I calculate an upper bound and a lower bound (or max or min) on the number of points that are uniformly distributed on a surface, knowing the area of the surface ? More precisely, I have a sector ...
11
votes
2answers
274 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
2answers
154 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
2answers
57 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
0answers
117 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}_+$ ...
2
votes
1answer
72 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)$ ...
1
vote
1answer
150 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. ...
5
votes
1answer
200 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
1answer
138 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 ...
1
vote
0answers
50 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 ...
1
vote
3answers
163 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
1answer
429 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
0answers
38 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 ...
4
votes
2answers
229 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 ...
4
votes
2answers
239 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 ...
6
votes
1answer
197 views

Convex Polyhedra Scissors Congruence Problem

I am currently writing a geometry paper "Rectifications of Convex Polyhedra" and I am confused to have discovered what appears to be a remarkable discrete geometric fact: Conjecture: Let $P$ be a ...
3
votes
2answers
222 views

Isoperimetric inequality on the Hamming cube

Suppose $X \subseteq \lbrace 0 , 1 \rbrace ^{m}$ such that $|X| \geq 2^{0.8m}$, and $m \geq 2$, then prove that there exists $x,y \in X$ with $||x - y||_{1} \geq m/2$. My approach to prove this was ...
19
votes
1answer
293 views

Maximum height of intersection of triangles

I'd like some advice regarding the following question, which I have been struggling with for long time. Let's call the shaded region in the below $S_3$. It is the union of three congruent isosceles ...
8
votes
1answer
308 views

Orthonormal bases of R^3 with components lying in the golden field

Greg Egan proved an interesting theorem about unit vectors in $\mathbb{R}^3$ whose components actually lie in the 'golden field' $\mathbb{Q}[\sqrt{5}]$. He found it in our studies of twin ...
46
votes
5answers
1k 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 ...
5
votes
1answer
129 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 $$ ...
1
vote
0answers
32 views

Lattice-isotopic essentialization of arrangements

I'm working on a problem related to $\textbf{Randell's isotopy theorem}$ for complex hyperplane arrangements. I have a question which seems quite obvious. However, I haven't found a rigorous proof ...
3
votes
1answer
135 views

An upper bound on the number of sets of parallel lines covering points in a finite plane?

Let $\mathbb{F}$ be a finite field of characteristic $2$. Let $L_m$ denote the set of lines in $\mathbb{F}^2$ with slope $m\in\mathbb{F}$, that is, all parallel lines of the form $y=mx+b$. Consider a ...
10
votes
0answers
139 views

Self-avoiding random walks that always turn

I am wondering if the statistics of self-avoiding random lattice-walks on $\mathbb{Z}^2$ that turn left or right at each step (i.e., they cannot continue the direction of the preceding step) have been ...
25
votes
0answers
588 views

3-colorings of the unit distance graph of $\Bbb R^3$

Let $\Gamma$ be the unit distance graph of $\Bbb R^3$: points $(x,y)$ form an edge if $|x,y|=1$. Let $(A,B,C,D)$ be a unit side rhombus in the plane, with a transcendental diagonal, e.g. $A = ...
4
votes
0answers
73 views

How many subspaces are generated by three or more subspaces in a Hilbert space?

In the book of G. D. Birkhoff "lattice theory", it is mentioned that there are 28 subspaces that can be obtained from three subspaces in general position in a Hilbert space (using intersections and ...
1
vote
1answer
124 views

Chern classes of three (two) dimensional complex vector bundles

Let $M$ be a manifold. Let $F(M,3)=\{(m_1,m_2,m_3)\mid m_1, m_2, m_3\in M, m_i\neq m_j, \text{ for any } i\neq j\}$. Let $S_3$ be the symmetric group of order $3$. Let $S_3$ act on $F(M,3)$ by ...
8
votes
1answer
79 views

A variant of Nelson-Hadwiger Problem on the chromatic number of the plane

The famous Nelson-Hadwiger problem asks about the chromatic number of the graph $G$, with the vertex set $V(G)={\mathbb R}^2$ where $a_1=(x_1,y_1), a_2=(x_2,y_2) \in V(G) \ $ form an edge iff ...
3
votes
2answers
489 views

What's the name of this geometric mathematical modeling problem?

There is a right angle corner with width 1 in both directions. One wants to find the largest area shape which can pass through this corner. I know that this is a famous problem, but what is it called? ...
2
votes
0answers
83 views

Computing Voronoi poles in $\mathbb{R}^d$ (the farthest points within each cell)

Say I have a Voronoi diagram of some points $p_1,\dots,p_n\in\mathbb{R}^d$, which tesselates $\mathbb{R}^d$ into cells $V_1,\dots,V_n$. Within each cell $V_i$, the pole is defined as the vertex of ...
5
votes
1answer
128 views

Upperbounding the number of regions induced by a set of unit disks

Given a set $D$ of $n$ same radius disks, embedded in the plane, their arrangement induces a number $k$ of connected regions in $\mathbb{R}^2 \setminus \cup_{d \in D}$ . I am interested in an upper ...
1
vote
1answer
35 views

number of affine pieces of linear interpolation of convex functions in high dimension

Consider a convex function $f$ defined on a $d$-dimensional hypercube $[0,1]^d$. Now for fixed $m \in \mathbb{N}$, consider the grids $\mathcal{G}_m=\{(i_1/m,\cdots,i_d/m)\}$ where ...
3
votes
3answers
327 views

Aperiodic graphs

The concepts of being non-periodic and aperiodic for tilings have obvious versions for connected graphs with a countable set of vertices and a finite number of edges meeting at each vertex. A graph ...
3
votes
1answer
290 views

Balancing real numbers in one dimension

Given numbers $0 \leq d_i \leq 1$ for $i=1,\ldots,m$, it is easy to see that you can always find signs $\varepsilon_i \in \{-1,1\}$ such that the partial sums $\sum_{i=1}^k \varepsilon_i d_i/2$, for ...
3
votes
2answers
128 views

regular polyhedra (and polytopes) in hyperbolic geometry, and generalisations

While there exist regular tesselations of the hyperbolic plane with arbitrary regular polygons, there are no new regular polyhedra in hyperbolic (3D) space. This being quite trivial, it is probably ...
9
votes
0answers
230 views

Neighborly family of coins

Here is a puzzle: Find 5 identical coins. Can you arrange them so that every coin is touching every other coin? The solution is here. The hint is: use the third dimension. My questions are ...
3
votes
0answers
87 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
147 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 ...
3
votes
0answers
77 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
346 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
85 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
263 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 ...
2
votes
0answers
72 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
147 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
75 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 ...
2
votes
1answer
86 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
196 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
82 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 ...