Related papers: Essential covers of the hypercube require many hyp…
Beineke, Harary and Ringel discovered a formula for the minimum genus of a torus in which the $n$-dimensional hypercube graph can be embedded. We give a new proof of the formula by building this surface as a union of certain faces in the…
We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…
We prove there exists a compact embedded minimal surface in a complete finite volume hyperbolic $3$-manifold $\mathcal{N}$. We also obtain a least area, incompressible, properly embedded, finite topology, $2$-sided surface. We prove a…
We introduce and motivate a conjecture about the existence of complete, 1-dimensional families of covers of an elliptic curve. If the conjecture holds, then it would imply a uniform lower bound of 5 for slope of the moduli space of curves.…
Let $K$ be a centrally symmetric spherical and simplicial polytope, whose vertices form a $\frac{1}{4n}-$net in the unit sphere in $\mathbb{R}^n$. We prove a uniform lower bound on the norms of all hyperplane projections $P: X \to X$, where…
Based on work of P. Balister, B. Bollob\'as, R. Morris, J. Sahasrabudhe and M. Tiba, we show that if a covering system has distinct squarefree moduli, then the minimum modulus is at most 118. We also show that in general the $k^{\rm th}$…
Let $Q_n$ be the cube of side length one centered at the origin in $\mathbb{R}^n$, and let $F$ be an affine $(n-d)$-dimensional subspace of $\mathbb{R}^n$ having distance to the origin less than or equal to $\frac 1 2$, where $0<d<n$. We…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…
In 1950, Erd\H{o}s posed a question known as the minimum modulus problem on covering systems for $\mathbb{Z}$, which asked whether the minimum modulus of a covering system with distinct moduli is bounded. This long-standing problem was…
For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \in…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…
For a $k$-uniform hypergraph $F$ we consider the parameter $\Theta(F)$, the minimum size of a clique cover of the of $F$. We derive bounds on $\Theta(F)$ for $F$ belonging to various classes of hypergraphs.
This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…
We provide a simple method to compute upper bounds on the essential dimension of split reductive groups with finite or connected center by means of their generically free representations. Combining our upper bound with previously known…
In this paper an explicit formula for a lower bound on the volume of a hyperbolic orbifold, dependent on dimension and the maximal order of torsion in the orbifolds' fundamental group, is constructed.
It is proved that if the least modulus of a distinct covering system is 4, its largest modulus is at least 60; also if the least modulus is 3, the LCM of the moduli is at least 120; finally, if the least modulus is 4, the LCM of the moduli…
We conjecture that for every dimension n not equal 3 there exists a noncompact hyperbolic n-manifold whose volume is smaller than the volume of any compact hyperbolic n-manifold. For dimensions n at most 4 and n=6 this conjecture follows…