Tagged Questions

Discrete geometry includes the study of covering, illumination, packing, convex bodies, convex polytopes, and other metric geometry.

28 views

77 views

non-trivial non-repetitive aperiodic tiling of the plane

Which is the less trivial example of non-repetitive aperiodic tiling of the plane you know? I cannot come up with a famous non-repetitive tiling. Are there any? A tiling is repetitive if for every ...
56 views

Proof of Jordan Curve Theorem for Polygons

So I'm trying to prove the Jordan curve theorem for polygons, but I'm not sure how to show that a line segment that does not intersect the boundary has all points of the same parity. I'm also not ...
120 views

Polygons with a Unique Triangulation

For each n > 3, find a polygon with n vertices that has a unique triangulation. I want to say that you can somehow build these polygons by continuously adding triangles somehow, but I'm not sure.
55 views

Equivalent definitons of Centerpoint

In Jiri Matousek's book - "Lectures on Discrete Geometry", he defines centerpoint as: 1.4.1 Definition (Centerpoint). Let $X$ be an $n$-point set in $\mathbb R^d$. A point $x \in \mathbb R^d$ is ...
60 views

Relationship between Laplacian and Taylor expansion for 2nd derivative

I am working on converting a solution to a certain PDE from working on a regular 2D grid to work on a 3D triangular mesh. In the 2D scenario the 1st and 2nd derivatives are, of course, approximated ...
21 views

What is the expected number of edge flips to get from a random triangulation to this special min-max angle triangulation in 2-d?

This comes from a problem my coworker and I are working on, and I'm not sure whether to post it here or MathOverflow or CrossValidated or what. Please let me know if I should migrate the question. We ...
19 views

Lattice points in simplices - reference request

I found this paper http://homepages.math.uic.edu/~yau/35%20publications/An%20upper.pdf which, in formulas (1.2) and (1.3), relates the number of non-negative and positive integer values that are ...
74 views

Partitioning $\mathbb{R}^d$ with two convex sets

The problem/puzzle is: Find two convex sets in Euclidean space, $A, B\subseteq\mathbb{R}^d$, such that the number of connected components of $\mathbb{R}^d\setminus (A\cup B)$ is the maximum ...
50 views

Is it known whether or not the 'Hauptvermutung' is true for finite simplicial complexes in $\mathbb{R}^4$?

If I have two finite simplicial 4-complexes embedded linearly in $\mathbb{R}^4$ (as in all the lines and faces are straight and flat and there are only a finite number of 4-simplices) do they have a ...
171 views

Curtains and groups

This picture is a copy of the pattern on my curtains. The points of a hexagonal lattice are each coloured with one of four possible colours. It has translational symmetry in two directions: a ...
116 views

One special case of Helly's theorem (for $\text{radius}=1$ circles)

There are $n$ points on the plane. Any $3$ of them can be covered with a radius $1$ circle. Prove that there is a radius $1$ circle that covers all the points. Came to this when tried to prove an easy ...
55 views

Is there a theory for cellular automata propagating signals in straight lines?

Is there a theory explaining how a cellular automata can propagate signals in straight lines? For example, this video shows how some "signals" travel down at a diagonal, even though they are composed ...
52 views

Nearly-unit-distance graph (UDG) density

Q1. How dense can a nearly-unit-distance graph be? Let points sit in $\mathbb{R}^2$. A unit-distance graph UDG "connect[s] two points by an edge whenever the distance between the two points is ...
159 views

Balanced, center-free set. [closed]

We say that a finite set $\mathcal{S}$ of points in the plane is balanced if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say ...
27 views

Polyhedral surface with infinitely many triangulations with same combinatorics

Is there an example of a polyhedral surface that has infinitely many triangulations with the same combinatorics?
32 views

Is optimal bound for Alcuin's triangular city problem known?

Alcuin's triangular city problem is Problem 28 from Propositiones ad Acuendos Juvenes. There is a triangular city which has one side of 100 feet, another side of 100 feet, and a third of 90 ...
54 views

triangulation of the cube of whose vertices are in the set $\lbrace (\pm 1 , \pm 1 , \dots , \pm 1)\rbrace$

Take the cube centered at the origin whose vertices are $\lbrace (1 ,1 , 1) , (-1 ,1 , 1) , (1 ,-1 , 1) , (1 ,1 , -1) , (1 ,-1 , -1) , (-1 ,1 , -1) , (-1 ,-1 , 1) , (-1 ,-1 , -1) \rbrace$. We can ...
29 views

Intersection of a polyhedron and a ball

I'm reading this paper http://www.math.hawaii.edu/~erik/papers/cat0-A.pdf and it looks like I don't get one point. It's the remarks under definition 2.2., mostly the sentence: ,,Imagine a vertex $x$...
23 views

Finitely many hyperplanes separating $x,y$ in a CAT(0) cube complex

I'm having a great difficulty understanding a proof of a lemma from this paper: http://www.math.hawaii.edu/~erik/papers/cat0-A.pdf It's lemma 1.12. To make it shorter for anyone who'd like to take a ...
172 views

38 views

46 views

Is there a theorem or axiom which shows that permutations of step sequences through a lattice graph result in the same destination?

I have been searching for a theorem, lemma, or even an axiom which shows that the permutations of a step sequence in Taxicab Geometry result in the same destination in such a lattice graph. To ...
190 views

Partitioning the plane into three sets each intersecting the vertices of every square with side 1?

Q1. Is it possible to partition the plane into three sets such that each of them contains at least one vertex of every square with side 1 ? (I mean all squares of side-length 1, not just those with ...
Prove that a convex $d$-polytope has at least $d+1$ facets
This seems trivial but I can't come up with a formal proof. I think there should be a way to do this inductively but I can't figure out how$\ldots$ Any help much appreciated
The number of $(d-1)$-faces in a $d$-polytope is at least $(d+1)$
I have to try to prove the following: Let $V = {v_1,...,v_n} \subset \mathbb{R}^d$ be a point configuration affinely spanning $\mathbb{R}$ (i.e., $\operatorname{aff}(V) = \mathbb{R}^d)$. Let $H$ be ...