Related papers: Convex Hulls of Random Order Types

Melchior's inequality implies that the average line-length in a simple, rank-$3$, real-representable matroid is less than $3$. A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound…

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…

Let G be a group acting on the plane by orientation-preserving homeomorphisms. We show that if for some k>0 there is a ball of radius r > k/\sqrt{3} such that each point x in the ball satisfies |gx -hx| < k for all g, h in G, and the action…

Many results on the convex order in the literature were stated for random variables with finite mean. For instance, a fundamental result in dependence modeling is that the sum of a pair of random random variables is upper bounded in convex…

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

Modern large-scale statistical models require to estimate thousands to millions of parameters. This is often accomplished by iterative algorithms such as gradient descent, projected gradient descent or their accelerated versions. What are…

We prove that the number of crossings in a random labelled tree with vertices in convex position is asymptotically Gaussian with mean $ n^2/6$ and variance $ n^3/45$. A similar result is proved for points in general position under mild…

Building on a recent characterization of tope graphs of Complexes of Oriented Matroids (COMs), we tackle and generalize several classical problems in Oriented Matroids (OMs), Lopsided Sets (aka ample set systems), and partial cubes via…

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

Results of Perron and Rolfsen imply that untwisted hyperbolic once-punctured torus bundles over the circle have bi-orderable fundamental groups. They do this by showing that the action of the monodromy preserves a "standard" bi-ordering…

In the Grassmannian $Gr_{\mathbb{C}}(k,n)$ we have positroid varieties $\Pi_f$, each indexed by a bounded affine permutation $f$ and containing torus-fixed points $\lambda \in \Pi_f$. In this paper we consider the partially ordered set…

In this paper, our aim is to analyse the generalization capabilities of first-order methods for statistical learning in multiple, different yet related, scenarios including supervised learning, transfer learning, robust learning and…

The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(\xi_1,\dots,\xi_n)\in\{-1,1\}^n$, we have…

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…