Questions tagged [discrete-geometry]

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

1,453 questions
Filter by
Sorted by
Tagged with
29 views

Packing densities of non-centrally symmetric planar convex regions

Reference: https://en.wikipedia.org/wiki/Smoothed_octagon Background: The smoothed octagon is conjectured to have the lowest maximum packing density of the plane of all centrally symmetric convex ...
142 views

Polyhedrons and their centers of mass

Given a convex polyhedron, one considers 3 possibilities: wireframe - only the edges of the polyhedron have mass which is uniformly distributed. surface - only the surface is massive with uniform ...
46 views

Rigid monohedral tilers

Say that a tile $T$ that alone can tile the plane—a monohedral tile—is rigid if it is not the case that $T$ can be slightly deformed to $T'$ so that: $T'$ can also tile the plane $T'$ is arbitrarily ...
112 views

Variants of the Euler Brick

Reference: https://en.wikipedia.org/wiki/Euler_brick An Euler brick is a rectangular cuboid whose edges and face diagonals all have integer lengths. A perfect Euler brick is one where the longest ...
185 views

Has this curious "duality" of weighted $K_4$ already been noticed?

A complete symmetric graph with $n=4$ vertices, i.e. a $K_4$ is the disjoint union of three perfect matchings $M_{\text{min}},M_{\text{mid}},M_{\text{max}}$ of which $M_{\text{min}}$ denotes the ...
487 views

Polytope where each vertex belongs to all but two facets

Let $P$ be a (convex, bounded) polytope with the following property: for every vertex $v$, there are exactly two facets which do not contain $v$. Does it follow that $P$ is (combinatorially) a ...
38 views

Shadows and planar sections of polyhedra – 2

This post continues Shadows and planar sections of polyhedra and On planar sections of 3D convex bodies Shadows and planar sections of polyhedra gives an example demonstrating that shadows (orthogonal ...
143 views

Shadows and planar sections of polyhedra

By shadow we mean the orthogonal projection of a convex 3D body P onto a 2D plane, for example, the shadow on the xy-plane, with P above (z>0) that plane and the light at L=(0,0,+∞). P an be freely ...
49 views

A Variant of the Malfatti Problem

See https://en.wikipedia.org/wiki/Malfatti_circles for an introduction to Malfatti's problem. The above page also states that for n >3, the question of whether a greedy method (at each step, the ...
88 views

Embedding linklessly embeddable graphs without Borromean rings

A linklessly embeddable graph is a graph which can be embedded into $\Bbb R^3$ so that no two of its cycles are linked. For example, the Petersen graph is not such a graph. Now, I can think of another ...
176 views

On intersections of several convex regions

Question: Given n convex planar regions. Required to place them (in suitable position and orientation) so that that part of the plane lying under all the regions (their common intersection) is of ...
229 views

Partitioning a set of lattice points in the plane into rectangles

The "long comment" by Pietro Majer on Reference for puzzle on dividing piles and scoring products suggests the following problem. Let $S$ be a finite subset of $\mathbb{Z}\times \mathbb{Z}$. ...
140 views

Set of unit vectors such that among any three there is an orthogonal pair

I was fascinated by the solutions of Problem 8 of the IMC 2021 contest, which can be summarized as: Theorem 1. Let $v_1,\dotsc,v_N$ be distinct unit vectors in $\mathbb{R}^n$ such that among any three ...
238 views

Tiling a Jordan polygon

I saw this problem some years ago, don't remember the source: Let $P$ be a Jordan polygon (i.e. the only points of the plane belonging to two edges are the polygon vertices) that can be tiled with ...
157 views

combinatoric proof $\sum_{i=0}^{n}(-1)^i\binom{n}{i}\binom{n-i+k-1}{k}=\binom{k-1}{k-n}$ [closed]

I would like help with combinatorial proof , not algebraic proof . Thank you for your time $\sum_{i=0}^{n}(-1)^i\binom{n}{i}\binom{n-i+k-1}{k}=\binom{k-1}{k-n}$
32 views

Uniformization of triangulation on a sphere up to Moebius transformations

This is not the most precise question but rather a hope that someone has seen something like this. I am given a triangulation of the 2-sphere $S^2$ which I only know up to Moebius transformations. I ...
97 views

109 views

Which convex pentagon gives least packing density?

Among all convex pentagons, does the regular pentagon give least packing density? Further question: For each n > 6, is the regular n-gon the minimum of packing density? An analogous question can be ...
57 views

Facility location and traveling salesman

This question is based on Distributing points evenly on a sphere and Facility location on manifolds The 'dispersal problem' (which can be mapped to packing disks in many cases) places $n$ points in a ...
120 views

The polytope algebras generated by polytopes with rational vs arbitrary vertices

The polytope algebra was defined by P. McMullen in "The polytope algebra" Adv. Math. 78 (1989) as follows. Let us denote by $\Pi'_\mathbb{R}$ the quotient of the free abelian group generated ...
82 views

46 views

What do optimal tours tell about finite point sets?

Let $T_{\mathrm{MIN}}$ and $T_{\mathrm{MAX}}$ denote the shortest, resp. longest Hamilton cycle through a set of $n=2k+1$ points. Let further $S_{\mathrm{MIN}}$ and $S_{\mathrm{MAX}}$ be the "...
167 views

Are there any convex pentagonal rep-tiles?

A rep-tile is a shape that can tile larger copies of the same shape. Question 1: Are there any convex pentagons that are also rep-tiles? Remarks: 15 convex pentagonal tiles of the plane are known and ...
532 views

Three squares in a rectangle

One of my colleagues gave me the following problem about 15 years ago: Given three squares inside a 1 by 2 rectangle, with no two squares overlapping, prove that the sum of side lengths is at most 2. (...
52 views

A center of convex planar regions based on chords

This is based on Chapter 6 of 'Convex figures' by Yaglom and Boltyanskii. This post also continues mathoverflow.net/a/383528/143513. A point $P$ in the interior of a planar convex region $C$ divides ...
25 views

Multi-layered wrapping of polyhedra

This post continues from How big a box can you wrap with a given polygon? and Convex polyhedra that can be folded from convex polygons. One can also mention 'k-fold coverings of the plane' as examined ...
77 views

Convex polyhedra that can be folded from convex polygons

This question is based on http://www.science.smith.edu/~jorourke/Papers/FoldingPP.pdf. Therein is stated the theorem: Every convex polygon folds to an infinite number (a continuum) of noncongruent ...
597 views

Happy ending problem – Why not a proof by induction?

I have been thinking for a while on the happy ending problem, looking for approaches to attack the Erdős–Szekeres conjecture: the smallest number of points for which any general position arrangement ...
192 views

How big a box can you wrap with a given polygon?

Question: Given a convex polygonal region, how does one find the box (rectangular parallelopiped) of maximum volume that can be wrapped with this region? While wrapping, if needed, some portions of ...
50 views

Covering radius of a lattice from relevant vectors

Let $L$ be an $n-$dimensional lattice. The Voronoi region of $L$ is given by $$\mathcal{V}(L)=\big\{x\in\mathbb{R}^n~|~ \|x\|_2\leq \|x-v\|_2~\forall v\in L\setminus\{0\}\big\}.$$ Considering the ...
87 views

Folding polygons into 'vessels'

This question is based on http://www.science.smith.edu/~jorourke/Papers/FoldingPP.pdf Define an vessel as a convex polyhedron with one face removed - in other words, a vessel can be converted into a ...
48 views

Common basis property

Let F be a field and let $U_1, \ldots, U_k$ be subspaces of $F^n$. Say that $U_1, \ldots, U_k$ has a common basis if there is a basis $b_1,\ldots,b_n$ of $F^n$ such that each $U_i$ is a span of some ...
174 views

Convex polyhedra with non-congruent faces

Question: Are there convex polyhedra wherein all faces are convex polygons with same area and perimeter and no two faces are mutually congruent? Remarks: If the answer to above is "no", then,...
405 views

Real rootedness of a polynomial with binomial coefficients

It is possible to show using diverse techniques that the following polynomial: P_n(x)=1 + \binom{n}{2} x + \binom{n}{4} x^2 + \binom{n}{6} x^3 + \binom{n}{8} x^4 +\ldots + \binom{n}{2\lfloor\tfrac{n}...
104 views

Counting lattice polytopes by volume

For any $n \in \mathbb{N}$ and $B \in \mathbb{R}_{\geq 0}$, let $\mathcal{P}(n,B)$ be the set of $n$-dimensional convex polytopes $\Delta \subseteq \mathbb{R}^n$, taken up to integral, unimodular ...
95 views

On a possible variant of Monsky's theorem

See Wikipedia for Monsky's theorem which states: it is not possible to dissect a square into an odd number of triangles all of equal area. Questions: Are there quadrilaterals that allow partition into ...
75 views

Is the unit-stick number of a knot equal to its stick number?

Define the unit-stick number $\sigma_1(K)$ of a knot $K$ to be the fewest unit-length sticks that can realize $K$. Clearly $\sigma_1(K)$ is at least the stick number $\sigma(K)$. It is known that the ...
30 views

Cutting convex regions into equal diameter and equal least width pieces - 3

We add a bit to Cutting convex regions into equal diameter and equal least width pieces - 2. There, we asked, for example: If we divide a 2D convex region C into n convex pieces such that the maximum ...
215 views

Does there exist numerically balanced dice with odd numbers of faces?

This question is motivated by "Numerically Balanced Dice" by Bosch, Fathauer, and Segerman, in which they produced the most numerically balanced d20 and d120. After reading this paper, I ...