Related papers: On the Average Complexity of the $k$-Level

Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the…

In this paper we study the worst-case complexity of an inexact Augmented Lagrangian method for nonconvex constrained problems. Assuming that the penalty parameters are bounded, we prove a complexity bound of $\mathcal{O}(|\log(\epsilon)|)$…

Let $\Delta$ denote a non-degenerate $k$-simplex in $\mathbb{R}^k$. The set $\text{Sim}(\Delta)$ of simplices in $\mathbb{R}^k$ similar to $\Delta$ is diffeomorphic to $O(k)\times [0,\infty)\times \mathbb{R}^k$, where the factor in $O(k)$…

We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \ge d_2 \ge \dots \ge d_n$ be the vertex…

In this paper, we present a linear-time approximation scheme for $k$-means clustering of \emph{incomplete} data points in $d$-dimensional Euclidean space. An \emph{incomplete} data point with $\Delta>0$ unspecified entries is represented as…

The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

The altitude of a graph $G$, denoted $f(G)$, is the largest integer $k$ such that under each ordering of $E(G)$, there exists a path of length $k$ which traverses edges in increasing order. In 1971, Chv\'atal and Koml\'os asked for…

A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimization goal is to determine the queue number of a graph, i.e.,…

The $k$-flex locus of a projective hypersurface $V\subset \mathbb P^n$ is the locus of points $p\in V$ such that there is a line with order of contact at least $k$ with $V$ at $p$. Unexpected contact orders occur when $k\ge n+1$. The case…

Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\frac{\pi}{3\,C(\Lambda_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant…

In Nielsen's geometric approach to quantum complexity, the introduction of a suitable geometrical space, based on the Lie group formed by fundamental operators, facilitates the identification of complexity through geodesic distance in the…

This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…

A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and…

In this work we analyze basic properties of Random Apollonian Networks \cite{zhang,zhou}, a popular stochastic model which generates planar graphs with power law properties. Specifically, let $k$ be a constant and $\Delta_1 \geq \Delta_2…

In this work, we consider the problem of sampling a $k$-clique in a graph from an almost uniform distribution in sublinear time in the general graph query model. Specifically the algorithm should output each $k$-clique with probability…

A n-set of equi-isoclinic planes in R^r is a set of n planes spanning R^r each pair of which has the same non-zero angle arccos(sqrt(lambda)). We prove that for any odd integer k such that 2k=p^alpha+1, p odd prime, alpha non-negative…

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…