Related papers: Tangent Cones to TT Varieties

We give a complete description of the cone of Betti diagrams over a standard graded hypersurface ring of the form k[x,y]/<q>, where q is a homogeneous quadric. We also provide a finite algorithm for decomposing Betti diagrams, including…

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…

Algebraic statistics for binary random variables is concerned with highly structured algebraic varieties in the space of 2x2x...x2-tensors. We demonstrate the advantages of representing such varieties in the coordinate system of binary…

The present paper is devoted to possible generalizations of the classic Lagrange Mean Value Theorem. We consider a real-valued function of several variables that is only assumed to be continuous. The main concept is to replace the notion of…

We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…

We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of Landsberg and Teitler and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by…

We prove a conjecture of Etingof and the second author for hypertoric varieties, that the Poisson-de Rham homology of a unimodular hypertoric cone is isomorphic to the de Rham cohomology of its hypertoric resolution. More generally, we…

We study the tangent cone at the origin and the Hilbert series for a family of numerical semigroups generated by concatenation of arithmetic sequences. We prove that all the concatenation classes have Cohen-Macaulay tangent cones except the…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with…

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

We consider the relation of the multi-component 2D Toda hierarchy with matrix orthogonal and biorthogonal polynomials. The multi-graded Hankel reduction of this hierarchy is considered and the corresponding generalized matrix orthogonal…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

We give a combinatorial criterion for the tangent bundle on a smooth toric variety to be stable with respect to a given polarisation in terms of the corresponding lattice polytope. Furthermore, we show that for a smooth toric surface and a…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…