Related papers: From boxes to polynomials: a story of generalisati…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We extend some results about shifted Schur functions to the general context of shifted Macdonald polynomials. We obtain two explicit formulas for these polynomials: a $q$-integral representation and a combinatorial formula. Our main tool is…
We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a…
Exponential varieties arise from exponential families in statistics. These real algebraic varieties have strong positivity and convexity properties, familiar from toric varieties and their moment maps. Among them are varieties of inverses…
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…
Shifting by \pm 1 powers sums: p_i \to p_i \pm 1 induces a transformation on symmetric functions that we detail in the case of Hall-Littlewood polynomials. By iteration, this gives a description of these polynomials in terms of plane…
We derive an analytic representation of the ten-particle, two-loop double-box integral as an elliptic integral over weight-three polylogarithms. To obtain this form, we first derive a four-fold, rational (Feynman-)parametric representation…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
Ensembling is among the most popular tools in machine learning (ML) due to its effectiveness in minimizing variance and thus improving generalization. Most ensembling methods for black-box base learners fall under the umbrella of "stacked…
We derive combinatorial formulae for the modified Macdonald polynomial $H_{\lambda}(x;q,t)$ using coloured paths on a square lattice with quasi-cylindrical boundary conditions. The derivation is based on an integrable model associated to…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…
Gaussian unitaries are specified by a second order polynomial in the bosonic operators, that is, by a quadratic polynomial and a linear term. From the Hamiltonian other equivalent representations of the Gaussian unitaries are obtained, such…
This work initiates the study of {\it orthogonal} symmetric polynomials in superspace. Here we present two approaches leading to a family of orthogonal polynomials in superspace that generalize the Jack polynomials. The first approach…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…