相关论文: Factorisation of Macdonald polynomials

We give an explicit formula for an operator that sends a wreath Macdonald polynomial to the delta function at a character associated to its partition. This allows us to prove many new results for wreath Macdonald polynomials, especially…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

In the paper we formulate and verify a difference counterpart of the Macdonald-Mehta conjecture and its generalization for the Macdonald polynomials. Namely, we determine the Fourier transforms of the polynomials multiplied by the Gaussian,…

We establish a connection between a specialization of the nonsymmetric Macdonald polynomials and the Demazure characters of the corresponding affine Kac-Moody algebra. This allows us to obtain a representation-theoretical interpretation of…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Macdonald superpolynomials provide a remarkably rich generalization of the usual Macdonald polynomials. The starting point of this work is the observation of a previously unnoticed stability property of the Macdonald superpolynomials when…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…

Formulas of Rodrigues-type for the Macdonald polynomials are presented. They involve creation operators, certain properties of which are proved and other conjectured. The limiting case of the Jack polynomials is discussed.

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

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…

We generalize the generating formula for plane partitions known as MacMahon's formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald's symmetric functions. The…

This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].

In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

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 generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…

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 give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…