The tag has no wiki summary.

learn more… | top users | synonyms

8
votes
1answer
394 views

Polyhedra that combinatorially shadow a sequence

Let $P$ be a polyhedron in $\mathbb{R}^3$. Say that $P$ combinatorially shadows a sequence of natural numbers $S$ if there is a continuous rotation of $P$ such that its orthogonal-projection shadows ...
10
votes
2answers
800 views

Is the tensor product of polyhedra a polyhedron?

Conventions: A polytope in a finite-dimensional $\mathbb R$-vector space $V$ is defined to be a convex hull of finitely many points in $V$. A polyhedron in a finite-dimensional $\mathbb R$-vector ...
2
votes
2answers
479 views

Dilogarithm, tetrahedrons, and hyperbolic space

The Bloch-Wigner function $D(z)$, gives the volume of a ideal tetrahedron in hyperbolic space $\mathbb H3$, where z is the cross-ratio (z1,z2,z3,z4) parametrizing the tetrahedron in $\mathbb CP1$. ...
2
votes
2answers
276 views

Surface of a Ideal Tetrahedron in Hyperbolic Space H3

The hyperbolic space $\mathbb{H}^3$, has a boundary $\mathbb{CP}^1$. A ideal tetrahedron in $\mathbb{H}^3$, is a tetrahedron, where the four vertices are on the boundary $\mathbb{CP}^1$. The four ...
1
vote
2answers
490 views

Does Euler's formula imply bounds on the degree of vertices in a 3-polytopal graph?

A corollary of Euler's formula tells us that the edge-vertex graph of every convex 3-polyhedron must have a face with either 3, 4, or 5 edges, using an argument about the average degree of vertices. ...
1
vote
1answer
227 views

Polar duality and -1 [closed]

We define the polar dual of a polytope $P$ as the set $$\{x\in \mathbb{R}^n: x \cdot a\geq -1 \text{ for all } a\in P\}$$ Why do we require $-1$ instead of $-2$ or any other constant?
2
votes
1answer
140 views

coarser than triangulations “almost partitions” into simplices

The total space $T$ of an embedded into $\mathbb{R}^n$ pure $n$-dimensional simplicial complex (in other words, the union of finitely many $n$-dimensional compact convex polytopes) sometimes admits an ...
6
votes
1answer
408 views

Wrapping a convex polyhedron with string

This is a meta-question, rather than a specific mathematical question. I am seeking a mathematical definition that captures the following physical idea. Suppose you have a convex polyhedron $P ...
2
votes
1answer
149 views

How can pushing a vertex in a polytope lead to merging facets?

I'm trying to understand the Lemma 2.2 and Corollary 2.3 of Francisco Santos paper "A counterexample to the Hirsch conjecture": http://arxiv.org/abs/1006.2814 Corollary 2.3 is a proof of a result of ...
21
votes
1answer
1k views

Building a genus-$n$ torus from cubes

I wonder if this has been studied: What is the fewest number of unit cubes from which one can build an $n$-toroid? The cubes must be glued face-to-face, and the boundary of the resulting ...
8
votes
2answers
690 views

Fractal Tiling of Rhombic Dodecahedra

Hello, this is my first question on Math Overflow... Rhombic dodecahedra can be tiled in 3-space, leaving no gaps. This tiling corresponds to the close-packing of spheres. Consider a "nucleus" ...
3
votes
1answer
263 views

Grading a non-graded poset as squeezed as possible

Here is a curiosity question (motivated by the recent revamp of ranked-poset routines in Sage). Let $P$ be a finite poset. We look for a family $\left(a_p\right)_{p\in P}$ of real numbers summing up ...
9
votes
1answer
1k views

What nets fold to polyhedra?

There is a classic (and open) problem asking whether every polyhedron can be unfolded to give a non-overlapping net. The converse problem has been studied asking which polygons can be folded in some ...
10
votes
2answers
293 views

Acute triangulation

Assume that $S$ is a finite 2-dimensional simplicial complex equipped with a metric $d$ such that each triangle is isometric to a plane triangle (so $(S,d)$ is a polyhedral space). Is it possible ...
5
votes
0answers
295 views

Maximum volume convex body coverable by a unit square

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected) pieces (where $k=1$ means just the square). Your task is to construct the largest volume convex body ...
8
votes
3answers
643 views

Efficient topological triangulations of non-convex polyhedra

Does every polyhedron in $\mathbb{R}^3$ with $n$ triangular facets have a topological triangulation with complexity $O(n)$? Suppose $P$ is a non-convex polyhedron in $\mathbb{R}^3$ with $n$ ...
11
votes
0answers
280 views

Update to Shephard's “Twenty Problems on Convex Polyhedra”

Forty-three years ago, Geoffrey Shephard published an influential list of open problems on convex polyhedra. Progress has been made on several of his problems, and perhaps some have been completely ...
13
votes
2answers
2k views

How many vertices/edges/faces at most for a convex polyhedron that tiles space?

I wonder if this problem has already been examined before: Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have? ...
17
votes
2answers
801 views

Placing points on a sphere so that no 3 lie close to the same plane

Motivation I am working with arbitrary parallelopiped tilings given by projection from a higher dimensional space. The collection of tiles, and some properties of the higher dimensional space are ...
4
votes
2answers
208 views

What is the smallest diameter ring a non-convex polyhedron can pass through in 3-space?

The question is mostly in the title. Imagine I have some non-convex polyhedron $P$, and I would like to find the smallest diameter ring that it can pass through in 3-space, undergoing any necessary ...
7
votes
3answers
644 views

Not quite regular polyhedra

Take a naive interpretation of regular polyhedra: All vertices (including epsilon ball) congruent All edges congruent All faces congruent We can now find interesting families by removing one ...
4
votes
1answer
1k views

intersection of convex and non-convex polyhedra

Hi everyone, I am trying to find the best appropriate way to intersect polyhedra which may be non-convex. The number of vertices that build the polyhedron is hence always small (up to 20 or so). ...
7
votes
3answers
2k views

polyhedra with equilateral pentagons faces.

In page http://loki3.com/poly/isohedra.html around six polyhedra with equilateral pentagons as faces are shown: a pyritohedron, icositetrahedrons... Is there a complete list of this kind of polyhedra? ...
4
votes
1answer
380 views

Are there non-tiling polyhedra that pack arbitrarily well?

The fact that an upper bound on the packing density $< 1$ has only recently been exhibited for regular tetrahedra in $\mathbb{R}^3$ (see this question) suggests that proving concrete bounds of ...
33
votes
1answer
1k views

Pach's “Animals”: What if the genus is positive?

Janos Pach asked a deep question 23 years ago (1988) that remains unsolved today: Can every animal—a topological ball in $\mathbb{R^3}$ composed of unit cubes glued face-to-face—be ...
1
vote
2answers
225 views

how to estimate a polyhedron(convex hull) classifier from data sample

Given a set of points $X\in\Re^D$, they have labels $Y\in${$-1,+1$}. I would like to separate the data labeled +1 and the data labeled -1 by a polyhedron. $min_w \sum_i \xi_i + \frac{1}{2}\|w\|_2^2$ ...
2
votes
1answer
1k views

Finding a minimum bounding sphere for a frustum

I have a frustum (truncated pyramid defined by six planes) and I need to compute a bounding sphere for this frustum that's as small as possible. I can choose the centre of the sphere to be right in ...
0
votes
1answer
336 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 ...
19
votes
2answers
921 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 ...