Related papers: A combinatorial formula for certain binomial coeff…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
We adapt Thistlethwaite's alternating tangle decomposition of a knot diagram to identify the potential extreme terms in its bracket polynomial, and give a simple combinatorial calculation for their coefficients, based on the intersection…
In this paper I consider polynomial composites with the coefficients from $K\subset L$. We already know many properties, but we do not know the answer to the question of whether there is a relationship between composites and field…
A formula of Rodrigues-type for the Jack polynomials is presented. It is seen to imply a weak form of a conjecture of Macdonald and Stanley.
We discuss a product formula for $F$-polynomials in cluster algebras, and provide two proofs. One proof is inductive and uses only the mutation rule for $F$-polynomials. The other is based on the Fock-Goncharov decomposition of mutations.…
In this letter I shall review my joint results with Vadim Kuznetsov and Evgeny Sklyanin [Indag. Math. 14 (2003), 451-482, math.CA/0306242] on separation of variables for the $A_n$ Jack polynomials. This approach originated from the work…
In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $\mathbb{F}_q$ and $\mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of…
We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…
We give a direct proof of the combinatorial formula for interpolation Macdonald polynomials by introducing certain polynomials, which we call generic Macdonald polynomials, which depend on $d$ additional parameters and specialize to all…
Jack characters are a generalization of the characters of the symmetric groups; a generalization that is related to Jack symmetric functions. We investigate the structure coefficients for Jack characters; they are a generalization of the…
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We give a construction for three parameter family of Jack polynolials for the root system $BC_n$ through the generalized spherical functions on the symmetric space $GL(m+n)/GL(m)\times GL(n)$.
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
We use a combinatorial interpretation of the coefficients of zonal Kerov polynomials as a number of unoriented maps to derive an explicit formula for the coefficients in genus one.
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…
The clustering properties of Jack polynomials are relevant in the theoretical study of the fractional Hall states. In this context, some factorization properties have been conjectured for the $(q,t)$-deformed problem involving Macdonald…