Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 73 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Hybrid Grothendieck polynomials (2505.19072v1)

Published 25 May 2025 in math.CO, math.AG, and math.RT

Abstract: For a skew shape $\lambda/\mu$, we define the hybrid Grothendieck polynomial $${G}{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w}) =\sum{T\in \mathrm{SVRPP}(\lambda/\mu)} \textbf{x}{\mathrm{ircont}(T)}\textbf{t}{\mathrm{ceq} (T)}\textbf{w}{\mathrm{ex}(T)}$$ as a weight generating function over set-valued reverse plane partitions of shape $\lambda/\mu$. It specializes to \begin{itemize} \item[(1)] the refined stable Grothendieck polynomial introduced by Chan--Pflueger by setting all $t_i=0$; \item[(2)] the refined dual stable Grothendieck polynomial introduced by Galashin--Grinberg--Liu by setting all $w_i=0$. \end{itemize} We show that ${G}{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w})$ is symmetric in the $\textbf{x}$ variables. By building a crystal structure on set-valued reverse plane partitions, we obtain the expansion of ${G}{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w})$ in the basis of Schur functions, extending previous work by Monical--Pechenik--Scrimshaw and Galashin. Based on the Schur expansion, we deduce that hybrid Grothendieck polynomials of straight shapes have saturated Newton polytopes. Finally, using Fomin--Greene's theory on noncommutative Schur functions, we give a combinatorial formula for the image of ${G}_{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w})$ (in the case $t_i=\alpha$ and $w_i=\beta$) under the omega involution on symmetric functions. The formula unifies the structures of weak set-valued tableaux and valued-set tableaux introduced by Lam--Pylyavskyy. Several problems and conjectures are motivated and discussed.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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