Related papers: Strength and partition rank under limits and field…

We study border varieties of sums of powers ($\underline{\mathrm{VSP}}$'s for short), recently introduced by Buczy\'nska and Buczy\'nski, parameterizing border rank decompositions of a point (e.g. of a tensor or a homogeneous polynomial)…

For a weakly mixing bounded rank-one construction the disjointness of its powers is proved. For non-rigid constructions we get minimal self-joinings. Examples of non-mixing rank one actions with explicit weak closure are proposed.

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

In this paper, the results in [Singular Hessians, J. Algebra 282 (2004), no. 1, 195--204], for polynomial Hessians with determinant zero in small dimensions $r+1$, are generalized to similar results in arbitrary dimension, for polynomial…

We calculate the rank and idempotent rank of the semigroup $E(X,P)$ generated by the idempotents of the semigroup $T(X,P)$, which consists of all transformations of the finite set $X$ preserving a non-uniform partition $P$. We also classify…

A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.

The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

Let $F$ be a homogeneous form of degree $d$ in $n$ variables. A Waring decomposition of $F$ is a way to express $F$ as a sum of $d^{th}$ powers of linear forms. In this paper we consider the decompositions of a form as a sum of expressions,…

Reduced-rank decompositions provide descriptions of the variation among the elements of a matrix or array. In such decompositions, the elements of an array are expressed as products of low-dimensional latent factors. This article presents a…

We give an upper bound for the cactus rank of any multi-homogeneous polynomial.

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

We study the rank weight hierarchy of linear codes which are stable under a linear endomorphism defined over the base field, in particular when the endomorphism is cyclic. In this last case, we give a necessary and sufficient condition for…

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…

A polynomial f is said to have the half-plane property if there is an open half-plane H, whose boundary contains the origin, such that f is non-zero whenever all the variables are in H. This paper answers several open questions regarding…

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…