Related papers: A disintegration of the Christoffel function
We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…
The phenomena that cause a value of a polynomial function to be a bifurcation one are yet to be described when the fibers have dimension higher than $1$. In this note, the main result is the construction of a polynomial submersion function…
Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…
The trapezoidal Fox conjecture states that the coefficient sequence of the Alexander polynomial of an alternating knot is unimodal. We are motivated by a harder question, the strong Fox conjecture, which asks whether the coefficient…
We suggest a new strategy for proving large $N$ duality by interpreting Gromov-Witten, Donaldson-Thomas and Chern-Simons invariants of a Calabi-Yau threefold as different characterizations of the same holomorphic function. For the resolved…
A super-conformal map and a minimal surface are factored into a product of two maps by modeling the Euclidean four-space and the complex Euclidean plane on the set of all quaternions. One of these two maps is a holomorphic map or a…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We investigate polyconvexity of the double well function $f(X)\,:= |X-X\_1|^2|X-X\_2|^2$ for given matrices $X\_1, X\_2 \in \R^{n \times n}$. Such functions are fundamental in the modeling of phase transitions in materials, but their…
Precise asymptotics for Christoffel functions are established for power type weights on unions of Jordan curves and arcs. The asymptotics involve the equilibrium measure of the support of the measure. The result at the endpoints of arc…
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…
This paper studies the product $\bar{G}_n$ of the binomial coefficients in the n-th row of Pascal's triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order n. It studies its size as a…
The theorem proved in this note, although elementary, is related to a certain misconception. If $K$ is a field, $f\in K[X]$ is separable and irreducible over $K$, and $g$ is a polynomial dividing $f$, whose coefficients lie in some finite…
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…
Computing asymptotics of the recurrence coefficients of X1-Jacobi polynomials we investigate the limit of Christoffel function. We also study the relation between the normalized counting measure based on the zeros of the modified average…
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…
In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…
Sums of independent random variables form the basis of many fundamental theorems in probability theory and statistics, and therefore, are well understood. The related problem of characterizing products of independent random variables seems…