Related papers: Waring decompositions and identifiability via Bert…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

Most causal discovery procedures assume that there are no latent confounders in the system, which is often violated in real-world problems. In this paper, we consider a challenging scenario for causal structure identification, where some…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

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…

In an underdetermined system of equations $Ax=y$, where $A$ is an $m\times n$ matrix, only $u$ of the entries of $y$ with $u < m$ are known. Thus $E_jw$, called `measurements', are known for certain $j\in J \subset \{0,1,\ldots,m-1\}$ where…

The paper is devoted to a detailed study of sextics in three variables having a decomposition as a sum of nine powers of linear forms. This is the unique case of a Veronese image of the plane which, in the terminology introduced by…

We study the algebraic varieties defined by the conditional independence statements of Bayesian Networks. A complete algebraic classification is given for Bayesian Networks on at most five random variables. Hidden variables are related to…

Variable selection is a procedure to attain the truly important predictors from inputs. Complex nonlinear dependencies and strong coupling pose great challenges for variable selection in high-dimensional data. In addition, real-world…

We tackle the problems of latent variables identification and ``out-of-support'' image generation in representation learning. We show that both are possible for a class of decoders that we call additive, which are reminiscent of decoders…

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…

We show how several results about p-adic lattices generalize easily to lattices over valuation ring of arbitrary rank having only the Henselian property for quadratic polynomial. If 2 is invertible we obtain the uniqueness of the Jordan…

We give a decomposition of the posterior predictive variance using the law of total variance and conditioning on a finite dimensional discrete random variable. This random variable summarizes various features of modeling that are used to…

This note presents the multivariate Hermite criterion: a practical and powerful algorithm for determining the number of distinct real and complex roots of a zero-dimensional system of polynomials in any finite number of variables. The final…

Modern regression applications can involve hundreds or thousands of variables which motivates the use of variable selection methods. Bayesian variable selection defines a posterior distribution on the possible subsets of the variables…

Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)\in k[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$…

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

We deal with the problem of learning the underlying disentangled latent factors that are shared between the paired bi-modal data in cross-modal retrieval. Our assumption is that the data in both modalities are complex, structured, and high…

We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this…

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…