**3**

votes

**1**answer

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

**1**

vote

**2**answers

337 views

### Discrete Laplace operator and its eigenvalues

I wonder is there any geometric interpretation of the eigenvalues of the discrete Laplace operator on graphs? Maybe there is a relationship between the eigenvalues and combinatorial properties of ...

**22**

votes

**3**answers

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

**2**

votes

**2**answers

355 views

### Sphere - Symmetry and Triangulation [closed]

The sphere is symmetric with respect to any rotation. However, it loses this property as soon as it is triangulated. Are there sequences of triangulations that possess particular large symmetry groups ...

**0**

votes

**1**answer

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

**2**

votes

**1**answer

2k views

### Number of 3-tuple partitions of a multiple of three which follow the triangle inequality

Given n=3t, t$\in \mathbb N$; let $\mathbb L_3$ be set of all distinct integer partitions of n having 3 parts; say $\lambda_1,\lambda_2,\lambda_3$ .
If I chose any one partition randomly from ...

**1**

vote

**1**answer

94 views

### Softwares to draw euclidean polyhedral surfaces

Let $S$ be an abstract euclidean polyhedral surface. By this, I mean a orientable compact 2D topological surface obtained by gluing together some (convex) euclidean polygons (arbitrary genus).
...

**5**

votes

**2**answers

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

**5**

votes

**1**answer

443 views

### What are the essential properties of algebraic closure on an arbitrary structure?

Define the "model theoretic" notion of a closure function as follows:
Definition (1): Let $D$ be a non-empty set. A function $cl:P(D)\longrightarrow P(D)$ called a closure function iff it has the ...

**6**

votes

**2**answers

423 views

### Embedding points in 2D based on distance estimates?

Suppose we have a collection of exactly $N$ points (say $N=1000$), with each point belonging to 2-dimensional Euclidean space $\mathbb{R}^2$, but we don't know the coordinates of the points. Suppose ...

**7**

votes

**1**answer

256 views

### Curvature flows for PL closed curves in the plane?

I'm curious to what extent people have studied "curvature flows" on PL closed curves in the plane.
There's a paper by Gage and Hamilton from 1986 that describes the long-term behaviour of smooth ...

**1**

vote

**0**answers

79 views

### Group actions on polytopes in indefinite integer lattices

Is anything at all known about polytopes in indefinite integer lattices? I'm interested in lattice automorphisms which preserve certain polytopes of "high regularity" (e.g. cones). As a first step, ...

**3**

votes

**0**answers

294 views

### Tiling a rectangle with weighted cells (min-max problem)

I have been struggling with a research problem. The problem can be formalized as follows:
Given a $n\times m$ matrix $A$ containing cells with non-negative integer values, partition it in $J$ ...

**3**

votes

**1**answer

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

**8**

votes

**1**answer

259 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

**1**answer

110 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

**1**answer

273 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$. ...

**2**

votes

**0**answers

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

**17**

votes

**0**answers

840 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

**3**answers

506 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

**2**answers

928 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

**2**answers

571 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

208 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

232 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

388 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

199 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

**1**answer

204 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

**1**answer

202 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

**4**answers

1k 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 ...

**14**

votes

**1**answer

303 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

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

**12**

votes

**3**answers

584 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

**2**answers

254 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

**2**answers

180 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

**2**answers

399 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

**2**answers

152 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

**3**answers

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

**10**

votes

**2**answers

231 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

336 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

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

**15**

votes

**2**answers

692 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

**0**answers

93 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

**0**answers

138 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

**1**answer

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

**6**

votes

**1**answer

532 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

**1**answer

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

**11**

votes

**2**answers

793 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

**1**answer

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

**7**

votes

**2**answers

235 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

**1**answer

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