Related papers: Waring decompositions and identifiability via Bert…
This work is motivated by the following problem: Can we identify the disease-causing gene in a patient affected by a monogenic disorder? This problem is an instance of root cause discovery. In particular, we aim to identify the intervened…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
Causal disentanglement aims to learn about latent causal factors behind data, holding the promise to augment existing representation learning methods in terms of interpretability and extrapolation. Recent advances establish identifiability…
We study the minimal free resolution of the Veronese modules of the polynomial ring in n variables, by giving a formula for the Betti numbers in terms of the reduced homology of some skeleton of a simplicial complex. We characterize when…
The recent discovery that the exponent of matrix multiplication is determined by the rank of the symmetrized matrix multiplication tensor has invigorated interest in better understanding symmetrized matrix multiplication. I present an…
More than 30 years after their inception, the decidability proofs for reachability in vector addition systems (VAS) still retain much of their mystery. These proofs rely crucially on a decomposition of runs successively refined by Mayr,…
The classification of graded non-alternating Hamiltonian Lie algebras over perfect field of characteristic 2 is obtained. It is shown that the filtered deformations of such algebras correspond to non-alternating Hamiltonian forms with…
In this paper, we give an alternative proof of separation of variables for scalar-valued polynomials $P:(\mathbb R^m)^k\to\mathbb C$ in the semistable range $m\geq 2k-1$ for the symmetry given by the orthogonal group $O(m)$. It turns out…
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 study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…
We report on the automated classification of Hipparcos variable stars by a supervised classification algorithm known as Support Vector Machines. The dataset comprised about 3200 stars, each characterized by 51 features. These are the B-V…
We prove a generalization of the Hermitian version of the Helton-Vinnikov determinantal representation of hyperbolic polynomials to the class of semi-hyperbolic polynomials, a strictly larger class, as shown by an example. We also prove…
Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…
We prove that the zero set of a 4-nomial in n variables in the positive orthant has at most three connected components. This bound, which does not depend on the degree of the polynomial, not only improves the best previously known bound…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…
Polynomial invariants of a group action often appear only in high degree, and in many representations the invariant ring imposes severe degree constraints before any nontrivial invariants can occur. In contrast, the larger class of unitary…
We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…