Symmetrization of Nonsymmetric Macdonald Polynomials and Macdonald's Inner Product Identities

We study the Macdonald polynomials that give eigenstates of some quantum many-body system with long-range interactions. Scalar products of the nonsymmetric Macdonald polynomials are algebraically evaluated through their Rodrigues-type formulas. We present a new proof of Macdonald's inner product identities without recourse to the shift operators; that is, we calculate square norms of the Macdonald polynomials through Weyl-symmetrization of those of the nonsymmetric Macdonald polynomials.     

Identities involving Narayana polynomials and Catalan numbers

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give three different proofs for these identities, namely, two algebraic proofs and one combinatorial proof. Some applications are also given which lead to many known and new identities.     

Specializations of nonsymmetric Macdonald–Koornwinder polynomials

The purpose of this article is to work out the details of the Ram–Yip formula for nonsymmetric Macdonald–Koornwinder polynomials for the double affine Hecke algebras of not-necessarily reduced affine root systems. It is shown that the \(t\rightarrow 0\) equal-parameter specialization of nonsymmetric Macdonald polynomials admits an explicit combinatorial formula in terms of quantum alcove paths, generalizing the formula of Lenart in the untwisted case. In particular, our formula yields a definition of quantum Bruhat graph for all affine root systems. For mixed type, the proof requires the Ram–Yip formula for the nonsymmetric Koornwinder polynomials. A quantum alcove path formula is also given at \(t\rightarrow \infty \). As a consequence, we establish the positivity of the coefficients of nonsymmetric Macdonald polynomials under this limit, as conjectured by Cherednik and the first author. Finally, an explicit formula is given at \(q\rightarrow \infty \), which yields the p-adic Iwahori–Whittaker functions of Brubaker, Bump, and Licata.     

An intuitionistic formula hierarchy based on high‐school identities

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e., sequent) isomorphisms corresponding to the high‐school identities, we show that one can obtain a more compact variant of a proof system, consisting of non‐invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalization procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non‐invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first‐order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism.     

Algebras Generated by Linearly Dependent Elements with Prescribed Spectra

We consider associative algebras presented by a finite set of generators and relations of special form: each generator is annihilated by some polynomial, and the sum of generators is zero. The growth of this algebra in dependence on the degrees of the polynomials annihilating the generators is studied. The tuples of degrees for which the algebras are finite-dimensional, have polynomial growth, or have exponential growth are indicated. To the tuple of degrees, we assign a graph, and the above-mentioned cases correspond to Dynkin diagrams, extended Dynkin diagrams, and the other graphs, respectively. For extended Dynkin diagrams, we indicate the hyperplane in the space of parameters (roots of the polynomials) on which the corresponding algebras satisfy polynomial identities.     

Symmetric and nonsymmetric Macdonald polynomials

The symmetric Macdonald polynomials may be constructed from the nonsymmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their nonsymmetric counterparts. In taking this approach we are able to obtain new results as well as simpler and more accessible derivations of a number of the known fundamental properties of both kinds of polynomials.Supported by an APA scholarship.     

Generalized Dedekind symbols associated with the Eisenstein series

We have shown recently that the space of modular forms, the space of generalized Dedekind sums, and the space of period polynomials are all isomorphic. In this paper, we will prove, under these isomorphisms, that the Eisenstein series correspond to the Apostol generalized Dedekind sums, and that the period polynomials are expressed in terms of Bernoulli numbers. This gives us a new more natural proof of the reciprocity law for the Apostol generalized Dedekind sums. Our proof yields as a by-product new polylogarithm identities.

     

A new approach to constant term identities and Selberg-type integrals

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a general interpolation based method that is powerful enough to establish many such identities in a simple manner. The main consequence is the proof of a conjecture of Forrester related to the Calogero–Sutherland model. In fact we prove a more general theorem, which includes Aomoto's constant term identity at the same time. We also demonstrate the relevance of the method in additive combinatorics.     

Bressoud polynomials,Rogers–Ramanujan type identities,and applications

In his paper providing an easy proof of the Rogers–Ramanujan identities, D. Bressoud extended his work to multiple series identities. Intrinsic in his works are polynomials with diverse applications to several aspects of \(q\)-series. This paper provides an initial exploration of these polynomials.     

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.     

A local-global principle for linear dependence of noncommutative polynomials

A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly dependent set of polynomials is linearly dependent. In this short note an alternative proof based on the theory of polynomial identities is given. The method of the proof yields generalizations to directional local linear dependence and evaluations in general algebras over fields of arbitrary characteristic. A main feature of the proof is that it makes it possible to deduce bounds on the size of the matrices where the (directional) local linear dependence needs to be tested in order to establish linear dependence.     

An algebraic identity and the Jacobi–Trudi formula

The first Jacobi–Trudi identity expresses Schur polynomials as determinants of matrices, the entries of which are complete homogeneous polynomials. The Schur polynomials were defined by Cauchy in 1815 as the quotients of determinants constructed from certain partitions. The Schur polynomials have become very important because of their close relationship with the irreducible characters of the symmetric groups and the general linear groups, as well as due to their numerous applications in combinatorics. The Jacobi–Trudi identity was first formulated by Jacobi in 1841 and proved by Nicola Trudi in 1864. Since then, this identity and its numerous generalizations have been the focus of much attention due to the important role which they play in various areas of mathematics, including mathematical physics, representation theory, and algebraic geometry. Various proofs of the Jacobi–Trudi identity, which are based on different ideas (in particular, a natural combinatorial proof using Young tableaux), have been found. The paper contains a short simple proof of the first Jacobi–Trudi identity and discusses its relationship with other well-known polynomial identities.     

The Vanishing of the Theta Function in the KP Direction: A Geometric Approach

We give a geometric proof of a formula, due to Segal and Wilson, which describes the order of vanishing of the Riemann theta function in the direction which corresponds to the direction of the tangent space of a Riemann surface at a marked point. While this formula appears in the work of Segal and Wilson as a by-product of some nontrivial constructions from the theory of integrable systems (loop groups, infinite-dimensional Grassmannians, tau functions, Schur polynomials, etc.) our proof only uses the classical theory of linear systems on Riemann surfaces.     

Nonsymmetric Macdonald polynomials and matrix coefficients for unramified principal series

We show how a certain limit of the nonsymmetric Macdonald polynomials appears in the representation theory of semisimple groups over p-adic fields as matrix coefficients for the unramified principal series representations. The result is the nonsymmetric counterpart of a classical result relating the same limit of the symmetric Macdonald polynomials to zonal spherical functions on groups of p-adic type.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Standard bases for affine parabolic modules and nonsymmetric Macdonald polynomials

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 coefficients of symmetric and nonsymmetric Macdonald polynomials.     

基于吴方法的几何定理证明的恒等式方法

多年来通常认为以吴方法为代表的几何定理机器证明的坐标法给出的证明不可读,或不是图灵意义下的类人解答.其实,只要对吴氏的算法做不多的改进,即将命题的结论多项式表示为其条件多项式的线性组合,就能获得不依赖于理论、算法和大量计算过程的恒等式明证.这样的恒等式可以转化为其他更简明且更有直观几何意义的点几何形式或向量及其他形式,从而获得多种证明方法.这也证明了点几何恒等式明证方法对等式型几何命题的普遍有效性.     

Multivariable Wilson polynomials and degenerate Hecke algebras

We study a rational version of the double affine Hecke algebra associated to the nonreduced affine root system of type (C^ú_n, C_n){(C^\vee_{n}, C_{n})} . A certain representation in terms of difference-reflection operators naturally leads to the definition of nonsymmetric versions of the multivariable Wilson polynomials. Using the degenerate Hecke algebra we derive several properties, such as orthogonality relations and quadratic norms, for the nonsymmetric and symmetric multivariable Wilson polynomials.     

Minor summation formula and a proof of Stanley’s open problem

In the open problem session of the FPSAC’03, R.P. Stanley gave an open problem about a certain sum of the Schur functions. The purpose of this paper is to give a proof of this open problem. The proof consists of three steps. At the first step we express the sum by a Pfaffian as an application of our minor summation formula (Ishikawa and Wakayama in Linear Multilinear Algebra 39:285–305, 1995). In the second step we prove a Pfaffian analogue of a Cauchy type identity which generalizes Sundquist’s Pfaffian identities (J. Algebr. Comb. 5:135–148, 1996). Then we give a proof of Stanley’s open problem in Sect. 4. At the end of this paper we present certain corollaries obtained from this identity involving the Big Schur functions and some polynomials arising from the Macdonald polynomials, which generalize Stanley’s open problem.      

GPBi‐CGstab(L): A Lanczos‐type product method unifying Bi‐CGstab(L) and GPBi‐CG

Lanczos‐type product methods (LTPMs), in which the residuals are defined by the product of stabilizing polynomials and the Bi‐CG residuals, are effective iterative solvers for large sparse nonsymmetric linear systems. Bi‐CGstab(L) and GPBi‐CG are popular LTPMs and can be viewed as two different generalizations of other typical methods, such as CGS, Bi‐CGSTAB, and Bi‐CGStab2. Bi‐CGstab(L) uses stabilizing polynomials of degree L, while GPBi‐CG uses polynomials given by a three‐term recurrence (or equivalently, a coupled two‐term recurrence) modeled after the Lanczos residual polynomials. Therefore, Bi‐CGstab(L) and GPBi‐CG have different aspects of generalization as a framework of LTPMs. In the present paper, we propose novel stabilizing polynomials, which combine the above two types of polynomials. The resulting method is referred to as GPBi‐CGstab(L). Numerical experiments demonstrate that our presented method is more effective than conventional LTPMs.