Related papers: A Geometric Approach to Sample Compression
We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…
Superquadrics provide a compact representation of common shapes and have been used both for object/surface modelling in computer graphics and as object-part representation in computer vision and robotics. Superquadrics refer to a family of…
For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…
We analyze a macroscopic model with a maximal density constraint which describes short range repulsion in biological systems. This system aims at modeling finite-size particles which cannot overlap and repel each other when they are too…
This article employs fluid equations to analyse muon beams in gases subject to crossed electric and magnetic fields, focussing in particular on a scheme proposed by D. Taqqu in 2006, whereby transverse compression of the beam is achieved by…
In this paper we will prove a shape theorem for the last passage percolation model on a two dimensional $F$-compound Poisson process, called the Hammersley model with random weights. We will also provide diffusive upper bounds for shape…
Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the…
Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars,Yap'91]. There are faster algorithms known for several…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
Let P be a locally finite disk pattern on the complex plane C whose combinatorics are described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function \Theta:E\to [0,\pi/2] on…
We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is…
Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…
Toeplitz matrices are abundant in computational mathematics, and there is a rich literature on the development of fast and superfast algorithms for solving linear systems involving such matrices. Any Toeplitz matrix can be transformed into…
Very soft grain assemblies have unique shape-changing capabilities that allow them to be compressed far beyond the rigid jammed state by filling void spaces more effectively. However, accurately following the formation of these systems by…
A cutting-plane model for a nonsmooth function is the maximum of several first-order expansions centered at different points. Using such a model in a bundle method leads to linear convergence (of serious steps) to a minimum. In smooth…
The Poisson-sampling technique eliminates dependencies among symbol appearances in a random sequence. It has been used to simplify the analysis and strengthen the performance guarantees of randomized algorithms. Applying this method to…
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…