Related papers: A combinatorial formula for certain binomial coeff…
Using the Okounkov-Maulik stable map, we identify the equivariant cohomology of instanton moduli spaces with the space of polynomials on an infinite number of variables. We define the generalized Jack polynomials as the polynomials…
We study meromorphic jacobian pairs, i.e., pairs of polynomials in one variable, with coefficients meromorphic series in a second variable, whose jacobian relative to the two variables depends only on the second variable. We pose two…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
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…
We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…
We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial.…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Using the ground state $\psi_0$ of a multicomponent generalization of the Calogero-Sutherland model as a weight function, orthogonal polynomials in the coordinates of one of the species are constructed. Using evidence from exact analytic…
We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the…
In this paper, we gave some properties of binomial coefficient.
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…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…