Related papers: High-dimensional holeyominoes

We consider staged self-assembly systems, in which square-shaped tiles can be added to bins in several stages. Within these bins, the tiles may connect to each other, depending on the glue types of their edges. Previous work by Demaine et…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Rudolph showed that the orbits of any measurable, measure preserving $\mathbb R^d$ action can be measurably tiled by $2^d$ rectangles and asked if this number of tiles is optimal for $d>1$. In this paper, using a tiling of $\mathbb R^d$ by…

We give an upper bound on the volume vol(P*) of a polytope P* dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d. This bound, expressed in terms of the Sylvester sequence, is sharp, and…

In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include…

We consider spherically symmetric Yang-Mills equations with gauge group $SO(d)$ in $d+1$ dimensional Minkowski spacetime. For any given odd $d\geq 11$, we establish existence and uniqueness (modulo reflection symmetry) of exactly $N$ smooth…

Two models of random cones in high dimensions are considered, together with their duals. The Donoho-Tanner random cone $D_{n,d}$ can be defined as the positive hull of $n$ independent $d$-dimensional Gaussian random vectors. The Cover-Efron…

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of…

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

We describe a class of fixed polyominoes called $k$-omino towers that are created by stacking rectangular blocks of size $k\times 1$ on a convex base composed of these same $k$-omino blocks. By applying a partition to the set of $k$-omino…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

We introduce a new infinite family of $d\times 2d$ equiangular tight frames. Many matrices in this family consist of two $d\times d$ circulant blocks. We conjecture that such equiangular tight frames exist for every $d$. We show that our…

We prove that for any $n\geq 4$ there are infinitely many real homotopy types of $2n$-dimensional nilmanifolds admitting generalized complex structures of every type $k$, for $0 \leq k \leq n$. This is in deep contrast to the…

We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$…

Let $E_{d}(\ell)$ denote the space of all closed $n$-gons in $\R^{d}$ (where $d\ge 2$) with sides of length $\ell_1,..., \ell_n$, viewed up to translations. The spaces $E_d(\ell)$ are parameterized by their length vectors $\ell=(\ell_1,...,…

A polyomino is called a development if it can make a box by folding edges of unit squares forming the polyomino. It is known that there are developments that can fold into a box (or boxes) in multiple ways. In this work, we conducted a…

We study the problem of finding a function $f$ with ``small support'' that simultaneously tiles with finitely many lattices $\Lambda_1, \ldots, \Lambda_N$ in $d$-dimensional Euclidean spaces. We prove several results, both upper bounds…