Related papers: Waring decompositions and identifiability via Bert…
We compare a heuristic count of components of the center variety in degree 3 with the equivalent count obtained from known families. From this comparison we conjecture that more than 100 unknown components exist.
We extend results of Cogolludo-Agustin and Libgober relating the Alexander polynomial of a plane curve $C$ with the Mordell--Weil rank of certain isotrivial families of jacobians over $\mathbf{P}^2$ of discriminant $C$. In the second part…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
We use the representation theory of Lie algebras and computational linear algebra to determine the simplest nonconstant invariant polynomial in the entries of a general 2 x 2 x 3 array. This polynomial is homogeneous of degree 6 and has 66…
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which are proposed by Ye, Dai, Lam (1999) and Faug$\mu$ere, Perret…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
Cylindrical Algebraic Decomposition (CAD) is a key proof technique for formal verification of cyber-physical systems. CAD is computationally expensive, with worst-case doubly-exponential complexity. Selecting an optimal variable ordering is…
The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…
Below we discuss the partition of the space of real univariate polynomials according to the number of positive and negative roots and signs of the coefficients. We present several series of non-realizable combinations of signs together with…
Colored knot polynomials possess a peculiar Z-expansion in certain combinations of differentials, which depends on the representation. The coefficients of this expansion are functions of the three variables (A,q,t) and can be considered as…
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…
We review and generalize the recently introduced framework of entropy vectors for detecting and quantifying genuine multipartite entanglement in high dimensional multicomponent quantum systems. We show that these ideas can be extended to…
A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…
We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…
In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
We develop a generalisation of disentanglement in VAEs---decomposition of the latent representation---characterising it as the fulfilment of two factors: a) the latent encodings of the data having an appropriate level of overlap, and b) the…