Search arXivSearch

arXiv · 2510.10875

A Characterization of Macdonald's Jack Hypergeometric Series ${}_pF_q(x;α)$ and ${}_pF_q(x,y;α)$ via Differential Equations

Abstract

In a widely circulated manuscript from the 1980s, now available on the arXiv, I.~G.~Macdonald introduced certain multivariable hypergeometric series ${}_pF_q(x)= {}_pF_q(x;α)$ and ${}_pF_q(x,y)= {}_pF_q(x,y;α)$ in one and two sets of variables $x=(x_1,\dots x_n)$ and $y=(y_1,\dots y_n)$. These two series are defined by explicit expansions in terms of Jack polynomials $J^{(α)}_λ$, and for $α=2$ they specialize to the hypergeometric series of matrix arguments studied by Herz (1955) and Constantine (1963) that admit analogous expansions in terms of zonal polynomials. In this paper we determine explicit partial differential equations that characterize ${}_pF_q$, thereby answering a question posed by Macdonald. More precisely, for each $n,p,q$ we construct three differential operators $\mathcal A=\mathcal A^{(x,y)}$, $\mathcal B=\mathcal B^{(x)}$, $\mathcal C=C^{(x)}$, and we show that ${}_pF_q(x,y)$ and ${}_pF_q(x)$ are the unique series solutions of the equations $\mathcal A(f)=0$ and $\mathcal C(f)=0$, respectively, subject to certain symmetry and boundary conditions. We also prove that the equation $\mathcal B(f)=0$ characterizes ${}_pF_q(x)$, but only after one restricts the domain of $\mathcal B$ to the set of series satisfying an additional stability condition with respect to $n$. Special cases of the operators $\mathcal A$ and $\mathcal B$ have been constructed previously in the literature, but only for a small number of pairs $(p,q)$, namely for $p \leq 3$ and $q \leq 2$ in the zonal case by Muirhead (1970), Constantine--Muirhead (1972), and Fujikoshi (1975); and for $p \leq 2$ and $q \leq 1$ in the general Jack case by Macdonald (1980s), Yan (1992), Kaneko (1993), and Baker--Forrester (1997). However the operator $\mathcal C$ seems to be new even for these special cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Chen, Siddhartha Sahi. 2025-10-13. A Characterization of Macdonald's Jack Hypergeometric Series ${}_pF_q(x;α)$ and ${}_pF_q(x,y;α)$ via Differential Equations. https://arxiv.org/abs/2510.10875

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO