Search arXivSearch

arXiv · 1104.3260

Evaluation and normalization of Jack superpolynomials

Abstract

Two evaluation formulas are derived for the Jack superpolynomials. The evaluation formulas are expressed in terms of products of fillings of skew diagrams. One of these formulas is nothing but the evaluation formula of the Jack polynomials with prescribed symmetry, which thereby receives here a remarkably simple formulation. Among the auxiliary results required to establish the evaluation formulas, the determination of the conditions ensuring the non-vanishing coefficients in a Pieri-type rule for Jack superpolynomials is worth pointing out. An important application of the evaluation formulas is a new derivation of the combinatorial norm of the Jack superpolynomials. We finally mention that the introduction of a simpler version of the dominance ordering on superpartitions is fundamental to establish our results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Desrosiers, Luc Lapointe, Pierre Mathieu. 2011-04-19. Evaluation and normalization of Jack superpolynomials. https://doi.org/10.1093/imrn%2Frnr235

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO