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

learn more… | top users | synonyms (1)

8
votes
1answer
231 views

Largest convex hull of a unit length path

What is the largest area possible for the convex hull of a path of unit length lying on a plane? For what paths is that largest area attained?
2
votes
1answer
89 views

Estimates on the number of vertices of reflexive polytopes

Suppose $M \cong \mathbb{Z}^n$ is a rank $n$ lattice, with dual lattice $N$. Suppose $\Delta$ is a full dimensional lattice polytope (i.e. convex hull of finite lattice points) in $M$. Then $\Delta$ ...
1
vote
1answer
232 views

Rational points of non-rational curves

An algebraic curve (in this question) is the zero set   $C = f^{-1}(X\ Y)$ of any polynomial   $f\in\mathbb R[X\ Y]$;   we say then that   $f$   represents   $C$.   ...
1
vote
0answers
224 views

A problem in Galois Geometry

Given a prime $p$, out of $N$ vectors of length $p^k$ over $\Bbb F_2$ of Hamming weight $w^{k}$ that are chosen, how many vectors can there be with pairwise Hamming distance at least $2w^{k}$ given ...
12
votes
0answers
737 views

Hrushovski's Construction

Zilber expressed a conjecture for $\aleph_{1}$- categorical theories (In the 80s). Zilber's Conjecture: The geometry of any $\aleph_{1}$- categorical structure is one of the following: (a) Trivial ...
11
votes
3answers
393 views

Is there a nice way to “unravel” a great dodecahedron?

The great dodecahedron is a non-convex regular polyhedron bounded by 12 pentagonal faces, crossing each other, arranged in a star-shaped manner around each of its 12 vertices (see the Wikipedia page ...
19
votes
2answers
797 views

Erdős, Harary, Tutte's “dimension of graph”: Progress in last 48 yrs?

I just ran across this delightful paper by an amazing triumvirate: Paul Erdős, Frank Harary, and William Tutte. "On the dimension of a graph." Mathematika 12.118-122 (1965): 20. (Cambridge link) ...
12
votes
2answers
459 views

Sets of evenly distributed points in the Euclidean plane

Is there a set $P \subset \mathbb{R}^2$ of points in the Euclidean plane whose intersection with every convex subset of $\mathbb{R}^2$ of area $1$ is nonempty but finite? If the answer is yes, can ...
7
votes
1answer
176 views

Can a tangle of arcs interlock in plane?

This is a variation of the question Can a tangle of arcs interlock?, asked by Joseph O'Rourke, and solved. I reproduce the question here: Can a (finite) collection of disjoint circle arcs in ...
4
votes
1answer
208 views

n-simplex in an intersection of n balls

Consider any $n$-simplex, $n \geq 2$. For each edge $(i,j)$, consider $n$-ball $B_{ij}$ such that vertices $x_i$ and $x_j$ are antipodal on this ball. Fix a point $x_0$ in the simplex. The question: ...
2
votes
0answers
327 views

Partitioning the Projective Plane

Throughout this post, by projective plane I mean the set of all lines through the origin in $\mathbb{R}^3$. Side Note: If there are more standard definitions for any of the ideas presented here, ...
2
votes
2answers
170 views

Three questions concerning lattice points on sphere surfaces

Pardon my ignorance of this topic. Q1. In which dimensions $d$ is it the case that, for every natural number $n$, there exists a sphere having exactly $n$ lattice points on it ...
1
vote
1answer
191 views

Request for some references exploring the connections of Riemann surfaces with medical imaging

I'd like to know some references for a beginner who has basic background in Riemann surfaces and differential geometry, and would like to start learning/working on more applied areas, medical ...
4
votes
1answer
170 views

Cover of a n-simplex with balls

Consider a n-simplex. For each edge (i,j), consider a n-ball, such that vertices i and j are antipodal on this ball. Is the simplex covered by the union of these balls? Thank you.
17
votes
4answers
781 views

Non-chaotic bouncing-ball curves

I was surprised to learn from two Mathematica Demos by Enrique Zeleny that an elastic ball bouncing in a V or in a sinusoidal channel exhibits choatic behavior:     (The Poincaré map ...
13
votes
1answer
207 views

Smallest regular simplex containing the unit cube in $R^n$

What is the length $e_n$ of the edge of the smallest $n$-dimensional regular simplex $S_n$ containing the $n$-dimensional unit cube $Q_n$? In particular, is there $n$ such that ...
12
votes
7answers
481 views

Can a tangle of arcs of ellipses interlock

This is a variation on an earlier question resolved by user35353: Can a tangle of arcs interlock? In that question, the arcs were restricted to circular arcs, and user35353's proof that one arc can be ...
11
votes
3answers
455 views

Can a tangle of arcs interlock?

Can a (finite) collection of disjoint circle arcs in $\mathbb{R}^3$ be interlocked in the sense in that they cannot be separated, i.e. each moved arbitrarily far from one another while remaining ...
4
votes
2answers
244 views

Problems similar to Borsuk’s Theorem in the plane

Consider a 2-dimensional Borsuk's theorem: Every bounded set $S$ in the plane can be partitioned into three parts with diameter smaller than the diameter of $S$. I wonder if there are any ...
5
votes
2answers
149 views

Functionals on oriented matroids

Oriented matroids are abstractions of hyperplane arrangements, or equivalently vector configurations. Let me recall the definition in terms of covectors. Let $R=\lbrace 0,+,-\rbrace$ with the monoid ...
7
votes
2answers
365 views

Two cubes in unit cube

A cube of side one contains two cubes of sides a and b having non-overlapping interiors. How to prove the inequality $a+b \le 1$? The same question in higher dimensions. It was asked, but not answered ...
2
votes
2answers
143 views

Proving non-convexity of a set of lattice points

I have a set of lattice points S in R^n (listed in memory in a computer for n=8 say). I want to computationally certify that they do not form the lattice points of a convex polytope P in R^n. (Ex. ...
8
votes
3answers
666 views

On maximal regular polyhedra inscribed in a regular polyhedron

Let T, C, O, D, or I be regular tetrahedron, cube, octahedron, dodecahedron, and icosahedron, respectively. Suppose that the outer polyhedron have edge-length 1. For example, it's easy to prove that ...
9
votes
2answers
213 views

Do maximal polyhedra have algebraic volume?

Is it possible to prove that for every $n > 3$ the maximal possible volume of a convex polyhedron having $n$ vertices inscribed in a sphere of unit radius is an algebraic number? Update: What ...
5
votes
2answers
266 views

Covering convex polygons with inscribed disks

The following problem came up when discussing mapping software (e.g., Google maps) with computer scientists. By $B(c,r)$ I mean the planar disk (open or closed, it doesn't matter) of radius $r$ around ...
3
votes
0answers
122 views

On understanding Discrete-Valued Stochastic Processes( time series, panel data )

It seems to me that a significant proportion of work in probability theory, statistics and machine learning are on understanding continuous-valued, relatively weakly dependent, or linear dependent ...
11
votes
1answer
517 views

Tiling the square with rectangles of small diagonals

For a given integer $k\ge3$, tile the unit square with $k$ rectangles so that the longest of the rectangles' diagonals be as short as possible. Call such a tiling optimal. The solutions are obvious in ...
2
votes
0answers
77 views

Criteria to decide whether a subset of the boundary complex of a polyhedron is a manifold?

Let $\mathcal{P} \subseteq \mathbb{R}^d$ be a convex polyhedron. Let $K$ be a subset of the boundary complex of $\mathcal{P}$. (Perhaps $K$ could be defined in terms of a system of linear ...
2
votes
0answers
127 views

A question on discrete numerical simulation on fluids mechanics

I read the paper "Stable, circulation-preseving simplicial fuids" by Elcott, et al: http://www.cs.jhu.edu/~misha/Fall09/Elcott07.pdf. It gives a structure preseving discretization of fluids. I have ...
3
votes
1answer
191 views

cover and hide with squares

I am studying two numbers, related to squares, that can characterize a polygon P: MinCoverNumber = the minimum number of axis-aligned squares required to exactly cover P (the covering squares may ...
5
votes
1answer
439 views

Interesting behaviour of Brion's formula under a degenerate change of variables

This is, probably, a question for those knowledgeable on the subject of Brion's theorem and its applications. Lately, I've been dealing with situations of the following sort. Suppose we are given a ...
9
votes
1answer
251 views

Which values can attain the minimum solid angle in a simplex

Given a simplex $S$ with a vertex $v$ by the solid angle at this vertex I mean the value $\hbox{vol}(B \cap S)/\hbox{vol}(B)$ where $B$ is a small enough ball centered at $v$ (for example, in the ...
8
votes
1answer
233 views

Fold-and-cut problem in three dimensions

The fold-and-cut theory states that "Any shape with straight sides can be cut from a single (idealized) sheet of paper by folding it flat and making a single straight complete cut. Such shapes include ...
9
votes
1answer
274 views

Complexity of the union of randomly rotated unit cubes

It is a remarkable fact that the union of congrent cubes has only at most near-quadratic combinatorial complexity, $O^*(n^2)$ for $n$ cubes, known to be almost tight. This contrasts with the union of ...
6
votes
2answers
199 views

Volumes of convex vs non-convex polyhedra with prescribed facets areas

It is known that given a set of Areas $A_f$ and normals $\vec{n}_f$ if $\sum_f A_f \vec{n}_f=0$ exist a unique convex polyhedron with given face areas and normals. (Minkowski theorem - See Alexandrov ...
5
votes
1answer
462 views

Difference Sets

Suppose $$ P \subseteq \{1,2,\dots,N\},\quad |P| = K $$ We calculate the differences as: $$d=p_i-p_j\mod N,\quad i\ne j$$ Now let $a_d$ denote the number of occurrence of $d$ (for $d = 1, 2, \dots , N ...
6
votes
1answer
293 views

Pick's Theorem for rational points of bounded height

I wonder if the various lattice-point theorems, such as Pick's Theorem or Minkowski's Lattice Theorem, have been generalized to the collection of points with rational coordinates no more than height ...
3
votes
0answers
106 views

What are the Voronoi cones in 4 variables?

Question: What are the top dimensional cones of the 2nd Voronoi decomposition of the space of positive definite forms in $4$ variables? The 2nd Voronoi decomposition of the cone of positive definite ...
5
votes
1answer
154 views

Matching on sphere to create cycle with chords

Imagine a number of chords of a sphere $S$ which nearly, but not quite, pass through the center of $S$, in such a way that no pair of chords intersect:       I would like ...
5
votes
2answers
233 views

Solving for special rational triangles

I ran into a need for isosceles triangles that (1) have the two equal integer side lengths $a$ (but the base $x \in \mathbb{R}$), and (2) the apex angle $\gamma$ is a rational multiple of $\pi$. ...
3
votes
1answer
125 views

What are interesting 3-colorings of the plane without rainbow lines?

This question is about 3-colorings of the plane in which every line is bichromatic (or monochromatic), i.e., there are no three collinear points of different colors. Such colorings trivially exist, ...
3
votes
1answer
118 views

Existence of Simple Closed Straightest Geodesics

There are at least three distinct simple closed quasigeodesics on convex polyhedra [Mat. Sb. (N.S.), 1949, 25(67) :2, 275–306 Quasi-geodesic lines on a convex surface Pogorelov]. Is the same true ...
14
votes
3answers
258 views

Covering a hexagon

For $\epsilon > 0$ sufficiently small, can a regular hexagon with sides of length $1 + \epsilon$ be covered by seven equilateral triangles with sides of length $1$? Motivation: Conway and Soifer ...
7
votes
0answers
78 views

Is the equidissection spectrum closed under addition?

If a polygon can be cut into $m$ as well as into $n$ triangular pieces of equal area, can it also be cut into $m+n$ triangles of equal area? (I'm editing after realizing that my conjecture that a ...
11
votes
3answers
605 views

What fraction of n-point sets in the unit ball have diameter smaller than 1?

This question is inspired by a recent talk by Matt Kahle on random geometric complexes. Some simple notation: let $\mathcal{B} \subset \mathbb{R}^d$ be the unit ball in $d$-dimensional Euclidean ...
2
votes
1answer
85 views

Covering the annulus of d-cube

Given a convex body $C\subset R^d$ and a positive real $\lambda$, any set of the form $\lambda C + x = \{ \lambda c+x \mid c\in C \}$, for some $x\in R^d$, is called a homothetic copy of $C$. The ...
3
votes
1answer
116 views

Covering a convex body with its smaller homothetic copies

Given a convex body $C\subset R^d$ and a positive real $\lambda$, any set of the form $\lambda C + x = \{ \lambda c + x \mid c\in C \}$ for some $x\in R^d$ is called a homothetic copy of $C$. The ...
4
votes
3answers
550 views

Consecutive Integer Squared Square

Is it possible to construct a squared square out of consecutive integer squares? Be it 1,2,3,...n or k,k+1,k+2,...n.
45
votes
5answers
2k views

If a unitsquare is partitioned into 101 triangles, is the area of one at least 1%?

Update: The answer to the title question is not necessarily, as pointed out by Tapio and Willie. I would be more interested in lower bounds. Monsky's famous and amazingly tricky proof says that if we ...
1
vote
1answer
149 views

Helly's number from biconvex functions

Helly's Theorem states the following. Suppose $X_1,X_2,...,X_N$ are convex sets in $\mathbb{R}^d$, such that for any index-set $I$ with $|I| \leq h(d) := d+1$, we have $\bigcap_{i \in I} X_i \neq ...