Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.19796

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals

Dipnit Biswas·Irfan Habib
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove an inductive formula to construct a path from the highest weight element to any given vertex in the crystal graph of the polytope realization of the Kirillov-Reshetikhin crystal $KR^{i,m}$ of type $A$. For $i \leq 2$ or $i \geq n-1$, we provide explicit formulas of the same by only using the lowering crystal operators and in those cases, using these paths, we determine the explicit image of any element under the affine crystal isomorphisms between the polytope and the tableau realizations of the Kirillov-Reshetikhin crystals.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dipnit Biswas, Irfan Habib. 2025-09-11. On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals. https://arxiv.org/abs/2508.19796

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO↗
arXiv2026

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO↗