**2**

votes

**0**answers

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

**1**answer

205 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

452 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

271 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

**1**answer

261 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

277 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

**2**answers

207 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

463 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

**1**answer

297 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

**0**answers

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

**1**answer

159 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

**2**answers

240 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

**1**answer

133 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

121 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

**3**answers

264 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

**0**answers

83 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

**3**answers

607 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

**1**answer

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

**1**answer

118 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

**3**answers

569 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

**5**answers

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

**1**answer

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

**0**

votes

**0**answers

37 views

### Covering the annulus of symmetric convex body

Consider a symmetric convex body $A$ in $R^d$. Now, we draw another object, $A'$, concentric and translated with respect to A and having radius slightly greater than twice to the radius of $A$.
Now ...

**4**

votes

**1**answer

356 views

### Algorithms for covering a rectilinear polygon using the same multiple rectangles

Sorry for the crossing-posting: original post is here
All angles of the polygon (representing a room) are right. It may be convex or concave. Use rectangles of the same size (representing a sensor ...

**6**

votes

**1**answer

264 views

### When is a 0-1 matrix a one-intersection incidence matrix?

The following problem is what motivated my previous MO question.
It is easily seen that for any given 0-1 matrix $M$, one can always find
a set $\mathcal P$ of points, and a set $\mathcal C$ of ...

**5**

votes

**0**answers

432 views

### N-balls covering n-balls

This question is a follow-on question from:
Covering a unit ball with balls half the radius
The questions are these:
Given an arbitrary dimension d, and a unit n-ball in d-dimensional Euclidean ...

**7**

votes

**0**answers

339 views

### Rectangology and squareology

I thought that rectangles were simple, and squares even simpler. Until my research has led me to several questions about rectangles and squares, which I can't solve.
I started by posting this ...

**2**

votes

**1**answer

140 views

### Helly's Theorem for Biconvex Sets

Helly's Theorem states the following. Suppose that $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 ...

**4**

votes

**1**answer

210 views

### convex polyhedron in the unit cube

Let $P$ be a given finite set of points within the $n$-dimensional unit cube. A finite set $Q$ of points within the $n$-dimensional unit cube covers $P$ if $\operatorname{conv}(Q) \supseteq P$ where ...

**1**

vote

**1**answer

109 views

### Deducing Linear Inequalities

Let $X_1,X_2,\ldots,X_n $ be indeterminates. Denote by $S$ the set of all linear inequalities of the form
$X_{i_1}+X_{i_2}+\ldots+X_{i_k} \geq k,$
with $k \in \{ 1,2,\ldots,n \}$ and $1 \leq i_1< ...

**9**

votes

**1**answer

306 views

### Needle probing for a convex body

Suppose there is an unknown closed convex body $K$ of
volume vol$(K) = V$ inside the
unit cube $[-\frac{1}{2}, \frac{1}{2}]^d$ in $\mathbb{R}^d$.
You are permitted to probe with a (one-dimensional)
...

**15**

votes

**2**answers

346 views

### Integer lattice points on a hypersphere

Is the following statement true?
For every integer $n\ge2$ and every integer $k\ge0$ there exists a hypersphere in $\mathbb{R}^n$ (circle, sphere etc) containing exactly $k$ integer lattice ...

**9**

votes

**1**answer

368 views

### Question about tetrahedron decomposition

Are there tetrahedra which can be subdivided into three non-overlapping parts similar to the original? I believe this would require splitting one face into three parts. I know some types of tetrahedra ...

**2**

votes

**1**answer

144 views

### Is this cube packing possible?

I know how to pack $5$ unit squares in a square of side length $2+\frac{\sqrt{2}}{2}$. Is there an $\varepsilon>0$ such that there exists a packing of $9$ unit cubes in a cube of side length ...

**2**

votes

**1**answer

291 views

### Regularity of Delaunay triangulation of a hypercube

First using a three dimensional unit cube as an example for the term "regularity", we can have two possible triangulations:
(A)
(B)
We say the lower triangulation is more "regular" than upper ...

**3**

votes

**0**answers

87 views

### pavings and quadratic forms

Hi,
let $L$ be a lattice isomorphic to $\mathbb{Z}^r$ for some positive integer $r$ and $E=L\otimes \mathbb{R}$.
An integral paving in $E$ is a set $\Sigma$ of integral polytopes (the vertices are ...

**3**

votes

**1**answer

162 views

### Simplex with edges of length at least s having smallest circumradius

Is it true that of all $n$-simplices with edge lengths greater than or equal to some parameter $s$, the regular simplex with edge lengths $s$ has the smallest circumradius? It seems obvious, but I ...

**10**

votes

**1**answer

361 views

### Fano plane drawings: embedding PG(2,2) into the real plane

By a drawing of the Fano plane I mean a system of seven simple curves and
seven points in the real plane such that
every point lies on exactly three curves, and every curve contains
exactly three ...

**9**

votes

**1**answer

306 views

### Maximum number of Vertices of Hypercube covered by Ball of radius R

Let $R>0$ be given and let $H^n$ be the unit hypercube in $\mathbb{R}^n$. The problem I am facing is to find the maximum number of vertices of $H^n$ which can be covered by a closed $n$-dimensional ...

**0**

votes

**1**answer

170 views

### Counting integer points in a Minkowski sum

We have known from Ehrhart theory that if $P$ is a $d$-dimensional polytope of $\mathbb R^n$ which has integer vertices then the number of integer points in $nP$ is a polynomial of degree $d$. We also ...

**2**

votes

**1**answer

123 views

### Realizability of extensions of a free oriented matroid by an independent set

Question:
I am searching for a non-realizable matroid with few dependencies relative to the number of points. Precisely, I would like to find a non-realizable (over $\mathbb{R}$) oriented matroid $M$ ...

**15**

votes

**1**answer

351 views

### Does every convex polyhedron have a combinatorially isomorphic counterpart whose all faces have rational areas?

Does every convex polyhedron have a combinatorially isomorphic counterpart whose faces all have rational areas?
Does every convex polyhedron have a combinatorially isomorphic counterpart whose edges ...

**3**

votes

**1**answer

128 views

### The discrete theory of compressible fluids dynamics

I am working on the discrete theory of compressible fluids dynamics, i.e., numerically solving and simulating the compressible fluids , we are interested in the way using discrete exterior calculus, ...

**12**

votes

**0**answers

360 views

### Drawings of complete graphs with $Z(n)$ crossings

Hill conjectured that the minimum number of crossings in a drawing of the complete graph $K_n$ in the plane is exactly
$$Z(n) = \frac{1}{4} \bigg\lfloor\frac{n}{2}\bigg\rfloor ...

**5**

votes

**1**answer

406 views

### The Cayley Menger Theorem and integer matrices with row sum 2

I just filled a gap in my education by learning about the Cayley-Menger theorem, and the Cayley-Menger determinant:
If $P_0, \dots, P_n$ are $n+1$ point in $\mathbb{R}^n$, and $d_{i,j} = |P_i - P_j|$ ...

**2**

votes

**0**answers

79 views

### rigidity of isoradial graphs

Suppose given a $1$-separated net $\Gamma\subset\mathbb R^2$. Is it true or false that there exists $\delta>0$ and a $\delta$-isoradial graph containing $\Gamma$ as a subset of its vertices?
(I am ...

**27**

votes

**4**answers

759 views

### Can every $\mathbb{Z}^2$ disk be pinball-reached?

Let every point of $\mathbb{Z}^2$ be surrounded by a mirrored disk of radius $r < \frac{1}{2}$,
except leave the origin $(0,0)$ unoccupied by a disk.
Q. Is it the case that every disk can be ...

**4**

votes

**3**answers

256 views

### Perimeter/Neighborhood of a graph on grid

Hello,
I have a $\sqrt{n}\times\sqrt{n}$ lattice graph $G=(V,E)$ i.e. vertices on said 2-dim integer lattice, and two vertices have an edge if their $L_1$ distance is one.
Now I want to claim ...

**2**

votes

**3**answers

430 views

### Strong notions of general position

Hi!
I am looking for notions of general position that are stronger than linear general position.
To illustrate, 3 points in linear general position don't lie on a line. I want a notion that would ...

**1**

vote

**0**answers

283 views

### 2d bin packing problem, with opportunity to optimize the size of the bin

I have been tasked with optimizing a manufacturing process. It is a non-trivial, NP hard problem. The problem is similar to the 2d bin packing problem, but we are trying to optimize the size of the ...