Related papers: Packing Planes in Four Dimensions and Other Myster…
Given a space X we study the topology of the space of embeddings of X into $\mathbb{R}^d$ through the combinatorics of triangulations of X. We give a simple combinatorial formula for upper bounds for the largest dimension of a sphere that…
The theory of optimal design of experiments has been traditionally developed on an Euclidean space. In this paper, new theoretical results and an algorithm for finding the optimal design of an experiment located on a Riemannian manifold are…
It is shown here how prior estimates on the local shape of the universe can be used to reduce, to a small region, the full parameter space for the search of circles in the sky. This is the first step towards the development of efficient…
The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…
Every compact symmetric space $M$ admits a dual noncompact symmetric space $\check{M}$. When $M$ is a generalized Grassmannian, we can view $\check{M}$ as a open submanifold of it consisting of space-like subspaces \cite{HL}. Motivated from…
We introduce and study properties of certain new multifunctional harmonic spaces in the upper halfspace.We prove several sharp embedding theorems for such multifunctional spaces,these results are new even in the case of a single function.
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m <= 6.
The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of…
The classical Busemann-Petty problem (1956) asks, whether origin-symmetric convex bodies in $\mathbb {R}^n$ with smaller hyperplane central sections necessarily have smaller volumes. It is known, that the answer is affirmative if $n\le 4$…
A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…
In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…
We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…
We find the complete rational homology for the finite subset spaces of a $d$-dimensional sphere. We also determine the integral homology in top $d$ degrees and obtain a partial description of it in codimension $d$.
We calculate the Seiberg-Witten invariants of branched covers of prime degree, where the branch locus consists of embedded spheres. Aside from the formula itself, our calculations give rise to some new constraints on configurations of…
Learning well-separated features in high-dimensional spaces, such as text or image embeddings, is crucial for many machine learning applications. Achieving such separation can be effectively accomplished through the dispersion of…
In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…