# Tagged Questions

**3**

votes

**1**answer

76 views

### Covering points with a shortest lattice spiral

Let $S$ be a finite set of lattice points in $\mathbb{Z}^2$.
My question is, roughly:
Q. How can a shortest lattice spiral that passes through
every point of $S$ be found?
A lattice spiral (my ...

**9**

votes

**1**answer

210 views

### A random variation on Polya's orchard problem

Polya's orchard problem is as follows:
"How thick must the
trunks of the trees in a regularly spaced circular orchard grow if they are
to block completely the view from the center?"
See, ...

**7**

votes

**1**answer

87 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 ...

**2**

votes

**1**answer

64 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 ...

**8**

votes

**1**answer

400 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 ...

**6**

votes

**1**answer

133 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 ...

**8**

votes

**1**answer

180 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 ...

**2**

votes

**1**answer

89 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?

**2**

votes

**1**answer

108 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 ...

**1**

vote

**1**answer

34 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 ...

**27**

votes

**1**answer

887 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 ...

**6**

votes

**1**answer

154 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

**0**answers

42 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 ...

**2**

votes

**1**answer

111 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 ...

**7**

votes

**2**answers

287 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 ...

**14**

votes

**2**answers

469 views

### Spearing rolling hula hoops

Or: Stabbing rolling disks.
Imagine there are $n$ unit-diameter disks rolling between $x=0$ and $x=d$,
reflecting off either end.
The disk centers start at a random location within $[\frac{1}{2}, ...

**4**

votes

**2**answers

155 views

### Bound on Minimal Length of Vectors in Lattice and its Dual Lattice

Let $\Lambda$ be a lattice in $\mathbb{R}^n$ and $\Lambda^\ast$ its dual lattice. Let $d=\min_{v\in\Lambda} (v,v)$ and $d^\ast =\min_{v\in\Lambda^\ast} (v,v)$ be the minimal squared lengths of vectors ...

**11**

votes

**2**answers

327 views

### The intersection of a circle and a rank 3 subgroup of the plane

Let $A$ be a rank 3 subgroup of the Euclidean plane, i.e. $A = \mathbb{Z} v_1 + \mathbb{Z} v_2 + \mathbb{Z} v_3$, where $v_1, v_2, v_3 \in \mathbb{R}^2$ are three $\mathbb{Q}$-linearly independent ...

**4**

votes

**1**answer

203 views

### Computational approach deciding whether a set of Wang Tile could tile the space up to some size

As an applied person, I'm facing one practical problem deciding whether a set of Wang tile could tile the plane periodically or aperiodically. Although both problems seem undecidable, but I'm on a ...

**5**

votes

**3**answers

265 views

### How hard is it to determine if a weighted graph can be isometrically embedded in R^3?

Consider a graph $G$ with nonnegative edge weights.
Question: In $\mathbb{R}^3$, how hard is it to assign coordinates to vertices such that the Euclidean length of each edge is equal to its weight?
...

**42**

votes

**2**answers

1k views

### How many unit cylinders can touch a unit ball?

What is the maximum number $k$ of unit-radius cylinders with mutually disjoint interiors that can touch a unit ball?
By a cylinder I mean a set congruent to the Cartesian product of a line and a ...

**22**

votes

**3**answers

2k views

### Can a unit square be cut into rectangles that tile a rectangle with irrational sides?

For arbitrary positive integers $m$ and $n$, if we dissect a unit square into an $m\times n$ rectangular grid of $1/m\times 1/n$ rectangles, we can reassemble these $mn$ rectangles into an $n/m\times ...

**3**

votes

**0**answers

88 views

### Lattices achieving best density

Let $\Lambda \subset \mathbb{R}^n$ be an Euclidean lattice with generator matrix $B$. Define the center density $\delta(\Lambda)$ in the usual way as $\delta(\Lambda) = \rho^n/|\det{B}|$, where $\rho$ ...

**13**

votes

**3**answers

647 views

### Are infinite planar graphs still 4-colorable?

Imagine you have a finite number of "sites" $S$ in the positive quadrant
of the integer lattice $\mathbb{Z}^2$,
and from each site $s \in S$, one connects $s$ to every lattice point to which it
has a ...

**34**

votes

**3**answers

1k views

### What fraction of the integer lattice can be seen from the origin?

Consider the integer lattice points in the positive quadrant $Q$ of $\mathbb{Z}^2$.
Say that a point $(x,y)$ of $Q$ is visible from the origin if the
segment from $(0,0)$ to $(x,y) \in Q$ passes ...

**1**

vote

**0**answers

52 views

### Finding special vectors generated by a matrix

Let $G\in \Bbb Z^{n\times n}$ be a unimodular matrix.
Are there any efficient algorithms to find the maximum norm of a vector $v$ that satisfies $\langle\Delta(v),v\rangle=0$ over all vectors $v\in ...

**3**

votes

**1**answer

269 views

### Geodesic convex hulls in a graph; and their properties

This question asks for an analog of the convex hull in a graph that parallels
(as far as possible) convex sets in Euclidean space.
Let $G$ be a simple, undirected graph, and let $S \subseteq V$ be a ...

**19**

votes

**1**answer

254 views

### Hidden points in polygons

Let $h(n)$ be the largest number of mutually invisible points that can be located in a
polygon $P$ of $n$ vertices. Two points $x$ and $y$ are mutually invisible if the segment
$xy$ contains a point ...

**3**

votes

**0**answers

114 views

### n-dimensional Delaunay Triangulation of Lattices

I have several questions concerning the Delaunay triangulation of a high dimensional lattice.
Given an $n$-dimensional lattice $L$ and its Delaunay triangulation (partition of $R^n$ into simplices ...

**22**

votes

**3**answers

693 views

### Tetrahedron insphere iteration

I know that iterating the following incircle construction approaches an equilateral triangle in the limit:
Starting with any triangle $T$, one forms $T'$ by connecting ...

**0**

votes

**1**answer

55 views

### Optimal radiating $(d{-}1)$-flats within a sphere

Permit me to revisit an earlier unresolved MO question,
"Chord arrangement that avoids confining small or large disks"
with a (very!) specific version, inspired by radiation therapy.
The main idea is ...

**5**

votes

**2**answers

447 views

### Is there a 3d equivalent of this picture?

This question arises apropos of an earlier question I asked that was (VERY!!!) helpfully answered by Anton Petrunin:
Fitting a mesh to a density function
The picture below is the image of a regular ...

**3**

votes

**1**answer

71 views

### Points in general position on a small grid

A point set $P$ is said to be embedded in $\mathbf{Z}^2$ in general position, if no three points lie on a common line. Assume that $|P|=n$, I am interested in the smallest $k \times k$ integer grid in ...

**12**

votes

**2**answers

434 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

**1**answer

163 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

**1**answer

194 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

**0**answers

319 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

**2**answers

167 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 ...

**4**

votes

**1**answer

164 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.

**16**

votes

**4**answers

713 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

**1**answer

199 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

**7**answers

468 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

**3**answers

420 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 ...

**9**

votes

**2**answers

208 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

**2**answers

258 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

**0**answers

115 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 ...

**3**

votes

**1**answer

183 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

**1**answer

150 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 ...

**3**

votes

**1**answer

124 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

**1**answer

116 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 ...