Related papers: Square Packing with Asymptotically Smallest Waste …
Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…
Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…
A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…
A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…
We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to…
It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…
On a compact Riemannian manifold with boundary having positive mean curvature, a fundamental result of Shi and Tam states that, if the manifold has nonnegative scalar curvature and if the boundary is isometric to a strictly convex…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
A novel regression method is introduced and studied. The procedure weights squared residuals based on their magnitude. Unlike the classic least squares which treats every squared residual equally important, the new procedure exponentially…
Given a finite set S in $[0,1]^2$ including the origin, an anchored rectangle packing is a set of non-overlapping rectangles in the unit square where each rectangle has a point of S as its left-bottom corner and contains no point of S in…
We study the least square estimator, in the framework of simple linear regression, when the deviance term $\varepsilon$ with respect to the linear model is modeled by a uniform distribution. In particular, we give the law of this estimator,…
Consider a set P of points in the unit square U, one of them being the origin. For each point p in P you may draw a rectangle in U with its lower-left corner in p. What is the maximum area such rectangles can cover without overlapping each…
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…
Many regularization schemes for high-dimensional regression have been put forward. Most require the choice of a tuning parameter, using model selection criteria or cross-validation schemes. We show that a simple non-negative or…
We study the optimization of the positive principal eigenvalue of an indefinite weighted problem, associated with the Neumann Laplacian in a box $\Omega\subset\mathbb{R}^N$, which arises in the investigation of the survival threshold in…
We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…
We revisit a classical problem in dynamic storage allocation. Items arrive in a linear storage medium, modeled as a half-axis, at a Poisson rate $r$ and depart after an independent exponentially distributed unit mean service time. The…
When the worst case integration error in a family of functions decays as $n^{-\alpha}$ for some $\alpha>1$ and simple averages along an extensible sequence match that rate at a set of sample sizes $n_1<n_2<\dots<\infty$, then these sample…