English
Related papers

Related papers: Asymptotic rank bounds: a numerical census

200 papers

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

Number Theory · Mathematics 2023-09-06 Thomas F. Bloom , Olof Sisask

We introduce tensor numerical techniques for solving optimal control problems constrained by elliptic operators in $\mathbb{R}^d$, $d=2,3$, with variable coefficients, which can be represented in a low rank separable form. We construct a…

Numerical Analysis · Mathematics 2021-05-28 Boris N. Khoromskij , Britta Schmitt , Volker Schulz

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

Combinatorics · Mathematics 2025-11-07 Yaara Jahn , Orit E. Raz

We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…

Statistics Theory · Mathematics 2007-06-13 Jason Morton , Lior Pachter , Anne Shiu , Bernd Sturmfels , Oliver Wienand

We consider the problem of tensor estimation from noisy observations with possibly missing entries. A nonparametric approach to tensor completion is developed based on a new model which we coin as sign representable tensors. The model…

Machine Learning · Statistics 2021-11-04 Chanwoo Lee , Miaoyan Wang

We give an upper bound for the rank of the border rank 3 partially symmetric tensors. In the special case of border rank 3 tensors $T\in V_1\otimes \cdots \otimes V_k$ (Segre case) we can show that all ranks among 3 and $k-1$ arise and if…

Algebraic Geometry · Mathematics 2018-01-18 Edoardo Ballico , Alessandra Bernardi

This paper addresses the topic of robust Bayesian compressed sensing over finite fields. For stationary and ergodic sources, it provides asymptotic (with the size of the vector to estimate) necessary and sufficient conditions on the number…

Information Theory · Computer Science 2014-01-20 Wenjie Li , Francesca Bassi , Michel Kieffer

M-estimation, aka empirical risk minimization, is at the heart of statistics and machine learning: Classification, regression, location estimation, etc. Asymptotic theory is well understood when the loss satisfies some smoothness…

Statistics Theory · Mathematics 2025-12-16 Victor-Emmanuel Brunel

For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing…

Computational Complexity · Computer Science 2013-08-08 J. M. Landsberg

This article introduces an algebraic framework for establishing eigenvalue bounds for symmetric positive definite tensors by leveraging intrinsic invariants, specifically the trace and determinant (resultant). We derive a hierarchy of…

Numerical Analysis · Mathematics 2026-05-15 Snigdhashree Nayak , Hemant Sharma , Nachiketa Mishra

Compressed sensing is the art of reconstructing a sparse vector from its inner products with respect to a small set of randomly chosen measurement vectors. It is usually assumed that the ensemble of measurement vectors is in isotropic…

Information Theory · Computer Science 2014-02-25 Richard Kueng , David Gross

This paper studies the estimation and inference for the isotonic regression at the boundary point, an object that is particularly interesting and required in the analysis of monotone regression discontinuity designs. We show that the…

Statistics Theory · Mathematics 2020-12-22 Andrii Babii , Rohit Kumar

We introduce templates for exponential asymptotic expansions that, in contrast to matched asymptotic approaches, enable the simultaneous satisfaction of both boundary values in classes of linear and nonlinear equations that are singularly…

Classical Analysis and ODEs · Mathematics 2015-05-19 C. J. Howls

We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.

Representation Theory · Mathematics 2023-11-10 Abel Lacabanne , Daniel Tubbenhauer , Pedro Vaz

In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length $n$ to infinity. We also let the number of non-zero elements of the signal $k$…

Information Theory · Computer Science 2010-01-14 Yaser Eftekhari , Amir H. Banihashemi , Ioannis Lambadaris

Reduced-rank regression is a dimensionality reduction method with many applications. The asymptotic theory for reduced rank estimators of parameter matrices in multivariate linear models has been studied extensively. In contrast, few…

Statistics Theory · Mathematics 2017-10-13 Efstathia Bura , Sabrina Duarte , Liliana Forzani , Ezequiel Smucler , Mariela Sued

We give an elementary proof of the existence of an asymptotic expansion in powers of $k$ of the Bergman kernel associated to $L^k$, where $L$ is a positive line bundle. We also give an algorithm for computing the coefficients in the…

Complex Variables · Mathematics 2007-11-12 Robert Berman , Bo Berndtsson , Johannes Sjoestrand

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

Number Theory · Mathematics 2024-08-27 Jerzy Grunwald , Grzegorz Serafin

We review the relation between compact asymptotic spectral measures and certain positive asymptotic morphism on locally compact spaces via asymptotic Riesz representation theorem, as introduced by Martinez and Trout [3]. Applications to…

K-Theory and Homology · Mathematics 2012-08-28 Simona Macovei

Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank…

Combinatorics · Mathematics 2024-11-06 Jop Briët , Davi Castro-Silva