Papers
Topics
Authors
Recent
Search
2000 character limit reached

Macdonald polynomials for super-partitions

Published 3 Jul 2024 in hep-th, math-ph, math.MP, math.QA, and math.RT | (2407.03301v1)

Abstract: We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables: usual $p_k$ variables are accompanied by anti-commuting Grassmann variables $\theta_k$. Starting from recently defined super-Schur polynomials and exploiting orthogonality relations with triangular decompositions we are able to fully determine super-Macdonald polynomials. These new polynomials have similar properties to canonical Macdonald polynomials -- they respect two different orderings in the set of (super)-Young diagrams simultaneously.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.