Related papers: Cactus barriers

Cactus varieties are a generalization of secant varieties. They are defined using linear spans of arbitrary finite schemes of bounded length, while secant varieties use only isolated reduced points. In particular, any secant variety is…

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Motivated by a recent result of Elberfeld, Jakoby and Tantau showing that $\mathsf{MSO}$ properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of…

We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…

We show that the irreducible variety of 4 x 4 x 4 complex valued tensors of border rank at most 4 is the zero set of polynomial equations of degree 5 (the Strassen commutative conditions), of degree 6 (the Landsberg-Manivel polynomials),…

In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…

Few explicit families of 3-folds are known for which the computation of the canonical ring is accessible and the birational geometry non-trivial. In this note we investigate a family of determinantal 3-folds in $\mathbb P^2 \times \mathbb…

We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m…

We study a class of optimization problems including matrix scaling, matrix balancing, multidimensional array scaling, operator scaling, and tensor scaling that arise frequently in theory and in practice. Some of these problems, such as…

So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes. In this paper, we provide bounds on the list…

We study lower bounds for the self-intersection of the canonical divisor of "canonical varieties" (i.e. varieties whose canonical linear system gives a birational map). We give some improvements for the known results in the case of surfaces…

In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Third rank Killing tensors in (1+1)-dimensional geometries are investigated and classified. It is found that a necessary and sufficient condition for such a geometry to admit a third rank Killing tensor can always be formulated as a…