Related papers: The Analytic Minimal Rank Sard Conjecture

We prove a non-asymptotic distribution-independent lower bound for the expected mean squared generalization error caused by label noise in ridgeless linear regression. Our lower bound generalizes a similar known result to the…

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a…

We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…

We extend Matui's notion of almost finiteness to general etale groupoids and show that the reduced groupoid C*-algebras of minimal almost finite groupoids have stable rank one. The proof follows a new strategy, which can be regarded as a…

We introduce a notion of vague convergence for random marked metric measure spaces. Our main result shows that convergence of the moments of order $k \ge 1$ of a random marked metric measure space is sufficient to obtain its vague…

We show the geometric syzygy conjecture in positive characteristic. Specifically, if C is a general smooth curve of genus g defined over an algebraically closed field of characteristic p, then all linear syzygy spaces are spanned by…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

Can we find a self-similar set on the line with positive Lebesgue measure and empty interior? Currently, we do not have the answer for this question for deterministic self-similar sets. In this paper we answer this question negatively for…

This paper studies the estimation of low-rank Markov chains from empirical trajectories. We propose a non-convex estimator based on rank-constrained likelihood maximization. Statistical upper bounds are provided for the Kullback-Leiber…

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squares computation on a graph. The vertices are the alternatives, and the edge values comprise the comparison data. The basic idea is very…

We show that in order to decide whether a given probability measure is laminate it is enough to verify Jensen's inequality in the class of extremal non-negative rank-one convex integrands. We also identify a subclass of these extremal…

This is a systematic investigation into the sensitivity of low-rank approximations of real matrices. We show that the low-rank approximation errors, in the two-norm, Frobenius norm and more generally, any Schatten p-norm, are insensitive to…

We investigate the Hausdorff measure and content on a class of quasi self-similar sets that include, for example, graph-directed and sub self-similar and self-conformal sets. We show that any Hausdorff measurable subset of such a set has…

We prove that, under a mild summability condition on the growth of the derivative on critical orbits any piecewise monotone interval map possibly containing discontinuities and singularities with infinite derivative (cusp map) admits an…

Conjecture A of \cite{EM14} predicts the equality between the smallest positive height of the irreducible characters in a $p$-block of a finite group and the smallest positive height of the irreducible characters in its defect group. Hence,…

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

An important theme in recent work in asymptotic geometric analysis is that many classical implications between different types of geometric or functional inequalities can be reversed in the presence of convexity assumptions. In this note,…