The tag has no wiki summary.

learn more… | top users | synonyms

6
votes
2answers
212 views

convex polytopes with many faces and edges but few cells and vertices

For a convex polytope $P$ in $\mathbb R^4$, denote by $N_0,N_1,N_2,N_3$ respectively the number of vertices, edges, faces, cells. By Euler's formula, we know $N_0+N_2=N_1+N_3$, which means there is a ...
7
votes
1answer
202 views

Integer points in dilations of a disk of volume one

The following question is related to When are Ehrhart polynomials polynomials?. For a positive integer $n$, let $i(D,n)$ be the number of integer points in the disk $x^2+y^2\leq n^2/\pi$, so $i(D,n) ...
13
votes
2answers
1k 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? ...
1
vote
1answer
378 views

Combinatorial optimization and graph coloring

I am considering the following problem: (i) Fix $n$ and color the edges of $K_n$ red and blue arbitrarily. (ii) Let $M$ be the set of monochromatic triangles in $K_n$ and define $g:M\rightarrow ...
0
votes
0answers
97 views

Question regarding contiguous forms

I read about contiguous forms in Achill Scürmann's thesis on positive quadratic forms. I am wondering about one aspect of the Voronoi algorithm presented in there, that enumerates all arithmetically ...
1
vote
0answers
137 views

Traversing perfect quadratic forms

I am wondering whether there is an efficient algorithm to traverse all the $N\times N$ perfect quadratic forms $Q$ inside the polyhedron $e_j^T Q e_j \geq 1$, $j = 1\ldots m$, where $e_j$ are some ...
4
votes
0answers
139 views

Slices of Simplices that are Simplices, Reference?

I am trying to find a reference for the following fact. It is elementary and not hard to prove, but I haven't been able to find the question treated anywhere. Let $A$ be an $l\times n$ matrix with ...
2
votes
2answers
360 views

the minimal diameter of a quadrilateral

Let a convex quadrilateral ABCD with perimeter 1,d is the maximum of AB,AC,AD,BC,BD,CD,prove that d is not less than 1/3 we can prove that parallelogram ABCD with perimeter 1,than one of AC,BD is ...
1
vote
3answers
276 views

Enumerating Perfect Lattices

I have a question regarding enumeration of perfect lattices/quadratic forms. In the thesis of Achill Schürmann http://fma2.math.uni-magdeburg.de/~achill/public/habil.pdf there is an algorithm called ...
4
votes
1answer
531 views

Why is the Street nerve of the Gray tensor product $[1]\otimes [1]$ isomorphic to $[1]\times [1]$

Recall that given two strict ω-categories $A$ and $B$, their lax Gray tensor product $A\otimes B$ is sent to the Verity-Gray tensor product of their associated complicial sets ...
17
votes
1answer
449 views

Largest possible volume of the convex hull of a curve of unit length

What is the largest possible volume of the convex hull of an open/closed curve of unit length in $\mathbb{R}^3$?
7
votes
1answer
340 views

Building a polyhedron from areas of its faces

Is there a known algorithm which, given a finite multiset (unordered list) of integers $A$, returns a yes/no answer for ...
12
votes
2answers
219 views

Smallest containing simplex

Let $V_n$ be the least real number such that for every convex subset of $\mathbb{R}^n$ with hypervolume $1$ there is a containing simplex with hypervolume $V_n$. What is known about $V_n$? Is there a ...
7
votes
2answers
237 views

$\kappa$-coloring of $\mathbb{R}^2$ and triangle with area 1

What is the largest cardinal number integer $\kappa$ such that every $\kappa$-coloring of $\mathbb{R}^2$ contains a triangle with area 1 and all vertices of the same color?
19
votes
8answers
1k views

Higher-dimensional Catalan numbers?

One could imagine defining various notions of higher-dimensional Catalan numbers, by generalizing objects they count. For example, because the Catalan numbers count the triangulations of convex ...
1
vote
1answer
467 views

On lattice points “far inside” convex lattice polygons

Let $\mathcal{P}$ be a convex lattice polygon with $n$ vertices and let $\mathcal{L}$ be the set of all lattice points inside $\mathcal{P}$. For every $n \geq 5$, does there exist a point in ...
8
votes
7answers
760 views

Omniscient bots gathering on $\mathbb{Z}^2$

There are $N=n^2$ "bots" on distinct integer lattice points in the plane. Each knows the positions $p_i$ of all bots, and each has unlimited (private) memory. Each executes the same algorithm ...
1
vote
0answers
136 views

When is the conical hull of a finite set of vectors a subset of the space? (and tilings)

Consider a hypercube in n-dimensions, and take some projection down to an m-dimensional subspace. Now take all vertices and m-1 dimensional facets visible from some direction outside the projection. ...
9
votes
3answers
689 views

Point sets in Euclidean space with a small number of distinct distances

It is well known and not hard to prove that the regular simplex in n-dimensions is the only way to place n+1 points so that the distance between distinct pairs of points is always the same. My general ...
4
votes
2answers
248 views

Isostatic graphs and the Henneberg conjecture

I have been reading "Combinatorial Rigidity" by Graver, Servatius and Servatius and I am interested in their chapter on rigidity in dimension $\geq$ 3. I have two questions. What is the current ...
2
votes
0answers
138 views

Minimally 6-connected 3D discrete lines that are convex lattice sets

There are several definitions of 3D discrete lines, e.g. http://diwww.epfl.ch/w3lsp/publications/discretegeo/nratddl.html , http://dx.doi.org/10.1007/978-3-642-19867-0_4 . However, I know of none that ...
1
vote
4answers
480 views

Decomposition of inner horns

Hi guys, I have a question. Prove or disproof the statement: Any inner horn $\Lambda[n,k],0< k< n $ admits a filtration $\mathbf{n}<\cdots<\Lambda[n,k]$, such that each step is filling an ...
4
votes
1answer
321 views

Convex tilings of the plane

For convex polyhedra you have Steinitz's theorem characterizing them as the 3-connected planar graphs. My question is not about spheric tilings, but about periodic tilings of the euclidean plane. Is ...
7
votes
3answers
620 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 ...
3
votes
0answers
228 views

Polygon illumination with perturbed reflections

Here is a variation on the classical polygon illumination problem. For $c \geq 0$ we say that a mirror has reflection index $c$ if whenever a ray hits the mirror with angle of incidence $\alpha$ then ...
9
votes
3answers
705 views

Polytopes with few vertices.

Suppose I have a convex polytope in $\mathbb{R}^d$ which I know has few vertices (in the case which prompted this question, I seem to have a polytope in $\mathbb{R}^9$ which has sixteen vertices). Is ...
6
votes
1answer
236 views

Simplices in convex polytopes

This question is a direct generalization of: Counting the (additive) decompositions of a quadratic, symmetric, empty-diagonal and constant-line matrix into permutation matrices Given a convex ...
4
votes
0answers
407 views

Intersection of pencils in $\mathcal{R}^2$

Consider $9n$ pencils through non-collinear points $p_1, \ldots , p_{9n}$ in $R^2$ each consisting of at most $n$ concurrent lines. Define the intersection $S$ of these pencils to be the set of points ...
6
votes
2answers
508 views

Maximal number of edges and triangular cells for n points in a triangular lattice

Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points. What is the maximum, over all such subsets, of the number of edges? This ...
4
votes
1answer
330 views

A “join” of ω-categorical simplices

Recall that the category of level trees $\mathcal{T}$ is defined to be the category $[\mathbb{N}^{op},\Delta_a]$, where $\Delta_a$ is the skeleton of the category of finite possibly empty linearly ...
10
votes
2answers
1k views

Subdivision of triangles into congruent triangles

Recently some old notes of mine have gotten me to thinking about the problem of subdividing a triangle into $N$ smaller triangles, all congruent to one another. A little thought shows the following ...
19
votes
1answer
452 views

Voronoi cell of lattices with the same profile

Definition 1. Given a body $V$ in $\mathbb R^n$, the function $p_V\colon \mathbb R_+\to \mathbb R_+$ $$p_V(r)=\mathop{\rm vol} [V\cap B_r(0)]$$ will be called profile of $V$. Definition 2. Define ...
0
votes
1answer
251 views

[Matrices over Z] - An algorithm for calculating the diagonal with elementary operations

Dear mathoverflow, Let $ \left( \begin{array}{cc} a & b \newline c & d \end{array} \right) $ be a matrix with $a, b, c, d \in \mathbb{Z}$, $\gcd(a,b,c,d) = 1$ and $ad - bc = \pm N$, with $N ...
4
votes
2answers
310 views

Approximate search space on a 5x5x5 cube with 3 different possible classes?

Hey all, I read the meta, and I realize this question might be pretty elementary for this site, but I'm having trouble computing this, and I know it won't take too much insight for someone to give me ...
1
vote
1answer
275 views

Large subgroups of the Hamming cube

Let's consider the abelian group $\mathbb{Z}^N_2$ equipped with the Hamming metric (the hypercube). Suppose I have a subgroup of this hypercube (not necessarily a subcube) which is generated by a set ...
2
votes
2answers
312 views

Determining the vector space for application of Cauchy Schwarz

In the paper "On the Erdős distinct distance problem in the plane" by Larry Guth and Nets Hawk Katz, http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.4105v1.pdf they define the functions $d(P)$, ...
2
votes
0answers
245 views

Literature Request: Genus Two Partition Functions

Apologies in advance for what will surely sound like a, "well why can't you just Google it" question, but I'm struggling to find good literature that presents the basic construction of genus two ...
1
vote
1answer
189 views

Equivariant homology of Hilb and torus stable curves

The torus equivariant homology of a compact homogeneous variety $G/B$ may be described by using the "skeleton" consisting of torus fixed points and the torus invariant curves that connect them. ...
8
votes
0answers
296 views

A combinatorial approximation functor sSet->qCat

Let $sSet_J$ denote the category of simplicial sets equipped with the Joyal model structure. Simply by the fact that $sSet_J$ is locally presentable and its class of anodynes ($\neq \mathbf{Cof} \cap ...
6
votes
0answers
582 views

An Ex functor for the contravariant homotopy structure

I'm going to slack on the background and get to the point: Is there a good notion of an $Sd/Ex$ adjunction for $sSet/S$ equipped with the contravariant model structure (cofibrations are monomorphisms ...
22
votes
2answers
932 views

A geometric Ramsey problem

The following problem seems like one to which the answer could well be known: if so, I'd be interested to have a reference. How large does n have to be such that among any n points in the plane you ...
6
votes
0answers
441 views

Historical and terminological questions about Dan Kan's Ex functor and its relation to the classical case of simplicial complexes

Recall that we may define a functor $\xi:\Delta\to \operatorname{Poset}$ sending a simplex $[n]$ to the set of monotone injections $[k]\hookrightarrow [n]$ for $k\geq 0$ (effectively, $k\leq n$ as ...
55
votes
5answers
2k views

Does every polyomino tile R^n for some n?

This is a question posed by Adam Chalcraft. I am posting it here because I think it deserves wider circulation, and because maybe someone already knows the answer. A polyomino is usually defined to ...
53
votes
1answer
2k views

How many cubes cover a bigger cube?

How many $n$-dimensional unit cubes are needed to cover a cube with side lengths $1+\epsilon$ for some $\epsilon>0$? For n=1, the answer is obviously two. For n=2, the drawing below ...
2
votes
1answer
309 views

When are nontopological bistellar flips manifold-preserving?

A topological bistellar flip is the term used by Dougherty, Faber, and Murphy to describe a bistellar flip that does not cause any face of a complex to be duplicated. Suppose we consider a ...
2
votes
1answer
518 views

$n$ lines in general position; there are $n-2$ small triangles

Suppose we have $n$ lines in general position in the plane. Prove that there are at least $n-2$ ''small'' triangles. Here a "small" triangle is a triangle that is not contained in any larger triangle. ...
8
votes
2answers
651 views

Are Penrose tilings universal? Do aperiodic universal tilings exist?

Consider a tiling of the plane using tiles of at least two types (e.g, a Penrose tiling such as that shown at the bottom of this question, which tiles the plane with two types of tiles). List the tile ...
2
votes
2answers
520 views

Counting integral points of a polytope in R^3 (the c_1 coefficient of Ehrhart polynomial)

(Sorry I'm outsider in this field.) I need to count the number of integral points in a convex polytope in $\mathbf{R}^3$. The cones in the dual fan are not necessarily regular (does it create any ...
13
votes
0answers
1k views

Minimum tiling of a rectangle by squares

Given the $n\times m$ rectangle, I want to compute the minimum number of integer-sided squares needed to tile it (possibly of different sizes). Is there an efficient way to calculate this?
14
votes
3answers
1k views

Representation of vectors in $\mathbb{R}^2$ via differences of small vectors.

Is the following fact true? Let $v_1,\ldots, v_k \in \mathbb{R}^2$, $\|v_i\|\leq 1$, be vectors that add up to zero. Does there exist a permutation $\sigma\in S_k$ and vectors $w_1,\ldots, w_k ...