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

learn more… | top users | synonyms (1)

2
votes
2answers
319 views

Practical use of estimates for the Gauss Circle Problem

This question is related to this and this ones. The Gauss Circle problem asks for the number $N(r)$ of integer points within a sphere of radius $r$ centered at the origin. It is well known that $N(r) ...
7
votes
1answer
94 views

Dropping altitudes to achieve nonobtuse planar triangulations: finite or infinite?

Given a planar triangulation of (say) a convex region, imagine the following process to convert it to a triangulation with no obtuse angles: Pick an arbitrary obtuse angle at vertex $a$ of ...
1
vote
1answer
147 views

Is there a “Bipartite” Szemeredi-Trotter theorem?

One version of the Szemeredi-Trotter theorem states the following: Given a set of $L$ lines in the plane, the number of points incident to at least $k$ lines is bounded above by a constant times $L/k ...
2
votes
2answers
111 views

Maximum possible number of similar three-colored triangles

I want to maximize the number of similar triangles with vertices from three fixed sets, one vertex from each set. For example, if you fix two points $X$, $Y$ (i.e. two sets with only one member), then ...
2
votes
1answer
68 views

Characterization of the medial axis of a surface

I would like to know if the following "characterization" of the medial axis of a surface is correct, and if so, how to prove it. Let $S$ be a continuous, piecewise smooth, compact surface embedded in ...
5
votes
2answers
234 views

Put P inside Q! polygons/polyhedra

We have two Polygons/Polyhedra P and Q. Does there exist a polynomial time algorithm to decide if we can put P (using translation and rotation) inside Q or not? First think about the case of which P ...
10
votes
2answers
498 views

Cut and Fold Polyhedron!

I have two convex polyhedra such that their sums of side areas are equal. It is true that I can cut one of them and flatten it on the plane, then fold the flattened polygon to reach the other ...
5
votes
1answer
204 views

Small remarkable matroids

Working on phased matroids (a generalization of oriented matroid to the complex case) I've found an interesting formula for computing the inner Tutte group (and, hence, all the Tutte groups) ...
2
votes
0answers
44 views

Looking for N-dimensional spheres in the configuration space of the colorful Tverberg problem

Here we use standard notation for Tverberg's theorem: Dimension $d$, number of partition blocks $r$, and $N=(r-1)(d+1)$. The configuration space of Tverberg's theorem is the simplicial complex ...
2
votes
1answer
125 views

Regarding the set up of a geometry of numbers lemma

I have a question related to geometry of numbers, which although seems quite basic, I was rather confused by it so I decided to ask here. Let $\Lambda$ be a lattice in $\mathbb{R}^n$. Let $R_1, ..., ...
1
vote
0answers
32 views

Moment lemma for circular arc polygons

A "moment lemma" originally due to Fejes Tóth (I guess) states that if $P$ is any polygon (in $\mathbb{R}^2$) with $k$ sides, then for any $\mathbf{y}$, we have ...
1
vote
0answers
34 views

Generalizing Concepts of Planar Euclidean Geometry to Symmetric TSP-Instances

To me it seems possible, to successfully look at symmetric TSP instances from a geometry-point of view. Examples are: the diagonals of the convex hull of a set of points in the euclidean plane; ...
2
votes
1answer
138 views

intersection of the unit cube and a hyperplane containing the main diagonal

Let $A$ be a linear $m$-dimensional subspace of $\mathbf{R}^n$ $m < n$, containing the point $(1,1,\ldots,1) \in \mathbf{R}^n$, and consider the intersection of $A$ and the unit cube $\Delta_n$ ...
4
votes
1answer
132 views

The number of facets of a polyhedron under linear transformation

Consider a (not necessarily bounded) convex polyhedron $P\subset \mathbb{R}^n$ which has $k$ facets. Let $L:\mathbb{R}^n \to \mathbb{R}^m$ be a linear transformation. Question1: Is there a fixed ...
5
votes
1answer
400 views

Linear transformation of a polyhedron

Is there a simple proof that shows: Linear transformation of a $\mathcal{H}$-polyhedron (i.e. the intersection of finitely many closed half-spaces) is a $\mathcal{H}$-polyhedron. Minkowski sum of ...
0
votes
0answers
68 views

Toric morphism fiber and kernel dimensions

Given a morphism between two smooth toric varieties $f: X \rightarrow Y$, is the dimension of the kernel of $\mathrm{d}f$ at any point $p \in X$ equal to the dimension of the fiber at $f(p) \in Y$? ...
12
votes
2answers
308 views

When does a set of collinearity conditions imply collinearity of all of the points?

Suppose we have a set of $n$ points $\{X_1,X_2,\dots,X_n\}$ in the real plane and $\mathcal{A}$ a family of subsets of $\{1,\dots,n\}$. By a "set of collinearity conditions for $\mathcal{A}$" we mean ...
8
votes
1answer
422 views

Polyhedron not circumscribed about a sphere

Let $P$ be a polyhedron whose faces are colored black and white so that there are more black faces and no two black faces are adjacent. Show that $P$ is not circumscribed about a sphere. My teacher ...
16
votes
1answer
439 views

Longest of random worm-like paths in $\mathbb{Z}^2$

Imagine at each lattice point of $\mathbb{Z}^2$ within $[1,3n]^2$, with coordinates $\equiv 2 \bmod 3$, we place, with equal probability, one of these six patterns:       The result ...
0
votes
0answers
50 views

Paths on Cartesian products of graphs satisfying linear constraints

Assume integers $d > r > 0$ and a connected graph $G$ with $d$ vertices. Every point on the $r$-fold Cartesian product of $G$ with itself, $G^{\square r}$, is equivalent to a dimension-$d$ ...
5
votes
2answers
141 views

Discrete gradient on point clouds

I am interested to know some ways to approximate discrete gradient if you have a function on point clouds in 2D or 3D. If you have a function defined on a grid, it well known that you can use a ...
1
vote
1answer
176 views

Positroids and Totally Nonnegative Complex Grassmanian

Recently I begin working on matroids, in particular to a generalization of oriented matroids to the complex case. I found on arxiv the following interesting articles: 1)Alexander Postnikov: Total ...
6
votes
1answer
138 views

Hiding $k$ disks inside a larger disk

Suppose one has $k$ unit-radius disks, and the goal is to hide them inside a disk of radius $R \gg k$. The detection probes are rays along a line. (Think of the disks as tumor cells, and the rays as ...
4
votes
1answer
178 views

Light inside a polyhedron

I have two questions the same as Mostafa's Question: Visibility of vertices in polyhedra Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ ...
20
votes
3answers
810 views

Visibility of vertices in polyhedra

Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ is an interior point of $P$. Is it true that $X$ can see at least one vertex of $P$? More ...
8
votes
1answer
240 views

Billiard dynamics with angle of reflection a fraction of angle of incidence

Suppose that a billiard ball bouncing in a unit square (or a lightray reflecting in a mirrored square) has the property that the angle of reflection is a fraction of the angle of incidence, rather ...
9
votes
1answer
338 views

Are there irregular tilings by L-polyominoes?

I wonder if one can tile the plane with an order-$n$ L-polyomino in a fundamentally irregular manner. I seek help in defining what should constitute "irregular." An L-polyomino of order $n \ge 2$ is ...
2
votes
1answer
86 views

mean length of the non-crossing graphs on n points

My original question is rather vague so I'll start with a precise example and then indicate possible generalisations. Given a n-tuple $x=(x_1,\dots,x_n)$ in, say, a square with side-length $1$ in the ...
3
votes
1answer
104 views

Polygonal Venn diagrams

Suppose that the interiors of $n$ $m$-sided planar simple closed polygons generate a $\sigma$-algebra $A$. How many atoms can $A$ possess, at the most? Failing an exact answer, how about good ...
1
vote
0answers
54 views

Approximating Unit covering of d-dimensional points

Given a $d$-dimensional disk of radius $2$ in $\mathbb{R}^d$, how many disks of radius $1$ suffice to cover it. Of course, it's fine if the smaller disks overlap. What matters is to specify a finite ...
7
votes
2answers
140 views

Uniqueness of an equilateral triangle decomposition into three similar polygons, exactly two congruent

A favorite fun problem I give to students and (even non-mathematical) friends is the following: Find a decomposition of an equilateral triangle into three similar polygons, exactly two of which are ...
1
vote
1answer
73 views

Unit covering of $d$-dimensional points

Given a set of points in $X$ axis, we want to cover them with minimum number of unit intervals. For this problem we can assume that each interval in the optimal solution is starting or ending in one ...
2
votes
1answer
106 views

Bound on maximum distance between points on a unit N-Sphere

I want to select M points on the N-sphere such that $min_{i\neq j,i,j\in \{1..M\}} ||x_i - x_j||$ is maximized. Are there good upper bounds for this max-min distance?
7
votes
2answers
275 views

Wait time to grid network disconnection with failing edges

Let $G_n$ be an $n \times n$ planar toroidal grid graph, with each node connected to its four neighbors, with the top row connected to the bottom, and the right column connected to the left. Suppose ...
2
votes
1answer
121 views

The Mahler conjecture and non-zonoidal 3-polytopes (4-polytopes)

I have been working on the Mahler conjecture for over a year now and have made some progress for certain classes of convex polytopes and I'm now attempting to write up my results specified to ...
5
votes
1answer
317 views

A result from Peter McMullen's thesis

The classical definition of regular polytopes is recursive. It says that a polytope is regular if its facets and vertex figures (both smaller-dimensional polytopes) are regular. The modern definition ...
14
votes
0answers
288 views

Knight's tours in higher dimensions

I wonder if Knight's Tours have been explored in higher dimensions, using the following definition of a knight move. In dimension $d=2$, the knight moves left/right and forward/back one step and two ...
1
vote
1answer
35 views

Maximum crossings of curvature-constrained curve

Let $C$ be a curve in the plane whose curvature is everywhere $\le 1$. If $C$ has length $L$, what is the largest number of proper self-crossings of $C$ as a function of $L$? For example, the curve ...
1
vote
1answer
136 views

Calculate the discrete set of points B which are in the convex hull of the set of points A

This problem is likely best described with the following picture: Given the discrete set of points $A$ (shown in blue), I wish to calculate the discrete set of points that are contained within the ...
12
votes
3answers
606 views

Is {6,3,7} an 'ultrahyperbolic' Coxeter group?

These pictures, drawn by Roice Nelson, are attempts to visualize a geometry having as symmetries the {6,3,7} Coxeter group, by which I mean the one coming from the Coxeter diagram ...
3
votes
3answers
98 views

Minimal area of non-planar lattice curves

Consider a $\mathbb{Z}^d$ lattice whose edges connect nearest-neighbor sites only, i.e. a $d$-dimensional hypercubic grid. Let $C$ be a closed curve along such edges. In general, for $d>2$ such ...
28
votes
1answer
946 views

Can we find lattice polyhedra with faces of area 1,2,3,…?

I asked this question two months ago on MSE, where it earned the rare Tumbleweed badge for garnering zero votes, zero answers, and 25 views over 61 days. Perhaps justifiably so! Here I repeat it with ...
1
vote
0answers
85 views

What is the projective dual of a planar graph?

Everybody learns the usual definition of the dual of a planar graph when edges are preserved and faces are mapped to vertices. Everybody learns the projective duality. What if we apply it to a ...
6
votes
1answer
336 views

Triangle (constrained number, rather than shape) packing?

Are there any interesting results on optimal packings in the plane using a fixed number of triangles (without a fixed size or shape constraint)? For instance, what's the maximum area packing of the ...
6
votes
1answer
164 views

Integral straight-line embeddings of planar graphs

Wikipedia says (in the article on Fáry's theorem), "Heiko Harborth raised the question of whether every planar graph has a straight line representation in which all edge lengths are integers. The ...
1
vote
0answers
49 views

Euclidean embedding of a graph based on 1-ring neighborhood distances only

Consider a graph $(V,E)$, $\vert V \vert = n$ and weights $\{l_{ij}\}$, where $l_{ij}>0$ iff there is an edge connecting vertices $v_i$ and $v_j$. Distances beyond the 1-ring neighborhood are not ...
4
votes
2answers
135 views

Computational complexity of deciding isomorphism of rational polyhedral cones

Let $C,C'$ be rational polyhedral cones in $\mathbb R^n$ both with non-empty interior. Rational means they are generated by vectors with rational entries. One says that $C,C'$ are isomorphic if there ...
2
votes
1answer
114 views

Omit each vertex in turn of convex polygon: Iterative limit?

Let $P=P_0$ be a convex polygon of $n$ vertices $v_k$. Let $P_{i+1}$ be the convex polygon obtained by intersecting the halfplanes determined by the lines through every other vertex. Below, $P_0$ is ...
8
votes
2answers
446 views

get a point in polygon (maximize the distance from borders)

I have several 2D polygons represented by lists of xy-coordinates of their vertices. It is needed to get several points inside the polygon so that they lie possibly far from the polygon's borders ...
6
votes
0answers
171 views

Linked circles in R3

Two circles in 3-D are linked iff each one passes through the interior of the other. There are $N$ points in 3-D in general position (no four lie on a plane). Each triple of points defines a unique ...