相关论文: Combinatorial formula for Macdonald polynomials, B…

We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…

We present a decomposition of the generalized binomial coefficients associated with Jack polynomials into two factors: a stem, which is described explicitly in terms of hooks of the indexing partitions, and a leaf, which inherits various…

In this article, we introduce the simplicial $d$-polytopic numbers defined on generalized Fibonacci polynomials. We establish basic identities and find $q$-identities known. Furthermore, we find generating functions for the simplicial…

Classical local Weyl modules for a simple Lie algebra are labeled by dominant weights. We generalize the definition to the case of arbitrary weights and study the properties of the generalized modules. We prove that the representation…

We study solutions of exponential polynomials over the complex field. Assuming Schanuel's conjecture we prove that certain polynomials have generic solutions in the complex field.

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…

We give operational formulae of Burchnall type involving complex Hermite polynomials. Short proofs of some known formulae are given and new results involving these polynomials, including Nielsen's identities and Runge addition formula, are…

We establish a connection between (degenerate) nonsymmetric Macdonald polynomials and standard bases and dual standard bases of maximal parabolic modules of affine Hecke algebras. Along the way we prove a (weak) polynomiality result for…

For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…

We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.

We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…

In symmetric Macdonald polynomial theory the Pieri formula gives the branching coefficients for the product of the rth elementary symmetric function and the Macdonald polynomial. In this paper we give the nonsymmetric analogues for the…

The $m$-symmetric Macdonald polynomials form a basis of the space of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ (while having no special symmetry in the variables $x_1,\dots,x_m$).We establish in this article…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…

We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…