Search arXivSearch

arXiv · 2502.10965

Higher Rank Macdonald Polynomials

Abstract

In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial representations of double affine Hecke algebras with respect to higher rank Cherednik operators. We prove that these polynomials satisfy generalized versions of the classical Knop--Sahi relations and we give combinatorial descriptions of their weights. The higher rank symmetric Macdonald polynomials are defined as Hecke-symmetrizations of the higher rank non-symmetric Macdonald polynomials and form eigenbases for the spaces of Hecke-invariant higher rank polynomials with respect to generalized finite variable Macdonald operators. We prove that the higher rank symmetric Macdonald polynomials satisfy stability properties allowing for the construction of infinite variable limits. These higher rank symmetric Macdonald functions form eigenbases for certain representations of the (positive) elliptic Hall algebra with respect to generalized infinite variable Macdonald operators. Lastly, we show that the higher rank polynomial representations may be used to construct higher rank polynomial representations of the double Dyck path algebra. This is a copy of the author's accepted extended abstract for FPSAC2025.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milo Bechtloff Weising. 2025-02-16. Higher Rank Macdonald Polynomials. https://arxiv.org/abs/2502.10965

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