A Combinatorial Formula for the Schur Coefficients of the Integral Form of the Macdonald Polynomials in the Two Column and Certain Hook Cases

In this paper, we prove that the integral form of Macdonald polynomials J _?? [X; q, t] has the property that J _?? [X; q, t]/(1?q) ⁿ has Schur expansion with positive polynomial coefficient. Our proof proceeds by constructing constructing combinatorial formula for the Schur coefficients when??? is either a two column shape or a certain type of hook shape.     

Some Asymptotic Results on <Emphasis Type="Italic">q</Emphasis>-Binomial Coefficients

We look at the asymptotic behavior of the coefficients of the q-binomial coefficients (or Gaussian polynomials) \({\left(\begin{array}{c}{a+k}\\{k}\end{array}\right)_{q}}\), when k is fixed. We give a number of results in this direction, some of which involve Eulerian polynomials and their generalizations.     

Combinatorial interpretations of the q-Faulhaber and q-Salié coefficients

Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salié's coefficients for the alternating sums of powers. In this paper, we show that these are polynomials with symmetric, nonnegative integral coefficients by refining Gessel-Viennot's combinatorial interpretations.     

Strong factorization property of Macdonald polynomials and higher-order Macdonald’s positivity conjecture

We prove a strong factorization property of interpolation Macdonald polynomials when q tends to 1. As a consequence, we show that Macdonald polynomials have a strong factorization property when q tends to 1, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate q, t-Kostka numbers and we show that they are polynomials in q, t with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate q, t-Kostka numbers are in fact polynomials in q, t with nonnegative integer coefficients, which generalizes the celebrated Macdonald’s positivity conjecture.     

Compactified Jacobians and q,t-Catalan numbers, II

We continue the study of the rational-slope generalized q,t-Catalan numbers c _m,n (q,t). We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property c _m,n (q,1)=c _m,n (1,q) for m=kn±1. We give a bijective proof of the full symmetry c _m,n (q,t)=c _m,n (t,q) for min(m,n)≤3. As a corollary of these combinatorial constructions, we give a simple formula for the Poincaré polynomials of compactified Jacobians of plane curve singularities x ^kn±1=y ⁿ . We also give a geometric interpretation of a relation between rational-slope Catalan numbers and the theory of (m,n)-cores discovered by J. Anderson.     

A q-summation formula,the continuous q-Hahn polynomials and the big q-Jacobi polynomials

Using a general q-summation formula, we derive a generating function for the q-Hahn polynomials, which is used to give a complete proof of the orthogonality relation for the continuous q-Hahn polynomials. A new proof of the orthogonality relation for the big q-Jacobi polynomials is also given. A simple evaluation of the Nassrallah–Rahman integral is derived by using this summation formula. A new q-beta integral formula is established, which includes the Nassrallah–Rahman integral as a special case. The q-summation formula also allows us to recover several strange q-series identities.     

On a result by geronimus

In 1935, Ya.L. Geronimus found the best integral approximation on the period [?π,π) of the function sin(n + 1)t ? 2q sin nt, q ∈ ?, by the subspace of trigonometric polynomials of degree at most n ? 1. This result is an integral analog of the known theorem by E.I. Zolotarev (1868). At present, there are several methods of proving this fact. We propose one more variant of the proof. In the case |q| ≥ 1, we apply the (2π/n)-periodization and the fact that the function | sin nt| is orthogonal to the harmonic cos t on the period. In the case |q| < 1, we use the duality relations for Chebyshev’s theorem (1859) on a rational function least deviating from zero on a closed interval with respect to the uniform metric.     

Relatively prime polynomials and nonsingular Hankel matrices over finite fields

The probability for two monic polynomials of a positive degree n with coefficients in the finite field Fq to be relatively prime turns out to be identical with the probability for an n×n Hankel matrix over Fq to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is the classical notion of Bezoutian of two polynomials. Moreover, we give simpler and direct proofs of the general formulae for the number of m-tuples of relatively prime polynomials over Fq of given degrees and for the number of n×n Hankel matrices over Fq of a given rank.     

A hybrid mean value involving two-term exponential sums and polynomial character sums

Let q ? 3 be a positive integer. For any integers m and n, the two-term exponential sum C(m, n, k; q) is defined by \(C(m,n,k;q) = \sum\limits_{a = 1}^q {e((ma^k + na)/q)} \) , where \(e(y) = e^{2\pi iy} \) . In this paper, we use the properties of Gauss sums and the estimate for Dirichlet character of polynomials to study the mean value problem involving two-term exponential sums and Dirichlet character of polynomials, and give an interesting asymptotic formula for it.     

The symmetric and unimodal expansion of Eulerian polynomials via continued fractions

This paper was motivated by a conjecture of Brändén [P. Brändén, Actions on permutations and unimodality of descent polynomials, European J. Combin. 29 (2) (2008) 514-531] about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the symmetric and unimodal property of the Eulerian numbers. We show that such a formula with the conjectured property can be derived from the combinatorial theory of continued fractions. We also discuss an analogous expansion for the corresponding formula for derangements and prove a (p,q)-analogue of the fact that the (-1)-evaluation of the enumerator polynomials of permutations (resp. derangements) by the number of excedances gives rise to tangent numbers (resp. secant numbers). The (p,q)-analogue unifies and generalizes our recent results [H. Shin, J. Zeng, The q-tangent and q-secant numbers via continued fractions, European J. Combin. 31 (7) (2010) 1689-1705] and that of Josuat-Vergès [M. Josuat-Vergés, A q-enumeration of alternating permutations, European J. Combin. 31 (7) (2010) 1892-1906].     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

Enumeration of totally positive Grassmann cells

Postnikov (Webs in totally positive Grassmann cells, in preparation) has given a combinatorially explicit cell decomposition of the totally nonnegative part of a Grassmannian, denoted Gr_k,n⁺, and showed that this set of cells is isomorphic as a graded poset to many other interesting graded posets. The main result of our work is an explicit generating function which enumerates the cells in Gr_k,n⁺ according to their dimension. As a corollary, we give a new proof that the Euler characteristic of Gr_k,n⁺ is 1. Additionally, we use our result to produce a new q-analog of the Eulerian numbers, which interpolates between the Eulerian numbers, the Narayana numbers, and the binomial coefficients.     

The norm ratio of the polynomials with coefficients as binary sequence

Given a positive integerq, the ratio of the 2q-norm of a polynomial which its coefficients form a binary sequence and its 2-norm arose from telecommunication engineering consists of finding any type of such polynomials having the ratio “small”. In this paper we consider some special types of these polynomials, discuss the sharpest possible upper bound, and prove a result for the ratio. MAIN FACTS: A conjecture over a Rudin-Shapiro polynomialP _n which has degree 2 ⁿ ?1 is that for any integerq, the ratio of its 2 _q norm and its 2 norm is asymptotic to the 2qth root of 2 ^q (q+1)^?1. In other words $||P_n ||_{2q} \sim ||P_n ||_2 \sqrt[{2q}]{{\frac{{2q}}{{q + 1}}}}$ . So far only up toq= 2 has been verified. However if the asymptotic behavior is valid for an evenq, then it is also valid for its next consecutive odd integer.     

Orthogonal designs II

Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to construct Hadamard matrices. We continue our investigation of these designs and show that orthogonal designs of type (1,k) and ordern exist for everyk < n whenn = 2 ^t+2?3 andn = 2 ^t+2?5 (wheret is a positive integer). We also find orthogonal designs that exist in every order 2n and others that exist in every order 4n. Coupled with some results of earlier work, this means that theweighing matrix conjecture ‘For every ordern ≡ 0 (mod 4) there is, for eachk ?n, a square {0, 1, ? 1} matrixW = W(n, k) satisfyingWW ^t =kIn’ is resolved in the affirmative for all ordersn = 2^t+1?3,n = 2^t+1?5 (t a positive integer). The fact that the matrices we find are skew-symmetric for allk < n whenn ≡ 0 (mod 8) and because of other considerations we pose three other conjectures about weighing matrices having additional structure and resolve these conjectures affirmatively in a few cases. In an appendix we give a table of the known results for orders ? 64.     

Product formulas for semigroups with elliptic generators

Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L²($\text{R}$^k) are analyzed in terms of the elementary generator,

$\text{A = (?n)}{}^{\mathrm{<mtext>(</mtext><mtext>n</mtext><mtext>2</mtext><mtext>\; ?\; 1</mtext>}}\text{)(n!)}{}^{\mathrm{?1}}\text{∑}\text{k}\text{j = 1}\text{?}{}^{\mathrm{n}}\text{?x}{}_{\mathrm{j}}{}^{\mathrm{n}}$

, for n even. Integral operators are defined using the fundamental solutions p_n(x, t) to u_t = Au and using real polynomials q_l,…, q_k on $\text{R}$^m by the formula, for q = (q_l,…, q_k),

$\text{(F(t)?)(x) = ∫}$

_$\text{R}$m

$\text{?(x + q(z)) P}{}_{\mathrm{n}}\text{(z, t)dz}$

. It is determined when, strongly on L²($\text{R}$^k),

$\text{e}{}^{\mathrm{tQ}}\text{=}\text{lim}\text{j → ∞}\text{F}\text{t}\text{j}{}^{\mathrm{j}}$

. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.     

Extension of the Kibble-Slepian formula for Hermite polynomials using boson operator methods

The Kibble-Slepian formula expresses the exponential of a quadratic form Q(x) = x^tS(I + S)^?1x, S^t = S, in n variables x = col(x₁,…, x_n) as a series of products of Hermite polynomials, thus generalizing Mehler's formula. This extension is restricted, however, to the case where the diagonal elements of the symmetric matrix S are all unity. We derive the general formula for an arbitrary symmetric matrix S, where I + S is positive definite, using techniques familiar from the boson operator treatment of the harmonic oscillator in quantum mechanics.     

Multivariate generalized Bernstein polynomials: identities for orthogonal polynomials of two variables

We introduce polynomials $B^n_{k}(\boldmath{x};\omega|q)$ of total degree n, where $\boldmath{k} = (k_1,\ldots,k_d)\in\mathbb N_0^d, \; 0\le k_1+\ldots+k_d\le n$ , and $\boldmath{x}=(x_1,x_2,\ldots,x_d)\in\mathbb R^d$ , depending on two parameters q and ω, which generalize the multivariate classical and discrete Bernstein polynomials. For ω=0, we obtain an extension of univariate q-Bernstein polynomials, introduced by Phillips (Ann Numer Math 4:511–518, 1997). Basic properties of the new polynomials are given, including recurrence relations, q-differentiation rules and de Casteljau algorithm. For the case d=2, connections between $B^n_{k}(\boldmath{x};\omega|q)$ and bivariate orthogonal big q-Jacobi polynomials—introduced recently by the first two authors—are given, with the connection coefficients being expressed in terms of bivariate q-Hahn polynomials. As limiting forms of these relations, we give connections between bivariate q-Bernstein and Dunkl’s (little) q-Jacobi polynomials (SIAM J Algebr Discrete Methods 1:137–151, 1980), as well as between bivariate discrete Bernstein and Hahn polynomials.     

Integral approximation of the characteristic function of an interval by trigonometric polynomials

We prove that the value E _n?1(χ _h ) _L of the best integral approximation of the characteristic function χ _h of an interval (?h, h) on the period [?π,π) by trigonometric polynomials of degree at most n ? 1 is expressed in terms of zeros of the Bernstein function cos {nt ? arccos[(2q ? (1 + q ²) cost)/(1 + q ² ? 2q cost)]}, t ∈ [0, π], q ∈ (?1,1). Here, the parameters q, h, and n are connected in a special way; in particular, q = sech ? tanh for h = π/n.