中文
相关论文

相关论文: Border Waring Rank via Asymptotic Rank

200 篇论文

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

信息论 · 计算机科学 2025-08-08 Riccardo Castellano , Pavel Sekatski

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

泛函分析 · 数学 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

We consider the asymptotic distribution of a cell in a 2 x ... x 2 contingency table as the fixed marginal totals tend to infinity. The asymptotic order of the cell variance is derived and a useful diagnostic is given for determining…

统计理论 · 数学 2018-04-17 Quan Zhou

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

代数拓扑 · 数学 2016-01-20 Mark Grant , Gregory Lupton , John Oprea

We propose several heuristics for mitigating one of the main causes of combinatorial explosion in rank-based complementation of B\"{u}chi automata (BAs): unnecessarily high bounds on the ranks of states. First, we identify elevator…

计算机科学中的逻辑 · 计算机科学 2022-01-28 Vojtěch Havlena , Ondřej Lengál , Barbora Šmahlíková

The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of…

统计理论 · 数学 2021-04-19 Sourav Chatterjee

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

表示论 · 数学 2025-12-08 GyeongHyeon Nam , Anna Puskás

We study the real rank of points with respect to a real variety $X$. This is a generalization of various tensor ranks, where $X$ is in a specific family of real varieties like Veronese or Segre varieties. The maximal real rank can be…

代数几何 · 数学 2015-11-24 Grigoriy Blekherman , Rainer Sinn

Let F and G be homogeneous polynomials in disjoint sets of variables. We prove that the Waring rank is additive, thus proving the symmetric Strassen conjecture, when either F or G is a power, or F and G have two variables, or either F or G…

代数几何 · 数学 2014-05-16 Enrico Carlini , Maria Virginia Catalisano , Luca Chiantini

We establish an upper bound for the rank of every power of an arbitrary quadratic form. Specifically, for any $s\in\mathbb{N}$, we prove that the $s$-th power of a quadratic form of rank $n$ grows as $n^s$. Furthermore, we demonstrate that…

代数几何 · 数学 2025-01-03 Cosimo Flavi

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

数论 · 数学 2007-08-07 Kathrin Bringmann

We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…

最优化与控制 · 数学 2016-11-01 Ian Davidson , Henry Wolkowicz

In many cases (e.g. for many Segre or Segre embeddings of multiprojective spaces) we prove that a hypersurface of the $b$-secant variety of $X\subset \mathbb {P}^r$ has $X$-rank $>b$. We prove it proving that the $X$-rank of a general point…

代数几何 · 数学 2017-08-04 Edoardo Ballico

Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic…

计算复杂性 · 计算机科学 2017-10-27 Klim Efremenko , Ankit Garg , Rafael Oliveira , Avi Wigderson

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

计算复杂性 · 计算机科学 2024-11-26 Matthias Christandl , Koen Hoeberechts , Harold Nieuwboer , Péter Vrana , Jeroen Zuiddam

Wild forms are homogeneous polynomials whose smoothable rank is strictly larger than their border rank. The discrepancy between these two ranks is caused by the difference between the limit of spans of a family of zero-dimensional schemes…

代数几何 · 数学 2020-06-26 Hang Huang , Mateusz Michałek , Emanuele Ventura

We prove that $\bar {\mathbb Q}_\ell$-local systems of bounded rank and ramification on a smooth variety $X$ defined over an algebraically closed field $k$ of characteristic $p\neq \ell$ are tamified outside of codimension $2$ by a finite…

代数几何 · 数学 2021-08-03 Hélène Esnault , Vasudevan Srinivas

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

概率论 · 数学 2021-01-13 Jake Koenig , Hoi Nguyen

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is based on a new multi-matrix extension of the Golden-Thompson…

概率论 · 数学 2018-04-18 Ankit Garg , Yin Tat Lee , Zhao Song , Nikhil Srivastava

Rank estimation is a classical model order selection problem that arises in a variety of important statistical signal and array processing systems, yet is addressed relatively infrequently in the extant literature. Here we present sample…

统计方法学 · 统计学 2011-08-25 Patrick O. Perry , Patrick J. Wolfe