Classical symmetric functions in superspace

We present the basic elements of a generalization of symmetric function theory involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal action of the symmetric group on the sets of commuting and anticommuting variables. In this work, we present the superspace extension of the classical bases, namely, the monomial symmetric functions, the elementary symmetric functions, the completely symmetric functions, and the power sums. Various basic results, such as the generating functions for the multiplicative bases, Cauchy formulas, involution operations as well as the combinatorial scalar product are also generalized.Comment: 21 pages, this supersedes the first part of math.CO/041230

Macdonald polynomials in superspace: conjectural definition and positivity conjectures

We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple form for the norm of the Macdonald polynomials in superspace, and a rather non-trivial expression for their evaluation. We study the limiting cases q=0 and q=\infty, which lead to two families of Hall-Littlewood polynomials in superspace. We also find that the Macdonald polynomials in superspace evaluated at q=t=0 or q=t=\infty seem to generalize naturally the Schur functions. In particular, their expansion coefficients in the corresponding Hall-Littlewood bases appear to be polynomials in t with nonnegative integer coefficients. More strikingly, we formulate a generalization of the Macdonald positivity conjecture to superspace: the expansion coefficients of the Macdonald superpolynomials expanded into a modified version of the Schur superpolynomial basis (the q=t=0 family) are polynomials in q and t with nonnegative integer coefficients.Comment: 18 page

The averaged characteristic polynomial for the Gaussian and chiral Gaussian ensembles with a source

In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real quaternion $(\beta = 4$) elements. We use the Dyson Brownian motion model to give a meaning for general $\beta > 0$. In the Gaussian case a further construction valid for $\beta > 0$ is given, as the eigenvalue PDF of a recursively defined random matrix ensemble. In the case of real or complex elements, a combinatorial argument is used to compute the averaged characteristic polynomial. The resulting functional forms are shown to be a special cases of duality formulas due to Desrosiers. New derivations of the general case of Desrosiers' dualities are given. A soft edge scaling limit of the averaged characteristic polynomial is identified, and an explicit evaluation in terms of so-called incomplete Airy functions is obtained.Comment: 21 page

Explicit formulas for the generalized Hermite polynomials in superspace

We provide explicit formulas for the orthogonal eigenfunctions of the supersymmetric extension of the rational Calogero-Moser-Sutherland model with harmonic confinement, i.e., the generalized Hermite (or Hi-Jack) polynomials in superspace. The construction relies on the triangular action of the Hamiltonian on the supermonomial basis. This translates into determinantal expressions for the Hamiltonian's eigenfunctions.Comment: 19 pages. This is a recasting of the second part of the first version of hep-th/0305038 which has been splitted in two articles. In this revised version, the introduction has been rewritten and a new appendix has been added. To appear in JP

Jack superpolynomials with negative fractional parameter: clustering properties and super-Virasoro ideals

The Jack polynomials P_\lambda^{(\alpha)} at \alpha=-(k+1)/(r-1) indexed by certain (k,r,N)-admissible partitions are known to span an ideal I^{(k,r)}_N of the space of symmetric functions in N variables. The ideal I^{(k,r)}_N is invariant under the action of certain differential operators which include half the Virasoro algebra. Moreover, the Jack polynomials in I^{(k,r)}_N admit clusters of size at most k: they vanish when k+1 of their variables are identified, and they do not vanish when only k of them are identified. We generalize most of these properties to superspace using orthogonal eigenfunctions of the supersymmetric extension of the trigonometric Calogero-Moser-Sutherland model known as Jack superpolynomials. In particular, we show that the Jack superpolynomials P_{\Lambda}^{(\alpha)} at \alpha=-(k+1)/(r-1) indexed by certain (k,r,N)-admissible superpartitions span an ideal {\mathcal I}^{(k,r)}_N of the space of symmetric polynomials in N commuting variables and N anticommuting variables. We prove that the ideal {\mathcal I}^{(k,r)}_N is stable with respect to the action of the negative-half of the super-Virasoro algebra. In addition, we show that the Jack superpolynomials in {\mathcal I}^{(k,r)}_N vanish when k+1 of their commuting variables are equal, and conjecture that they do not vanish when only k of them are identified. This allows us to conclude that the standard Jack polynomials with prescribed symmetry should satisfy similar clustering properties. Finally, we conjecture that the elements of {\mathcal I}^{(k,2)}_N provide a basis for the subspace of symmetric superpolynomials in N variables that vanish when k+1 commuting variables are set equal to each other.Comment: 36 pages; the main changes in v2 are : 1) in the introduction, we present exceptions to an often made statement concerning the clustering property of the ordinary Jack polynomials for (k,r,N)-admissible partitions (see Footnote 2); 2) Conjecture 14 is substantiated with the extensive computational evidence presented in the new appendix C; 3) the various tests supporting Conjecture 16 are reporte

Supersymmetric Many-particle Quantum Systems with Inverse-square Interactions

The development in the study of supersymmetric many-particle quantum systems with inverse-square interactions is reviewed. The main emphasis is on quantum systems with dynamical OSp(2|2) supersymmetry. Several results related to exactly solved supersymmetric rational Calogero model, including shape invariance, equivalence to a system of free superoscillators and non-uniqueness in the construction of the Hamiltonian, are presented in some detail. This review also includes a formulation of pseudo-hermitian supersymmetric quantum systems with a special emphasis on rational Calogero model. There are quite a few number of many-particle quantum systems with inverse-square interactions which are not exactly solved for a complete set of states in spite of the construction of infinitely many exact eigen functions and eigenvalues. The Calogero-Marchioro model with dynamical SU(1,1|2) supersymmetry and a quantum system related to short-range Dyson model belong to this class and certain aspects of these models are reviewed. Several other related and important developments are briefly summarized.Comment: LateX, 65 pages, Added Acknowledgment, Discussions and References, Version to appear in Jouranl of Physics A: Mathematical and Theoretical (Commissioned Topical Review Article

Non-intersecting squared Bessel paths: critical time and double scaling limit

We consider the double scaling limit for a model of $n$ non-intersecting squared Bessel processes in the confluent case: all paths start at time $t=0$ at the same positive value $x=a$, remain positive, and are conditioned to end at time $t=1$ at $x=0$. After appropriate rescaling, the paths fill a region in the $tx$--plane as $n\to \infty$ that intersects the hard edge at $x=0$ at a critical time $t=t^{*}$. In a previous paper (arXiv:0712.1333), the scaling limits for the positions of the paths at time $t\neq t^{*}$ were shown to be the usual scaling limits from random matrix theory. Here, we describe the limit as $n\to \infty$ of the correlation kernel at critical time $t^{*}$ and in the double scaling regime. We derive an integral representation for the limit kernel which bears some connections with the Pearcey kernel. The analysis is based on the study of a $3\times 3$ matrix valued Riemann-Hilbert problem by the Deift-Zhou steepest descent method. The main ingredient is the construction of a local parametrix at the origin, out of the solutions of a particular third-order linear differential equation, and its matching with a global parametrix.Comment: 53 pages, 15 figure

Equivalence of the super Lax and local Dunkl operators for Calogero-like models

Following Shastry and Sutherland I construct the super Lax operators for the Calogero model in the oscillator potential. These operators can be used for the derivation of the eigenfunctions and integrals of motion of the Calogero model and its supersymmetric version. They allow to infer several relations involving the Lax matrices for this model in a fast way. It is shown that the super Lax operators for the Calogero and Sutherland models can be expressed in terms of the supercharges and so called local Dunkl operators constructed in our recent paper with M. Ioffe. Several important relations involving Lax matrices and Hamiltonians of the Calogero and Sutherland models are easily derived from the properties of Dunkl operators.Comment: 25 pages, Latex, no figures. Accepted for publication in: Jounal of Physics A: Mathematical and Genera

Non-intersecting squared Bessel paths and multiple orthogonal polynomials for modified Bessel weights

We study a model of $n$ non-intersecting squared Bessel processes in the confluent case: all paths start at time $t = 0$ at the same positive value $x = a$, remain positive, and are conditioned to end at time $t = T$ at $x = 0$. In the limit $n \to \infty$, after appropriate rescaling, the paths fill out a region in the $tx$-plane that we describe explicitly. In particular, the paths initially stay away from the hard edge at $x = 0$, but at a certain critical time $t^*$ the smallest paths hit the hard edge and from then on are stuck to it. For $t \neq t^*$ we obtain the usual scaling limits from random matrix theory, namely the sine, Airy, and Bessel kernels. A key fact is that the positions of the paths at any time $t$ constitute a multiple orthogonal polynomial ensemble, corresponding to a system of two modified Bessel-type weights. As a consequence, there is a $3 \times 3$ matrix valued Riemann-Hilbert problem characterizing this model, that we analyze in the large $n$ limit using the Deift-Zhou steepest descent method. There are some novel ingredients in the Riemann-Hilbert analysis that are of independent interest.Comment: 59 pages, 11 figure