Related papers: Pythagorean Boxes with Primitive Faces
Part I: The two-dimensional Pascal Triangle will be generalized into a three-dimensional Pascal Pyramid and four-, five- or whatsoever-dimensional hyper-pyramids. Part II: The Bilateral Binomial Theorem will be generalised into a Bilateral…
Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem of finding the minimum L0 norm representation for y is a hard problem. The Basis Pursuit (BP)…
A \emph{rational orthogonal matrix} $Q$ is an orthogonal matrix with rational entries, and $Q$ is called \emph{regular} if each of its row sum equals one, i.e., $Qe = e$ where $e$ is the all-one vector. This paper presents a method for…
We construct a unilateral lattice tiling of $\mathbb{R}^n$ into hypercubes of two differnet side lengths $p$ or $q$. This generalizes the Pythagorean tiling in $\mathbb{R}^2$. We also show that this tiling is unique up to symmetries, which…
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of…
Primordial black holes (PBHs) can form from gravitational collapse of large overdensities in the early Universe, giving rise to rich phenomena in astrophysics and cosmology. We develop a novel, general, and systematic method based on theory…
Primordial black holes (PBHs) are usually assumed to be described by the Schwarzschild or Kerr metrics, which however feature unwelcome singularities. We study the possibility that PBHs are non-singular objects, considering three…
Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…
Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…
While every polyadic algebra ($\PA$) of dimension 2 is representable, we show that not every atomic polyadic algebra of dimension two is completely representable; though the class is elementary. Using higly involved constructions of Hirsch…
Ultralight primordial black holes (PBHs) provide a compelling window into early-Universe cosmology. Following our earlier work, we explore a mechanism for the formation of ultralight PBHs sourced by primordial inflationary magnetic fields,…
A smooth geometrically connected curve over the finite field $\mathbb{F}_q$ with gonality $\gamma$ has at most ${\gamma(q+1)}$ rational points. The first author and Grantham conjectured that there exist curves of every sufficiently large…
Complex interval arithmetic is a powerful tool for the analysis of computational errors. The naturally arising rectangular, polar, and circular (together called primitive) interval types are not closed under simple arithmetic operations,…
The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…
In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…
Peter McMullen has developed a theory of realizations of abstract regular polytopes, and has shown that the realizations up to congruence form a pointed convex cone which is the direct product of certain irreducible subcones. We show that…