Related papers: Waring decompositions and identifiability via Bert…

Causality inference is prone to spurious causal interactions, due to the substantial confounders in a complex system. While many existing methods based on the statistical methods or dynamical methods attempt to address misidentification…

Characterizing the solution sets in a problem by closedness under operations is recognized as one of the key aspects of algorithm development, especially in constraint satisfaction. An example from the Boolean satisfiability problem is that…

The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

Waring's problem has a long history in additive number theory. In its original form it deals with the representability of every positive integer as sum of $k$-th powers with integer $k$. Instead of these powers we deal with…

We discuss the classification of strongly regular vertex operator algebras (VOAs) with exactly three simple modules whose character vector satisfies a monic modular linear differential equation with irreducible monodromy. Our Main Theorem…

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

We consider higher secant varieties to Veronese varieties. Most points on the r-th secant variety are represented by a finite scheme of length r contained in the Veronese variety --- in fact, for generic point, it is just a union of r…

We formalize the Wu-Ritt characteristic set method for the triangular decomposition of polynomial systems in the Lean 4 theorem prover. Our development includes the core algebraic notions of the method, such as polynomial initials, orders,…

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

In this paper we compute the Waring rank of any polynomial of the form F=M_1+...+M_r, where the M_i are pairwise coprime monomials, i.e., GCD(M_i,M_j)=1 for i not j. In particular, we determine the Waring rank of any monomial. As an…

The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…

Causal representation learning aims to unveil latent high-level causal representations from observed low-level data. One of its primary tasks is to provide reliable assurance of identifying these latent causal models, known as…

Let f be a newform of weight at least 3 with Fourier coefficients in a number field K. We show that the universal deformation ring of the mod lambda Galois representation associated to f is unobstructed, and thus isomorphic to a power…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells…

Let $X\subset \mathbb {P}^r$ be an integral and non-degenerate variety. For any $q\in \mathbb {P}^r$ let $r_X(q)$ be its $X$-rank and $\mathcal {S} (X,q)$ the set of all finite subsets of $X$ such that $|S|=r_X(q)$ and $q\in \langle…

We study elements of second order linear recurrence sequences $(G_n)_{n= 0}^{\infty}$ of polynomials in $\mathbb{C}[x]$ which are decomposable, i.e. representable as $G_n=g\circ h$ for some $g, h\in \mathbb{C}[x]$ satisfying…

Many real-world decision-making tasks require learning causal relationships between a set of variables. Traditional causal discovery methods, however, require that all variables are observed, which is often not feasible in practical…