Related papers: Maximum Solow--Polasky Diversity Subset Selection …

We prove that universal differentiability sets in Euclidean spaces possess distinctive structural properties. Namely, we show that any universal differentiability set contains a `kernel' in which the points of differentiability of each…

Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…

We study several rigidity properties of $p$-adic local systems on a smooth rigid analytic space $X$ over a $p$-adic field. We prove that the monodromy of the log isocrystal attached to a $p$-adic local system is ''rigid'' along irreducible…

The Maximum Mean Discrepancy (MMD) is a cornerstone statistic for nonparametric two-sample testing, but its test power is dictated entirely by the chosen kernel. Because any fixed kernel inherently fails to distinguish certain…

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

A new method is proposed for variable screening, variable selection and prediction in linear regression problems where the number of predictors can be much larger than the number of observations. The method involves minimizing a penalized…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Given an $n$-point metric space $(\mathcal{X},d)$ where each point belongs to one of $m=O(1)$ different categories or groups and a set of integers $k_1, \ldots, k_m$, the fair Max-Min diversification problem is to select $k_i$ points…

We present a self-contained separation framework for P vs NP developed entirely within ZFC. The approach consists of: (i) a deterministic, radius-1 compilation from uniform polynomial-time Turing computation to local sum-of-squares (SoS)…

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance between points in the same part of the partition is minimized.…

Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…

We determine set-theoretic defining equations for the variety of hypersurfaces of degree d in an N-dimensional complex vector space that have dual variety of dimension at most k. We apply these equations to the Mulmuley-Sohoni variety, the…

We present a topological barrier to efficient computation, revealed by comparing the geometry of 2 SAT and 3 SAT solution spaces. Viewing the set of satisfying assignments as a cubical complex within the Boolean hypercube, we prove that…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

Let $({\bf U},{\bf S},d)$ be an instance of Set Cover Problem, where ${\bf U}=\{u_1,...,u_n\}$ is a $n$ element ground set, ${\bf S}=\{S_1,...,S_m\}$ is a set of $m$ subsets of ${\bf U}$ satisfying $\bigcup_{i=1}^m S_i={\bf U}$ and $d$ is a…

The rigidity of the positive mass theorem states that the only complete asymptotically flat manifold of nonnegative scalar curvature and zero mass is Euclidean space. We prove a corresponding stability theorem for spaces that can be…

We prove that every usco multimap $\Phi:X\to Y$ from a metrizable separable space $X$ to a GO-space $Y$ has an $F_\sigma$-measurable selection. On the other hand, for the split interval $\ddot{\mathbb I}$ and the projection $P:\ddot{\mathbb…

Given a set of $n$ points in $\mathbb R^d$, the (monochromatic) Closest Pair problem asks to find a pair of distinct points in the set that are closest in the $\ell_p$-metric. Closest Pair is a fundamental problem in Computational Geometry…

We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…