All Questions
Tagged with discrete-geometry reference-request
174 questions
4
votes
2
answers
173
views
4-polytopes with only one kind of regular facet
Is there a neat way to show (or a reference that already proves) that
the 4-cube is the only convex 4-polytope in which all facets are regular 3-cubes?
the 24-cell is the only convex 4-polytope in ...
- 13.6k
9
votes
1
answer
460
views
Connections between linear representations and permutation representations
A finite group $\Gamma$ might be represented by a linear transformation
$$\rho : \Gamma\to\mathrm{GL}(\Bbb R^d),$$
or by permutations
$$\phi :\Gamma\to\mathrm{Sym}(n).$$
Of course, latter ones can ...
- 13.6k
2
votes
0
answers
87
views
A theory of (or reference for) symmetric point arrangements
I wonder where I can find something written on symmetric point arrangements (see definition below). I am interested in general references, preferably books that introduce (or papers that use) some ...
- 13.6k
1
vote
1
answer
393
views
Hyperbolic embedding of a directed acyclic graph defined over strings
For integer $n$ and alphabet $\Sigma$ we construct a DAG (directed acyclic graph) $G=(V,E)$ over strings $s\in\Sigma^\star$ as follows:
$$V = \{s\in\Sigma^\star\colon |s|\le n\}$$
$$E = \{(s_1,s_2)\...
- 187
9
votes
2
answers
505
views
Moore graphs and finite projective geometry
In a comment on a blog post from 2009 about the hypothetical Moore graph(s) of degree 57 and girth 5, Gordon Royle offered the following observation (reproduced here in full for the sake of ...
- 1,645
1
vote
0
answers
69
views
Can sufficiently symmetric polytopes be uniquely reconstructed from their 1-skeleton?
General convex polytopes can not be uniquely reconstructed from their 1-skeleton1, as explained here. Not even the dimension is known from the skeleton, as e.g. the complete graph $K_n,n\ge 5$ is the ...
- 13.6k
25
votes
1
answer
3k
views
Number of hypercube unfoldings
While writing the code for this answer, I noticed that I not only could calculate the number of unfoldings of the $4$-cube, but also the number of the $n$-cube for more values of $n$. Basically, we ...
- 10.7k
4
votes
2
answers
349
views
How many dihedral angles need to be specified to uniquely specify a triangulated polyhedron?
Suppose you are given a simplicial complex $K$ homeomorphic to the sphere and for each each edge of the complex a label specifying a length of that edge (this gives us a polyhedral metric on $K$). In ...
- 185
24
votes
0
answers
760
views
How much of the plane is 4-colorable?
In 1981, Falconer proved that the measurable chromatic number of the plane is at least 5. That is, there are no measurable sets $A_1,A_2,A_3,A_4\subseteq\mathbb{R}^2$, each avoiding unit distances, ...
- 7,633
1
vote
0
answers
278
views
Sphere packings with antipodal (unequal) spheres
Let $\|\cdot\|_2$ denote the Euclidean norm, let $\langle \cdot, \cdot\rangle$ denote the standard dot product, and let $\mathcal{S}^{d-1} = \{\mathbf{x} \in \mathbb{R}^d: \|\mathbf{x}\|_2 = 1\}$ ...
- 733
7
votes
3
answers
550
views
Minkowski's theorem for non-0-symmetric sets
Let $\Lambda \subseteq \mathbb{R}^n$ be a full-rank lattice, i.e. $\Lambda = A \mathbb{Z}^n$ for some $A \in \mathrm{GL}_n (\mathbb{R})$, and let $C \subseteq \mathbb{R}^n$ be a $0$-symmetric convex ...
user92170
17
votes
5
answers
883
views
Rigidity of convex polyhedrons in $\mathbb R^3$ with faces removed
Take a convex polyhedron $P$ in $\mathbb R^3$ and remove all the faces, i.e. leave only the edges. Call this graph $E$. Let us now try to continuously deform $E$ in $\mathbb R^3$ so that all the edges ...
- 14.3k
3
votes
1
answer
176
views
Toric Desingularization Algorithms
There are certainly many algorithms to desingularize toric varieties (e.g https://arxiv.org/pdf/math/0411340.pdf). I would imagine in analogy with desingularizing surfaces these all involve blowing up ...
- 528
4
votes
0
answers
153
views
Perimeters of nested convex spherical polygons
I seek a reference—not a proof—that if $P_1$ and $P_2$
are two convex polygons on a sphere composed of geodesic segments,
contained in a hemisphere, and
$P_1 \subseteq P_2$, then the ...
- 151k
10
votes
2
answers
280
views
Monochromatic point sets in two-colored plane
Which are the configrations $P\subset \mathbb{R}^2$ of points, such that the following property holds:
Property M (for Monochromatic): Every two-coloring of $\mathbb{R}^2$ contains a monochromatic ...
- 10.7k
6
votes
2
answers
364
views
Triangles whose vertices and center have all the same color
A plane is colored with two colors. It's an easy exercise to prove that it's always possible to find an equilateral triangle whose vertices have all the same color.
Does anyone know any proof or ...
- 3,153
3
votes
1
answer
159
views
Work on "Churning Polygons"
Background of this question is that I recently stumbled over the problem of deforming polygons in area-preserving way, i.e. modifying the angles between adjacent edges while preserving edge-lengths, ...
- 13.2k
3
votes
3
answers
330
views
Voronoi and Delaunay
Please provide some references on Voronoi and Delaunay decompositions which is mathematically written. I mean I can find several texts or links on this written for computer science students without ...
user111251
4
votes
0
answers
213
views
Counting the polytopes of the translates of the resonance hyperplane arrangement inside the unit hypercube
Let $n$ be a positive natural number. For all $\emptyset \subset S \subseteq \{1, \ldots, n\}$ and $k \in \mathbb{Z}$, define the hyperplane $H(S,k)$ in $\mathbb{R}^n$ given by the equations
$$H(S,k):=...
- 283
17
votes
3
answers
2k
views
Applications of Kirchhoff's circuit laws to graph theory
Is there a good survey on applications of Kirchhoff's circuit laws to graph theory or/and discrete geometry?
Examples:
Matrix tree theorem,
Squaring the square,
Electrician’s proof of Euler’s ...
- 45k
5
votes
1
answer
265
views
Maximal number of triple intersection points of $n$ circles
It is easy to show that $n$ (mutually different) circles on the plane can have maximum $n(n-1)$ intersection points. In our optimal graph drawing research we have encountered a counterpart of this ...
- 5,409
7
votes
0
answers
187
views
distance distributions on a hypersphere?
Fix a real number $0\leq t\leq 1$ and an integer $n>1$. Let
$\mathbb{S}^{n-1}\subset\mathbb{R}^n$ denote the unit hypersphere. Define
$$d_N(n;t):=\max\sum_{i<j}\Vert P_i-P_j\Vert_2^t$$
where ...
- 43.2k
4
votes
0
answers
164
views
Two variants of the Littlewood-Offord theorem
I found two different looking things being called the Littlewood-Offord theorem,
If $\vec{a} \in \mathbb{R}^k \setminus 0$ and $t \in \mathbb{R}$ then there are $O(\frac{2^k}{\sqrt{k}})$ points $x \...
- 2,246
6
votes
2
answers
424
views
A class of tilings with amazing visual qualities
For more examples please see my related question on MSE:
Interesting tiling with a lot of symmetrical shapes
This is achieved by rotation of square grid over itself by atan(3/4).
Resulting ...
- 161
4
votes
1
answer
493
views
Counting number of points on a lattice in a hypercube
Suppose I have a lattice $\Lambda \in \mathbb{R}^n$. Let $X_i >0$ for $i=1,..,n$. I am interested in some references regarding counting number of points of $\Lambda$ inside $[-X_1, X_1] \times \...
- 3,625
4
votes
2
answers
425
views
Algorithm for Reconstructing Point Sites from a Voronoi Diagram
how can one construct a finite set of points in the euclidean plane from its Voronoi Diagram and, what is the complexity of the problem?
- 13.2k
4
votes
1
answer
365
views
Orchard-planting problem in space
The original orchard-planting problem asks for the maximum number of $3$-point lines attainable by a configuration of points in the plane. I am interested in its natural generalization for (three-...
- 5,409
1
vote
0
answers
71
views
Name for a Specific Planar Linear Transformation
Is there a name for linear transformations of the plane, that make $4$ points in general convex configuration co-circular, with the biggest circle through those points and, how can they be determined ...
- 13.2k
2
votes
1
answer
242
views
Smallest angle among two lines in an n × n grid
Does anybody have a reference answering the following (at least for me surprisingly non trivial) question?
Given an $n \times n$ integer grid, what is the minimum angle between any two distinct lines,...
- 239
4
votes
2
answers
207
views
Classification of symmetries of tilings in surfaces?
Is there a general study of the symmetries of tilings on surfaces?
Conway, Goodman-Strauss & Burgiel classified them on $\mathbb S^2, \mathbb R^2$ and $\mathbb H^2$, with their 'Magic Theorem'. ...
- 561
4
votes
0
answers
143
views
Balanced partitions of vector sets
We are interested in the following
Lemma. Let $V\subset [0,1]^n\subset\mathbb R^n$ be a set of $n$-dimensional vectors. Then for each $r\le |V|$ there exists a partition $$V=V_1\cup V_2\cup\dots \cup ...
- 5,409
5
votes
2
answers
342
views
Minimum length of a convex lattice polygon containing k lattice points?
Let $f(k)$ denote the minimum length of a convex lattice polygon containing exactly $k$ lattice points (including lattice points on the boundary).
It is not too hard to show that $k = \frac{1}{4\pi} ...
- 191
1
vote
0
answers
39
views
Homology of the subcomplexes of the "diamond shaped" sphere under 1-norm in $R^n$ as a simplicial complex
The 1-norm on $\mathbb{R}^n$ is defined by $\|v\| = |v_1| + |v_2| + \cdots + |v_n|$ for a vector $v = (v_1, \ldots, v_n) \in \mathbb R^n$.
The unit sphere $S^{n-1}_1$ under the 1-norm is a simplicial ...
- 459
4
votes
0
answers
158
views
Reference for the notion of polyhedra "degenerations"
Let $P$ be a convex polyhedron and let $P(t)$ be a continuous deformation thereof, such that:
a) $P(0)=P$;
b) for all $t\in[0;1)$ the polyhedron $P(t)$ is strongly combinatorially equivalent to $P$ (...
- 3,513
1
vote
0
answers
77
views
Non-adjacent Pair of Edges with Minimal Weight Sum
Given an weighted, undirected Graph $G(V,E)$ without loops or parallel edges,
what is the complexity of determining a pair of non-adjacent edges, whose sum of weights is w.l.o.g. minimal?
is that ...
- 13.2k
6
votes
0
answers
118
views
Convex hull of all-ones principal submatrices
For a subset $S$ of $\{1,\ldots,n\}$,
let $\mathbf{1}_S\in\{0,1\}^n$ denote the indicator vector of $S$, with a $1$ on the $i$th coordinate iff $i\in S$. Let $\mathcal{X}$ denote the convex-hull of ...
- 617
21
votes
2
answers
1k
views
On convergence of convex bodies
Let $K\subset \mathbb{R}^n$ be a compact convex set of full dimension. Assume that $0\in \partial K$.
Question 1. Is it true that there exists $\varepsilon_0>0$ such that for any $0<\...
- 21.8k
3
votes
1
answer
191
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 ...
- 21.8k
7
votes
1
answer
216
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,350
26
votes
7
answers
3k
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 non-...
- 151k
3
votes
2
answers
261
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 ...
- 441
3
votes
0
answers
169
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 $...
- 41
5
votes
1
answer
161
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 ...
- 53
22
votes
1
answer
970
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 ...
- 528
6
votes
2
answers
400
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 ...
- 151k
1
vote
0
answers
70
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$. ...
- 183
9
votes
3
answers
1k
views
Generalization of Sylvester-Gallai theorem
The Sylvester-Gallai theorem states that it is not possible to arrange a finite number
of points so that a line through every two of them passes through a
third unless they are all on a single ...
5
votes
1
answer
245
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 ...
- 13.2k
8
votes
4
answers
530
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 ...
- 151k
11
votes
1
answer
406
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 ...
- 151k