Related papers: The Analytic Minimal Rank Sard Conjecture

We combine the exact counting of all elliptic curves over $K = \mathbb{F}_q(t)$ with $\mathrm{char}(K) > 3$ by Bejleri, Satriano and the author, together with the torsion-free nature of most elliptic curves over global function fields…

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…

Let $K\subset\mathbb{R}$ be a self-similar set defined on $\mathbb{R}$. It is easy to prove that if the Lebesgue measure of $K$ is zero, then for Lebesgue almost every $t$, $$K+t=\{x+t:x\in K\}$$ only consists of irrational or…

Given a family of quadratic twists of a fixed elliptic curve defined over $\mathbb{Q}$, we investigate the average rank in the subfamily of twists having a nontorsion rational point of almost minimal height. We show in particular that the…

Let $E$ be an elliptic curve defined over a number field $K$ without complex multiplication. If $\Gamma \subset E(\overline{K})$ is a subgroup of finite rank, a very special case of a conjecture of R\'emond predicts that points of small…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

This paper studies the inference about linear functionals of high-dimensional low-rank matrices. While most existing inference methods would require consistent estimation of the true rank, our procedure is robust to rank misspecification,…

Let E be an elliptic curve defined over a number field K. Michael Larsen conjectured that for any finitely generated subgroup G of Gal(\bar K/K), the Mordell-Weil rank of E is unbounded in number fields fixed by G. We prove that the…

We study the problem of bivariate discrete or continuous probability density estimation under low-rank constraints.For discrete distributions, we assume that the two-dimensional array to estimate is a low-rank probability matrix. In the…

Following D. Ramakrishnan, we explain how L. Lafforgue's modularity theorem and an analytic theorem of H. Jacquet and J. Shalika can be applied to prove the following result related to the Tate Conjecture: for a smooth, projective,…

The convex and metric structures underlying probabilistic physical theories are generally described in terms of base normed vector spaces. According to a recent proposal, the purely geometrical features of these spaces are appropriately…

The Lebesgue dominated convergence theorem of the measure theory implies that the Riemann integral of a bounded sequence of continuous functions over the interval [ 0,1] pointwise converging to zero, also converges to zero. The validity of…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We consider change-point tests based on rank statistics to test for structural changes in long-range dependent observations. Under the hypothesis of stationary time series and under the assumption of a change with decreasing change-point…

This paper considers probabilistic estimation of a low-rank matrix from non-linear element-wise measurements of its elements. We derive the corresponding approximate message passing (AMP) algorithm and its state evolution. Relying on…

In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…

Complex systems are high-dimensional nonlinear dynamical systems with intricate interactions among their constituents. To make interpretable predictions about their large-scale behavior, it is typically assumed, without a clear statement,…

A famous conjecture by Thomassen from 1983 asserts that for any given $k,g\in \mathbb{N}$ there exists some $d=d(k,g)\in \mathbb{N}$ such that every graph of minimum degree at least $d$ contains a subgraph of minimum degree at least $k$ and…

Let $S$ be a subset of $\mathbb{R}^d$ with finite positive Lebesgue measure. The Beer index of convexity $\operatorname{b}(S)$ of $S$ is the probability that two points of $S$ chosen uniformly independently at random see each other in $S$.…

Fix a translation surface $X$, and consider the measures on $X$ coming from averaging the uniform measures on all the saddle connections of length at most $R$. Then as $R\to\infty$, the weak limit of these measures exists and is equal to…