Questions tagged [discrete-geometry]
Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.
1,826
questions
0
votes
0
answers
42
views
Covering triangles with mutually congruent planar regions - optimally
We continue from this old post: From a given triangle, to cut 2 mutually congruent convex pieces that together 'use' maximum area of the triangle and go from partitioning to covering.
Given ...
1
vote
0
answers
61
views
Cutting off odd numbers of equal area triangles from a unit square
Two earlier related posts:
Cutting the unit square into pieces with rational length sides
On a possible variant of Monsky's theorem
Question: for odd n, how does one cut the unit square into n ...
1
vote
0
answers
138
views
Lower bound $|\sum_{x \in X} \phi(x) - \int_{\mathbb{R^2}} \phi(x) \, dx | \geq C f(\phi)$
I asked this question on math.stackexchange before, but with a bad formulation. I think the problem is quite complicated, so I decided to ask it here. Tell me if I shouldn't.
Very recently, I ...
1
vote
0
answers
95
views
Tiling the plane with pair-wise non-congruent and mutually similar triangles
Question: Is it possible to tile the plane with triangles that are (1) mutually similar, (2) pairwise non-congruent and (3)non-right? No other constraints.
Note 1: Reg requirement 3 above: since any ...
0
votes
0
answers
43
views
Tiling the plane with pair-wise non-congruent rational triangles of bounded size and unique sides
We add a bit to Tiling the plane with pairwise non-congruent rational triangles. The solutions given there show tilings of the plane with pairwise non-congruent rational triangles that are either (1) ...
9
votes
4
answers
1k
views
Tiling the plane with pairwise non-congruent rational triangles
A rational triangle is one in which all side lengths are rational numbers.
Question: Can we tile the Euclidean plane with rational triangles that are pairwise non-congruent? No further requirements on ...
3
votes
0
answers
59
views
Points of a centrally symmetric lattice polytope
Let $P\subseteq\mathbb R^n$ be a centrally symmetric lattice polytope whose only interior lattice point is the zero vector. Is it true that $P$ is equivalent (up to ${\rm GL}(n,\mathbb Z)$ + lattice ...
0
votes
0
answers
118
views
On partitioning convex planar regions into congruent pieces - 2
We add a bit to A claim on partitioning a convex planar region into congruent pieces .
Definition: A perfect congruent partition of a planar region $C$ is a partition of it into some finite number $n$ ...
2
votes
0
answers
112
views
Checking existence of a non-crossing Hamiltonian path in geometric graphs
I am interested in the following computational problem. Given a geometric graph (i.e, a graph drawn in the plane so that its vertices are represented by points in general position and its edges are ...
10
votes
0
answers
158
views
Minimum reflection paths in a mirror polygon
Let $P$ be a simple, orthogonal polygon of $n$ edges, i.e., one whose edges meet at right angles,
and is non-self-intersecting;
also known as a rectilinear polygon.
Treat every edge of $P$ as a ...
5
votes
1
answer
278
views
Cataland: Facets and partition polynomials of cluster complexes
Figure 25 on pg. 101 of "Cataland: Why the Fuss?" by Christian Stump, Hugh Thomas, and Nathan Williams depicts cluster complexes (CCs) associated with generalized $(m)$-Narayana / ...
4
votes
1
answer
255
views
A combinatorial problem about sequences of numbers
In this math.stackexchange question Adam Rubinson asked (I paraphrase):
Given a natural number $r$, what is the least number $n$ such that every strictly increasing sequence of $n$ real numbers has a ...
7
votes
1
answer
251
views
Set of points covered by subspaces of small dimensions
Let $S \subset \mathbb R^d$ be finite set of points. We say that $S$ is $2$-covered if $S$ lies in a union $V_1\cup V_2$ of affine subspaces such that $\dim(V_1)+\dim (V_2)\leq d-1$. For example, if $...
2
votes
0
answers
61
views
Structure Theory for Tree Decompositions
I that $G=(V,E,W)$ is a weighted graph with positive edge weights and a finite set of vertices $K$. Let $0\le k,M\le K$ be a fixed integer.
Is is known when $G$ admits the following type of ...
5
votes
1
answer
409
views
On the aperiodic monotile
One of the more mind-boggling aspects of the Penrose tiles is that there are uncountably many distinct tilings of the plane, but every tiling contains every finite region that appears in another ...
1
vote
0
answers
46
views
Partitioning convex regions, maximizing the average perimeter of pieces
We continue from Cutting convex regions into equal diameter and equal least width pieces - 2
Question: If a planar convex region C is to be cut into n convex pieces such that the average of the ...
17
votes
1
answer
567
views
Aperiodic monotile in $\mathbb{R}$
Motivation. Recently a group of researchers found an aperiodic monotile in $\mathbb{R}^2$, answering a long-standing question. There are many results in higher dimensions, so let's explore the lower ...
1
vote
0
answers
29
views
Inside-out dissections of solids
We add to Inside-out dissections of polygons - a generalization. The inside-out (fully inside-out) dissections are defined on pages linked there.
How does one inside-out dissect a tetrahedron into ...
1
vote
0
answers
64
views
Inside-out dissections of polygons - a generalization
Definitions (Inside-out polygonal dissections): a polygon P has an inside out dissection into P' if P′ is congruent to P and the perimeter of P becomes interior to P' and so the perimeter of P' is ...
11
votes
0
answers
435
views
What sequence maximizes the final distance?
This problem was created by professor Ronaldo Garcia from Universidade Federal de Goiás (UFG) and he showed it to me at an event in my university. This problem has a lot of history and he told me he ...
1
vote
0
answers
39
views
About the number of faces of the conification of a polytope
Let $P\subset\mathbb{R}^n$ be a polytope of dimension $(n-1)$ such that the origin $\vec{0}\not\in\text{Aff}(P)$, where $\text{Aff}(P)$ denotes the affine hull of $P$ in $\mathbb{R}^n$. Now, we ...
2
votes
0
answers
70
views
Flexagons and noncrossing partitions
Turns out a couple of series related to the faces of flexagons
popped up in my explorations of combinatorial reciprocities in a group algebra for sets of partition polynomial (ParPs) related to the ...
2
votes
0
answers
87
views
a counting problem on lattice
In $d$-dimensional lattice, we define a set $S_0$ be the zero point.
At step $i\geq 1$:
For each point $p\in S_{i-1}$, we can choose a single point $q$ who is a neighbour of $p$, and add $q$ into $s_{...
5
votes
3
answers
530
views
If a polyhedron in $\mathbb{R}^3$ has local intersections, does it also have more global intersections?
Consider a simplicial complex $K$. A piecewise linear map $f: K \to \mathbb{R}^n$ is an almost-embedding if $f(\sigma) \cap f(\tau) = \emptyset$ for any two disjoint simplices $\sigma,\tau$ in $K$.
...
1
vote
0
answers
126
views
Concentration of a combinatorial sum
Let $X=(x_1,\ldots,x_p)$ be an $p \times n$ random matrix with iid entries from $\{\pm 1\}$, distributed so that $\mathbb P(x_{ij} = 1) \equiv 1/2$, where $x_i=(x_{i1},\ldots,x_{in})$. Let $y$ be a ...
1
vote
1
answer
121
views
Smallest trapeziums containing a given convex n-gon
Question: Given a planar convex $n$-gon $C$, to find the smallest area / smallest perimeter trapezium (trapezoid) - a convex quadrilateral with at least one pair of mutually parallel edges - that ...
3
votes
0
answers
65
views
Cutting triangles into triangles with equal longest side
This post elaborates on a specific instance of Cutting convex polygons into triangles of same diameter .
Question: For any integer n, can any triangle be cut into n non-degenerate triangles all of ...
3
votes
0
answers
111
views
A theory of refined h- and f-polynomials for the permutahedra, associahedra, noncrossing partitions, and tropical Grassmannians (references)
Looking for references (insights) on a theory encompassing a notion of refined face polynomials and their associated refined h-polynomials that are generalizations of the relation between ordinary f-...
8
votes
2
answers
520
views
Number of matrices with unit determinant and fixed sum of elements
Question. Let $\mathcal{M}_3$ be the set of $3\times 3$ matrices with non-negative integer entries and unit determinant. What is the number of $M\in \mathcal{M}_3$ with fixed sum of entries? What is ...
6
votes
0
answers
234
views
Is there a bicyclic irregular pentagon in integers?
Is there a bicyclic irregular pentagon in integers, i.e. is there a pentagon, the length of each side is integer and unique such that it has a circumcircle and an inner circle as well?
If it does ...
7
votes
2
answers
613
views
Decomposition of a natural number as sum of positive integers
Let $n \in \mathbb{N}$ be a positive natural number and denote by $f(n)$ the number of decompositions of $n$ of the form $n = a+b+c+d$ where $a,b,c,d > 0$ are also positive natural numbers such ...
12
votes
1
answer
610
views
Has there been any progress on Conway's and Soifer's shortest paper?
In 2005 Conway and Soifer published the famous shortest ever paper, asking whether an equilateral triangle of sidelength $n+\varepsilon$ can be covered by $n^2+1$ unit equilateral triangles and ...
3
votes
0
answers
57
views
maximizing number of lattice points with bounded diameter
Suppose I have a lattice $L$ that's just $\mathbb{Z}^k$ but scaled in every coordinate by some (potentially different) real numbers. Now I want to construct a finite set of lattice points $S \subset L$...
4
votes
2
answers
242
views
Does the edge-graph of a centrally symmetric polytope determine which vertices are antipodal?
Given two origin symmetric convex polytopes $P_1$ and $P_2$ (that is $P_i=-P_i$) with the same edge-graph, but potentially of different dimensions and combinatorial types.
Let $\phi: G_{P_1}\to G_{P_2}...
1
vote
0
answers
68
views
Least number of squares of size N that a set of R rectangles can occupy
Given a set $R$ of rectangles of different positive integer sizes, and any number of squares of the same size $N\in\mathbb{N}$, what's the least number of squares $C$ that all the rectangles together ...
1
vote
0
answers
73
views
Existence of full-weight codeword in a linear q-ary code
I'm new to coding theory but would like to ask the following question:
Let $C$ be a linear $q$-ary code over $\mathbb{F}_q$ of length $n$ and dimension $k$ where $\mathbb{F}_q$ is a finite field with $...
0
votes
0
answers
71
views
The closest ellipse and circle to a given triangle - 2
We add a little more to The closest ellipse to a given triangle.
The above linked discussion used the Hausdorff distance to quantify how close two planar convex regions are.
In an earlier post - ...
4
votes
0
answers
131
views
Can a polytopal graph be "centrally symmetric" in more than one way?
Let $P,Q$ be two centrally symmetric convex polytopes, potentially of different dimensions and combinatorial type, but with the same edge-graph $G$.
The central symmetry of $P$ induces an involutory ...
2
votes
1
answer
152
views
Bound for a sequence of vertices in a graph
I have come across the following problem. Let $d\in\mathbb{N}$. Let $G$ be any $k$-regular connected directed graph with $n$ vertices, no parallel edges and no 2-cycles. For a vertex $v\in G$, let $...
1
vote
0
answers
37
views
Tiling the hyperbolic plane with mutually-non congruent equal area triangles
This post continues On tiling the plane with non-congruent, equal area triangles with each edge having a unique length
Can the hyperbolic plane be tiled by pair-wise non-congruent equal area ...
0
votes
1
answer
47
views
Constructing a polygon from another with collinearity constraints
Let $P$ be a closed polygon defined by the sequence
$p_0,\,\dots,\,p_{n-1},p_0$ of points.
Question:
how can one construct, with straightedge and compass alone, another sequence of points $q_0,\,\...
1
vote
0
answers
53
views
Chromatic number of 2-graph vs hypergraph of point-line incidences
Define the chromatic number $\chi(H)$ of a (hyper)graph $H$ as the smallest $k$ such that its vertices can be $k$-colored such that no (hyper)edge is monochromatic.
Given a finite set of points $P$ in ...
1
vote
0
answers
46
views
Kissing behavior of planar regions
This post reworks a question that was stated in a slightly different form at Convex region $C$ with least kissing number of copies of $C$.
Background: Given a 2D region $C$ (not necessarily convex), ...
3
votes
0
answers
83
views
Is the face poset of a compact intersection of cylinders and half-spaces shellable?
Let the $n$-disk $D^n$ be stratified hemispherically (so there are two 0-dimensional strata at the poles, two 1-dimensional strata for the prime meridian and the international date line, two 2-...
0
votes
1
answer
49
views
What is the most dense sample for which the Crust algorithm returns an incorrect polygonal reconstruction?
The Crust algorithm by Amenta, Bern, and Eppstein computes a polygonal reconstruction of a smooth curve $C$ without boundary from a discrete set of sample points $S$. It is known that if $S$ is an a $\...
2
votes
1
answer
82
views
On equipartitions of surfaces of 3D convex regions
Let S be the surface of a 3D convex region (a 'convex surface'). Let S' be a subset of S. We shall refer to S' as geodetically convex in S if the following condition holds: If A and B are two points ...
4
votes
0
answers
128
views
Can a convex frame hold all circles of radius $1/n$ immobile?
Here is a frame that holds circles of radius $1, \frac{1}{2}, \frac13, ..., \frac17$ immobile.
By "immobile", I mean no circle can move without overlapping other circles or the frame, ...
8
votes
1
answer
238
views
For which $n$ does a y-formed $n$-polyomino tile a $n \times n \times n$-cube?
I got from my children as a gift a puzzle consisting of 25 y-shaped 5-polyominoes that form a $5 \times 5 \times 5$-cube (see picture).
I'm wondering for which $n$ does a y-formed $n$-polyomino tile a ...
2
votes
1
answer
172
views
How many ways are there to pick $n$ points on the finite affine plane $(\Bbb F_q)^2$ such that no three are collinear?
How many ways are there to pick $n$ points on the finite affine plane $(\Bbb F_q)^2$ such that no three are collinear?
For example, how many ways can we pick $5$ points on $\Bbb F_{32}\times\Bbb F_{32}...
0
votes
1
answer
51
views
On 'axiality' of planar convex regions
Axiality has been studied under a definition given here: https://en.wikipedia.org/wiki/Axiality_(geometry)
Consider an alternative definition of axiality as follows: For a convex region C, consider a ...