Integrability and combinatorics

Published 20 Apr 2024 in math.CO, math-ph, and math.MP | (2404.13221v1)

Abstract: We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the theory of symmetric polynomials.

Abstract PDF HTML Upgrade to Chat

Citations (3)

View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Create Your Own

Whiteboard

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

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

Generalizations of the Razumov–Stroganov correspondence

Continue Learning

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

Authors (1)

Paul Zinn-Justin

Collections

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

Tweets

Sign up for free to view the 5 tweets with 28 likes about this paper.

Sign Up for Free