Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.12666

Keys and Evacuation via Virtualization

Olga Azenhas·Nicolle González·Daoji Huang·Jacinta Torres
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the relation between the key map and virtualization of crystals. Namely, we prove that virtualization between crystals in any two finite Cartan types commutes with the left and right key maps, thus embedding Demazure crystals and atoms correspondingly. In particular, this implies that the key map in any finite Cartan type can be reduced to the key map in a simply-laced type, provided an appropriate virtualization exists, generalizing the work of Azenhas--Santos. As an application, we study these maps in the context of orthogonal Kashiwara--Nakashima tableaux and show that the virtualizations from type B into C considered independently by Fujita and Pappe--Pfannerer--Schilling--Simone coincide with the splitting map of De Concini and Lecouvey. As a consequence, this enables us to give a new and purely combinatorial definition of orthogonal evacuation.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olga Azenhas, Nicolle González, Daoji Huang, Jacinta Torres. 2025-07-07. Keys and Evacuation via Virtualization. https://arxiv.org/abs/2409.12666

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗