相关论文: Geometric lower bounds for generalized ranks

We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…

Boundedness of an abstract formulation of Hardy operators between Lebesgue spaces over general measure spaces is studied and, when the domain is L^1, shown to be equivalent to the existence of a Hardy inequality on the half line with…

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

In this work we provide a complete characterization of left-invariant symmetric Killing tensors on almost abelian Lie groups endowed with a left-invariant Riemannian metric. We show in particular that all such tensors are decomposable, in…

The Fronsdal Lagrangians for free totally symmetric rank-s tensors rest on suitable trace constraints for their gauge parameters and gauge fields. Only when these constraints are removed, however, the resulting equations reflect the…

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

We present three families of minimal border rank tensors: they come from highest weight vectors, smoothable algebras, or monomial algebras. We analyse them using Strassen's laser method and obtain an upper bound $2.431$ on $\omega$. We also…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our…

In this note, we survey some recent developments in birational geometry concerning the boundedness of algebraic varieties. We delineate a strategy to extend some of these results to the case of generalized pairs, first introduced by Birkar…

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

By studying a categorification of the antisymmetriser quasi-idempotent in the Hecke algebra, we derive a closed formula for the Jones-Wenzl idempotent in the Temperley-Lieb algebra. In particular, we show that when the idempotent is…

The analytic rank of a tensor, first defined by Gowers and Wolf in the context of higher-order Fourier analysis, is defined to be the logarithm of the bias of the tensor. We prove that it is a subadditive measure of rank: that is, the…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

It is shown that a large class of systems of non-linear wave equations, based on the good-bad-ugly model, admit formal solutions with polyhomogeneous expansions near null infinity. A particular set of variables is introduced which allows us…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

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…

The epsilon alternating least squares ($\epsilon$-ALS) is developed and analyzed for canonical polyadic decomposition (approximation) of a higher-order tensor where one or more of the factor matrices are assumed to be columnwisely…