Related papers: A disintegration of the Christoffel function

We consider the problem of decomposing a regular non-negative function as a sum of squares of functions which preserve some form of regularity. In the same way as decomposing non-negative polynomials as sum of squares of polynomials allows…

We present a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes a mass uniformly distributed on the sphere. First, connection formulas relating these multivariate orthogonal…

We derive a fully analytical, one-line closed-form expression for the cumulative distribution function (CDF) of the product of two correlated zero-mean normal random variables, avoiding any series representation. This result complements the…

Let $n=\prod_p p^{\nu_p(n)}$ denote the canonical factorization of $n\in \N$. The binomial convolution of arithmetical functions $f$ and $g$ is defined as $(f\circ g)(n)=\sum_{d\mid n} (\prod_p \binom{\nu_p(n)}{\nu_p(d)}) f(d)g(n/d),$ where…

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

Performing both right and left multiplication operations using general regular matrix polynomials, which need not be monic and may possess leading coefficients of arbitrary rank, on a rectangular matrix of measures associated with mixed…

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

Let $f$ be an entire almost periodic function with zeros in a horizontal strip of finite width; for example, any exponential polynomial with purely imaginary exponents is such a function. Let $\mu$ be the measure on the set of zeros of $f$…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

In the process of proving a sharpened form of G\r{a}rding's inequality, Fefferman & Phong demonstrated that every non-negative function $f\in C^{3,1}(\mathbb{R}^n)$ can be written as a finite sum of squares of functions in…

The Titchmarsh convolution theorem is a celebrated result about the support of the convolution of two functions. We present a simple proof based on the canonical factorization theorem for bounded holomorphic functions on the unit disk.

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…