**10**

votes

**1**answer

416 views

### Random geometric graphs and spanners

I would grateful to learn of work mixing
random geometric graphs with random graphs under
the
Erdős-Renyi model, and in particular concerning spanners.
Select $n$ points uniformly at random from the ...

**6**

votes

**2**answers

607 views

### Lattice Stick Number vs. Stick Number of Knot

Can the lattice stick number of a knot be bounded
by the stick number of the knot?
The stick number
$S(K)$ of a knot $K$ is the fewest number of segments
needed to realize it by a simple 3D ...

**20**

votes

**5**answers

847 views

### Iterated Circumcircle

Take three noncollinear points (a,b,c), compute the center of their circumcircle x, and replace a random one of a,b,c with x. Repeat. It seems this process may converge to a point, assuming no ...

**6**

votes

**2**answers

483 views

### Generalization of Hamiltonian cycles to “Hamiltonian spheres”

One possible generalization of a Hamiltonian cycle in a triangulated plane graph is what could be
called a Hamiltonian sphere: a collection of triangles within a simplicial complex in $\mathbb{R}^3$
...

**5**

votes

**2**answers

419 views

### Making 'circles' on a lattice/ Making distinct fractions from partitions of a number

First formulation: discrete geometry
Pick your favourite 2D square lattice (I'm sure we all have one...) and try to place n points 'in a circle' (that is: in general position [no 3 should be ...

**4**

votes

**4**answers

562 views

### Upper bound for the number of subsets of N points which exhaust their convex hull

Hello.
Looking at a set S of N points in the plane, I call a subset B of S "legal" if the set of points contained in the convex hull of B is exactly B itself. In other words, a subset B of S in legal ...

**12**

votes

**3**answers

1k views

### When are Ehrhart functions of compact convex sets polynomials?

Given a lattice $L$ and a subset $P\subset \mathbb R^d$, we define for each positive integer $t$ $$f_P(L,t)=|(tP\cap L)|$$ the number of lattice points in $tP$. Let's say $P$ is nice if $f_P(L,t)$ is ...

**3**

votes

**2**answers

929 views

### What is the definition of ideal boundary?

In many papers about dynamical system, I found the word " ideal boundary". T don't know what is the definition of ideal boundary.

**8**

votes

**2**answers

1k views

### Which finite groups are generated by n involutions?

One of the interesting problems in abstract polytope theory is to determine, for a given finite group, when that group is the automorphism group of a regular abstract polytope. This is equivalent to ...

**16**

votes

**3**answers

1k views

### Gauss-Bonnet Theorem for Graphs?

One can define the Euler characteristic χ for a graph as the number of vertices minus the number of edges. Thus an n-cycle has χ = 0 and K4 has χ = –2.
Is there an analog for the ...

**6**

votes

**3**answers

677 views

### Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance Part II

For some context see Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance
As per Noah's answer and JBL's comment this was false as stated. However, I think the following ...

**9**

votes

**1**answer

436 views

### Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance

Problem: Consider a random walk on the lattice $\mathbb{Z}^2$ where on each iteration a particle either stays at its current location or moves to a neighboring vertex with probability 1/5. We start ...

**4**

votes

**2**answers

263 views

### Centralizing four red vectors in six green sectors

Four red vectors are given, one per quadrant, $[0,90^\circ)$,
$[90^\circ,180^\circ)$, etc.
A rigid star of six green vectors separated by $60^\circ$
can be positioned at
$(\theta,
\theta+60^\circ,
...

**17**

votes

**3**answers

1k views

### Cutting convex sets

Any bounded convex set of the Euclidean plane can be cut into two convex pieces of equal area and circumference.
Can one cut every bounded convex set of the Euclidean plane into an arbitrary number ...

**49**

votes

**5**answers

3k views

### Can an arbitrary collection of circles of total area 1/2 fit into a circle of area 1?

Assume the circles are actually open disks, otherwise two circles each of area $\frac{1}{4}$ wouldn't fit into the circle of area 1.
This seems like it should be true, thinking about packing ...

**4**

votes

**2**answers

291 views

### Characterization of combinatorial manifolds in terms of links

I need to reference the following result. Do you know a good source?
The following conditions on an $n$-dimensional simplicial complex $S$ are equivalent:
a) $S$ is an $n$ manifold;
b) The link of ...

**3**

votes

**2**answers

2k views

### fit 4 circles within a square

If I have a square and want to place four equally large circles within this square, how large can the maximum radius be (compared to the lenght of the side of the square)?
Just an answer would be ok, ...

**5**

votes

**1**answer

440 views

### Isometric embedding of a positively curved polyhedral surface

Suppose you have a 2-dimensional polyhedral surface with specified lengths for the edges so that the vertices all have positive curvature. I believe this has a unique isometric embedding into ...

**5**

votes

**2**answers

509 views

### Maximal area coverable by $k$ disjoint isosceles triangles contained in a triangle of area 1.

Given a triangle $\Delta$ of unit area, how much area can always be covered by $k$ isosceles triangles contained in $\Delta$ and intersecting at most at their boundaries?
The answer is easy for ...

**16**

votes

**4**answers

2k views

### Why is complex projective space triangulable?

In an exercise in his algebraic topology book, Munkres asserts that $\mathbf{C}P^n$ is triangulable (i.e., there is a simplicial complex $K$ and a homeomorphism $|K| \rightarrow \mathbf{C}P^n$). Can ...

**33**

votes

**2**answers

1k views

### What is the oriented Fano plane?

One way to remember the multiplication table of the octonions is to use the following diagram (which I got from John Baez's online paper): if $(e_i,e_j,e_k)$ is one of the lines listed according to ...

**17**

votes

**4**answers

1k views

### What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs?

This problem was posed in March 2010 at G4G9 in a talk by the Japanese mathematician Hirokazu "Iwahiro" Iwasawa. He claims there is a simple proof that N > 10, though he did not share it with the ...

**2**

votes

**0**answers

196 views

### Is there any symmetric unshellable triangulation of a tetrahedron?

M. Rudin gave a triangulation of a tetrahedron with the property that after any small tetrahedron removed, the remaining part is not homeomorphic to a ball (An unshellable triangulation of a ...

**2**

votes

**2**answers

2k views

### Best fit for multiple shapes inside an area

Is there a forumla to come up with the best fit for multiple shapes inside a rectangular area, so that none of the shapes are overlapping?

**17**

votes

**3**answers

2k views

### How many unit squares can you pack into a rectangle with nearly integer side lengths?

Earlier today, somebody asked what looks like a homework problem, but admits the following reading which I think is interesting:
Suppose $a_1,\dots, a_n$ are positive integers, and $\varepsilon$ ...

**4**

votes

**1**answer

813 views

### The Join of Simplicial Sets ~Finale~

Background
Let $X$ and $S$ be simplicial sets, i.e. presheaves on $\Delta$, the so-called topologist's simplex category, which is the category of finite nonempty ordinals with morphisms given by ...

**70**

votes

**5**answers

6k views

### Is there a dense subset of the real plane with all pairwise distances rational?

I heard the following two questions recently from Carl Mummert, who encouraged me to spread them around. Part of his motivation for the questions was to give the subject of computable model theory ...

**48**

votes

**3**answers

5k views

### What is the status of the Gauss Circle Problem?

For $r > 0$, let $L(r) = \# \{ (x,y) \in \mathbb{Z}^2 \ | \ x^2 + y^2 \leq r^2\}$ be the number of lattice points lying on or inside the standard circle of radius $r$. It is easy to see that $L(r) ...

**2**

votes

**1**answer

201 views

### Are combinatorial configurations whose Levi graphs may be represented as covering graphs over voltage graphs realizable with pseudolines?

This question is related to this previous question. Many combinatorial configurations have Levi graphs which may be represented as derived graphs obtained from voltage graphs over a cyclic group; in a ...

**2**

votes

**0**answers

265 views

### Drawing a combinatorial 3-configuration of points and lines with pseudolines

This question is related to the question of drawing a combinatorial 3-configuration of points and lines with straight lines. We only relax the condition and admit drawings with pseudolines. Let us ...

**11**

votes

**2**answers

690 views

### Drawing 3-configurations of points and lines with straight lines

It is well-known that the black-and-white coloring of the Heawood graph on 14 vertices determines a combinatorial 3-configuration with 7 "points" and 7 "lines", known as Fano plane. Similarly, any ...

**1**

vote

**1**answer

203 views

### How to compute the number of regular spheres needed to fill a rectangular space

Computing the volume of a sphere is straightforward 4/3*pi*R^3
As is the volume of a rectangular space length*width*height (e.g. 10*10*6)
How might I go about determining how many spheres would fit ...

**20**

votes

**2**answers

2k views

### Is it possible to dissect a disk into congruent pieces, so that a neighborhood of the origin is contained within a single piece?

Problem: is it possible to dissect the interior of a circle into a finite number of congruent pieces (mirror images are fine) such that some neighbourhood of the origin is contained in just one of ...

**1**

vote

**3**answers

5k views

### Compute the Centroid of a 3D Planar Polygon

Given a list of 3D coordinates that define the surface( Point3D1, Point3D2, Point3D3, and so ...

**27**

votes

**3**answers

2k views

### Is the ratio Perimeter/Area for a finite union of unit squares at most 4?

Update: As I have just learned, this is called Keleti's perimeter area conjecture.
Prove that if H is the union of a finite number of unit squares in the plane, then the ratio of the perimeter and ...

**9**

votes

**3**answers

12k views

### Dividing a square into 5 equal squares

Can you divide one square paper into five equal squares?
You have a scissor and glue. You can measure and cut and then attach as well. Only condition is You can't waste any paper.

**30**

votes

**4**answers

2k views

### Tiling A Rectangle With A Hint of Magic

Here's a a famous problem:
If a rectangle $R$ is tiled by rectangles $T_i$ each of which has at least one integer sidelength, then the tiled rectangle $R$ has at least one integer side length.
...

**5**

votes

**4**answers

1k views

### Coloring Points in the Plane

Suppose one wants to color the points in the plane so any two points at distance one apart are different colors. How many colors are needed?
I heard this problem when I was a kid. Back then the most ...

**0**

votes

**1**answer

345 views

### Tetris in 3D with 5 units [closed]

Background: There are 7 "bricks" used in the game of Tetris. These are the 7 unique combinations of 4 unit squares in which every square shares at least one edge with another square. ("unique" in this ...

**23**

votes

**3**answers

7k views

### Cutting a rectangle into an odd number of congruent pieces

We are interested in tiling a rectangle with copies of single tile (rotations and reflexions are allowed). This is very easy to do, by cutting the rectangle into smaller rectangles.
What happens when ...

**15**

votes

**1**answer

787 views

### Are there analogues of Desargues and Pappus for block designs?

Finite projective planes are fascinating objects from many perspectives. In addition to the geometric view, they can be viewed as combinatorial block designs.
From the geometric perspective, there ...

**8**

votes

**6**answers

994 views

### Combinatorial distance ≡ Euclidean distance

Definition: A polytope has property X iff there is a function f:N+ → R+ such that for each pair of vertices vi, vj the following holds:
disteuclidean(vi, vj) = f(distcombinatorial(vi, vj))
with ...

**4**

votes

**4**answers

2k views

### Number of spanning trees in a grid

Given a $\sqrt{n}\times\sqrt{n}$ piece of the integer $\mathbb{Z}^2$ grid, define a graph by joining any two of these points at unit distance apart. How many spanning trees does this graph have ...

**3**

votes

**1**answer

363 views

### Convex n-polytope general position vectors to general position vectors of tetrahedron

I asked this question in a comment to this question, but got no response. I thought that perhaps it needed more exposure, so I made it a question in itself.
Define a set of general position vectors ...

**19**

votes

**2**answers

991 views

### Four Dimensional Origami Axioms

What are the axioms of four dimensional Origami.
If standard Origami is considered three dimensional, it has points, lines, surfaces and folds to create a three dimensional form from the folded ...

**25**

votes

**6**answers

2k views

### When shorter means smaller?

Assume a convex figure $F\subset \mathbb R^2$ satisfies the following property: if $f:F\to \mathbb R^2$ is a distance-non-increasing map then its image $f(F)$ is congruent to a subset of $F$.
Is it ...

**13**

votes

**2**answers

1k views

### The Sylvester Gallai Theorem and Sections of Varieties with “Simple Topology”.

The Sylvester-Gallai theorem asserts that for every collection of points in the plane, not all on a line, there is a line containing exactly two of the points.
One high dimensional extension ...

**3**

votes

**3**answers

274 views

### Are there infinite sets of stellations of polyhedra?

Lists of stellations of polyhedrons are given particular rules like in the book The Fifty Nine Icosahedra which follows "Miller's Rules".
There seems to be no "correct" ruleset to use, so more ...

**40**

votes

**12**answers

2k views

### Can a discrete set of the plane of uniform density intersect all large triangles?

Let S be a discrete subset of the Euclidean plane such that the number of points in a large disc is approximately equal to the area of the disc. Does the complement of S necessarily contain triangles ...

**9**

votes

**4**answers

470 views

### What is the right way to think about / represent general tilings?

For periodic/symmetric tilings, it seems somewhat "obvious" to me that it just comes down to working out the right group of symmetries for each of the relevant shapes/tiles, but its not clear to me if ...