相关论文: Border Waring Rank via Asymptotic Rank
We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…
Border complexity measures are defined via limits (or topological closures), so that any function which can approximated arbitrarily closely by low complexity functions itself has low border complexity. Debordering is the task of proving an…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
The present work deals with the resolution of the Poisson equation in a bounded domain made of a thin and periodic layer of finite length placed into a homogeneous medium. We provide and justify a high order asymptotic expansion which takes…
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.
We present new lower bounds for the symmetric border rank of the n x n determinant for all n. Further lower bounds are given for the 3 x 3 permanent.
We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution…
In a recent paper, J. Lovejoy and the second author conjectured that ranks for four types of unimodal like sequences satisfy certain inequalities. In this paper, we prove these conjectures asymptotically. For this, we extend Wright's Circle…
In Part I we gave a polynomial growth lower-bound for the number of nodal domains of a Hecke-Maass cuspform in a compact part of the modular surface, assuming a Lindel\"of hypothesis. That was a consequence of a topological argument and…
We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field $\F_q$. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura…
We find lower bounds on the rank of a "real" vector bundle over an involutive space, such that "real" vector bundles of higher rank have a trivial summand and such that a stable isomorphism for such bundles implies ordinary isomorphism. We…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…
We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…
We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector $(X,Y)$ is asymptotically normal whenever $Y$ is not almost surely constant. No further conditions on the joint…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…
An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…
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…
In this article we study forbidden loci and typical ranks of forms with respect to the embeddings of $\mathbb P^1\times \mathbb P^1$ given by the line bundles $(2,2d)$. We introduce the Ranestad-Schreyer locus corresponding to supports of…
This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…
Let $\FF$ be an arbitrary field and $(\bm{G}_{n,d/n})_n$ be a sequence of sparse weighted Erd\H{o}s-R\'enyi random graphs on $n$ vertices with edge probability $d/n$, where weights from $\FF \setminus\{0\}$ are assigned to the edges…