Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > math > arXiv:2006.15086

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Mathematics > Combinatorics

arXiv:2006.15086 (math)
[Submitted on 26 Jun 2020 (v1), last revised 31 Mar 2021 (this version, v3)]

Title:A combinatorial formula for Sahi, Stokman, and Venkateswaran's generalization of Macdonald polynomials

Authors:Jason Saied
View a PDF of the paper titled A combinatorial formula for Sahi, Stokman, and Venkateswaran's generalization of Macdonald polynomials, by Jason Saied
View PDF
Abstract:Sahi, Stokman, and Venkateswaran have constructed, for each positive integer $n$, a family of Laurent polynomials depending on parameters $q$ and $k$ (in addition to $\lfloor n/2\rfloor$ "metaplectic parameters"), such that the $n=1$ case recovers the nonsymmetric Macdonald polynomials and the $q\rightarrow\infty$ limit yields metaplectic Iwahori-Whittaker functions with arbitrary Gauss sum parameters. In this paper, we study these new polynomials, which we call SSV polynomials, in the case of $GL_r$. We apply a result of Ram and Yip in order to give a combinatorial formula for the SSV polynomials in terms of alcove walks. The formula immediately shows that the SSV polynomials satisfy a triangularity property with respect to a version of the Bruhat order, which in turn gives an independent proof that the SSV polynomials are a basis for the space of Laurent polynomials. The result is also used to show that the SSV polynomials have \emph{fewer} terms than the corresponding Macdonald polynomials. We also record an alcove walk formula for the natural generalization of the permuted basement Macdonald polynomials. We then construct a symmetrized variant of the SSV polynomials: these are symmetric with respect to a conjugate of the Chinta-Gunnells Weyl group action and reduce to symmetric Macdonald polynomials when $n=1$. We obtain an alcove walk formula for the symmetrized polynomials as well. Finally, we calculate the $q\rightarrow 0$ and $q\rightarrow \infty$ limits of the SSV polynomials and observe that our combinatorial formula can be written in terms of alcove walks with only positive and negative folds respectively. In both of these $q$-limit cases, we also observe a positivity result for the coefficients.
Comments: 51 pages, 1 figure
Subjects: Combinatorics (math.CO); Representation Theory (math.RT)
MSC classes: 33D52, 05E05, 05E10
Cite as: arXiv:2006.15086 [math.CO]
  (or arXiv:2006.15086v3 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2006.15086
arXiv-issued DOI via DataCite

Submission history

From: Jason Saied [view email]
[v1] Fri, 26 Jun 2020 16:34:56 UTC (86 KB)
[v2] Tue, 21 Jul 2020 04:45:18 UTC (86 KB)
[v3] Wed, 31 Mar 2021 01:28:36 UTC (87 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled A combinatorial formula for Sahi, Stokman, and Venkateswaran's generalization of Macdonald polynomials, by Jason Saied
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2020-06
Change to browse by:
math
math.RT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack