Related papers: Waring decompositions of monomials
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
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…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
The generalized Waring problem asks exactly which positive integers cannot be expressed as the sum of $j$ positive $k$-th powers? Using computational techniques, this paper refines an approach introduced by Zenkin, establishes results for…
We describe mean value estimates for exponential sums of degree exceeding 2 that approach those conjectured to be best possible. The vehicle for this recent progress is the efficient congruencing method, which iteratively exploits the…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
We reconsider the conjecture by Gepner that the fusion ring of a rational conformal field theory is isomorphic to a ring of polynomials in $n$ variables quotiented by an ideal of constraints that derive from a potential. We show that in a…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We consider the bar complex of a monomial non-unital associative algebra $A=k \langle X \rangle / (w_1,...,w_t)$. It splits as a direct sum of complexes $B_w$, defined for any fixed monomial $w=x_1...x_n \in A$. We give a simple argument,…
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
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 article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…
Understanding the behavior of a black-box model with probabilistic inputs can be based on the decomposition of a parameter of interest (e.g., its variance) into contributions attributed to each coalition of inputs (i.e., subsets of inputs).…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
The strength of a multivariate homogeneous polynomial is the minimal number of terms in an expression as a sum of products of lower-degree homogeneous polynomials. Partition rank is the analogue for multilinear forms. Both ranks can drop…