Related papers: A bound on the Carath\'eodory number

In the $k$-cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into $k$ connected components. Algorithms of Karger \& Stein can solve this in roughly $O(n^{2k})$ time. On the other hand,…

A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…

We study $k$-clustering problems with lower bounds, including $k$-median and $k$-means clustering with lower bounds. In addition to the point set $P$ and the number of centers $k$, a $k$-clustering problem with (uniform) lower bounds gets a…

For an $N \times N$ matrix $A$, its rank-$r$ rigidity, denoted $\mathcal{R}_A(r)$, is the minimum number of entries of $A$ that one must change to make its rank become at most $r$. Determining the rigidity of interesting explicit families…

The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…

The defective chromatic number of a graph class is the infimum $k$ such that there exists an integer $d$ such that every graph in this class can be partitioned into at most $k$ induced subgraphs with maximum degree at most $d$. Finding the…

The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…

In this paper, we study bounds for the number of rational points on twists C' of a fixed curve C over a number field K, under the condition that the group of K-rational points on the Jacobian J' of C' has rank smaller than the genus of C'.…

Let K be a number field and let E/K be an elliptic curve. If E has complex multiplication, we show that there is a positive lower bound for the canonical height of non-torsion points on E defined over the maximal abelian extension K^ab of…

We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex…

We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…

A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex…

We extend an earlier result by Dan Abramovich, showing that a conjecture of S. Lang's implies the existence of a uniform bound on the number of $K$-rational points over all smooth curves of genus $g$ defined over $K$, where $K$ is any…

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \subseteq R^d, where d \in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional…

We study the question as to when the closed convex hull of a K-convex map equals its K-epigraph. In particular, we shed light onto the smallest cone K such that a given map has convex and closed K-epigraph, respectively. We apply our…

Carath\'eodory's well-known conjecture states that every sufficiently smooth, closed convex surface in three dimensional Euclidean space admits at least two umbilic points. It has been established that the conjecture is true for all…

Let S be a set of n >= d points in general position in R^d. An oriented (d-1)-simplex spanned by d points from S is called a k-facet iff the positive side of its affine hull contains exactly k points from S. A (<=k)-facet is simply an…

We show there exist representations of each maximal compact subgroup $K$ of the $p$-adic group $G=\mathrm{SL}(2,F)$, attached to each nilpotent coadjoint orbit, such that every irreducible representation of $G$, upon restriction to a…

It is shown that there is no K closed convex bounded non-dentable subset of C({\omega}^{\omega} ^k) such that on the subsets of K the PCP and the RNP are equivalent properties. Then applying Schachermayer-Rosenthal theorem, we conclude that…