Math 2.0

Combinatorics Definition

Jack function

Builds on Symmetric functionInteger partitionPower sum symmetric polynomial

Definition

Let α\alpha be a positive real number, and let Λ\Lambda be the ring of symmetric functions in variables x=(x1,x2,… )x = (x_1, x_2, \dots) with real coefficients. For a partition λ\lambda with ℓ(λ)\ell(\lambda) parts, let mλm_\lambda be the monomial symmetric function and pλ=pλ1pλ2⋯p_\lambda = p_{\lambda_1} p_{\lambda_2} \cdots the product of power sums. Let zλ=∏i≥1imimi!z_\lambda = \prod_{i \ge 1} i^{m_i} m_i!, where mim_i is the number of parts of λ\lambda equal to ii. Define a bilinear form on Λ\Lambda by ⟨pλ,pμ⟩α=δλμ zλ αℓ(λ)\langle p_\lambda, p_\mu \rangle_\alpha = \delta_{\lambda\mu}\, z_\lambda\, \alpha^{\ell(\lambda)}, and write μ<λ\mu < \lambda for the strict dominance order on partitions of the same number. The monic Jack functions are the unique family (Pλ(α))λ(P_\lambda^{(\alpha)})_\lambda in Λ\Lambda such that:

  1. Pλ(α)=mλ+∑μ<λcλμmμP_\lambda^{(\alpha)} = m_\lambda + \sum_{\mu < \lambda} c_{\lambda\mu} m_\mu for some coefficients cλμc_{\lambda\mu};
  2. ⟨Pλ(α),Pμ(α)⟩α=0\langle P_\lambda^{(\alpha)}, P_\mu^{(\alpha)} \rangle_\alpha = 0 for λ≠μ\lambda \ne \mu.

For a box ss of the Young diagram of λ\lambda, let a(s)a(s) be the number of boxes to its right. Let l(s)l(s) be the number of boxes below ss. The Jack function is Jλ(α)=cλ(α) Pλ(α)J_\lambda^{(\alpha)} = c_\lambda(\alpha)\, P_\lambda^{(\alpha)} with cλ(α)=∏s∈λ(α a(s)+l(s)+1)c_\lambda(\alpha) = \prod_{s \in \lambda} \big(\alpha\, a(s) + l(s) + 1\big).

Remarks

Example: in degree 22, P(2)(α)=m(2)+21+αm(1,1)P_{(2)}^{(\alpha)} = m_{(2)} + \frac{2}{1+\alpha} m_{(1,1)} and P(1,1)(α)=m(1,1)P_{(1,1)}^{(\alpha)} = m_{(1,1)}. Check: m(2)=p2m_{(2)} = p_2 and m(1,1)=12(p12−p2)m_{(1,1)} = \frac12 (p_1^2 - p_2), so P(2)(α)=α1+αp2+11+αp12P_{(2)}^{(\alpha)} = \frac{\alpha}{1+\alpha} p_2 + \frac{1}{1+\alpha} p_1^2. With ⟨p2,p2⟩α=2α\langle p_2, p_2 \rangle_\alpha = 2\alpha and ⟨p12,p12⟩α=2α2\langle p_1^2, p_1^2 \rangle_\alpha = 2\alpha^2, one gets ⟨P(2)(α),m(1,1)⟩α=12(−2α21+α+2α21+α)=0\langle P_{(2)}^{(\alpha)}, m_{(1,1)} \rangle_\alpha = \frac12 \left( -\frac{2\alpha^2}{1+\alpha} + \frac{2\alpha^2}{1+\alpha} \right) = 0. The normalization gives J(2)(α)=(1+α)m(2)+2m(1,1)J_{(2)}^{(\alpha)} = (1+\alpha) m_{(2)} + 2 m_{(1,1)} and J(1,1)(α)=2m(1,1)J_{(1,1)}^{(\alpha)} = 2 m_{(1,1)}.

Non-example: the Schur function s(2)=m(2)+m(1,1)s_{(2)} = m_{(2)} + m_{(1,1)} satisfies clause 1 but fails clause 2 for α≠1\alpha \ne 1, since ⟨s(2),m(1,1)⟩α=α2−α2\langle s_{(2)}, m_{(1,1)} \rangle_\alpha = \frac{\alpha^2 - \alpha}{2}.

At α=1\alpha = 1 the form is the Hall inner product, Pλ(1)=sλP_\lambda^{(1)} = s_\lambda, and Jλ(1)J_\lambda^{(1)} is sλs_\lambda times the product of the hook lengths of λ\lambda. At α=2\alpha = 2, Jλ(2)J_\lambda^{(2)} are the zonal polynomials. Existence of the family is a theorem; it is not automatic, because dominance is only a partial order. Restricting to nn variables gives the Jack polynomials Jλ(α)(x1,…,xn)J_\lambda^{(\alpha)}(x_1, \dots, x_n), which vanish when ℓ(λ)>n\ell(\lambda) > n.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Integer partition concept
  2. Power sum symmetric polynomial concept
  3. Symmetric function concept
  4. Jack function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Jack_function
About this page
TagFSCCNPWXBR
URIm2://FSCCNPWXBR
Kinddefinition
WritingW0 stub
MSC05E05, 33C52
DefinesJack function
UsesSymmetric function, Integer partition, Power sum symmetric polynomial

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.