Related papers: Factorisation of Macdonald polynomials
In this paper, we consider central complete and incomplete Bell polynomials which are generalizations of the recently introduced central Bell polynomials and central analogues for the complete and incomplete Bell polynomials. We investigate…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
The two variable Kostka functions are the scalar products of the Macdonald polynomials with the Schur polynomials with respect to the scalar product which makes the Hall-Littlewood polynomials pairwise orthogonal. A conjecture of Macdonald…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…
We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
Based on a generalized Newton's identity, we construct a family of symmetric functions which deform the modular Hall-Littlewood functions. We also give a determinant formula for the Macdonald functions.
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
We present generalisations of Wilson's theorem for double factorials, hyperfactorials, subfactorials and superfactorials.
Motivated by recent results on the Waring problem for polynomial rings and representation of monomial as sum of powers of linear forms, we consider the problem of presenting monomials of degree kd as sums of k-th powers of forms of degree…
Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
In a preceding paper the theory of nonsymmetric Macdonald polynomials taking values in modules of the Hecke algebra of type $A$ (Dunkl and Luque SLC 2012) was applied to such modules consisting of polynomials in anti-commuting variables, to…
In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of…
In this paper we present a Mathematica notebook for computing nonsymmetric and interpolation Macdonald polynomials. We present the new recursive generation algorithm employed within the notebook and the theory required for its development.…
The branching coefficients in the expansion of the elementary symmetric function multiplied by a symmetric Macdonald polynomial $P_\kappa(z)$ are known explicitly. These formulas generalise the known $r=1$ case of the Pieri-type formulas…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…