Related papers: Growth Diagrams for Schubert RSK
We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…
We describe a relationship between work of Laksov, Gatto, and their collaborators on realizations of (generalized) Schubert calculus of Grassmannians, and the geometric Satake correspondence of Lusztig, Ginzburg, and Mirkovi\'c and Vilonen.…
An approach to Schubert calculus is to realize Schubert classes as concrete combinatorial objects such as Schubert polynomials. Using the polytope ring of the Gelfand-Tsetlin polytopes, Kiritchenko-Smirnov-Timorin realized each Schubert…
Based on dynamical renormalization group (RG) calculations to the one-loop order, the surface growth described by a nonlinear stochastic conserved growth equation, {\partial h \over \partial t} = \pm \nu_2 \nabla^2 h + \lambda\nabla \cdot…
We announce the extension of optimal regularity and Uhlenbeck compactness to the general setting of connections on vector bundles with non-compact gauge groups over non-Riemannian manifolds, including the Lorentzian metric connections of…
We sketch a construction of Legendrian Symplectic Field Theory (SFT) for conormal tori of knots and links. Using large $N$ duality and Witten's connection between open Gromov-Witten invariants and Chern-Simons gauge theory, we relate the…
Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…
We consider the Dubrovin--Frobenius manifold of rank $2$ whose genus expansion at a special point controls the enumeration of a higher genera generalization of the Catalan numbers, or, equivalently, the enumeration of maps on surfaces,…
In this paper we first generalize to the case of partial flags a result proved both by Spaltenstein and by Steinberg that relates the relative position of two complete flags and the irreducible components of the flag variety in which they…
We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial…
In this paper we study the role of planarity in generalized scattering amplitudes, through several closely interacting structures in combinatorics, algebraic and tropical geometry. The generalized biadjoint scalar amplitude, introduced…
We relate the counting of honeycomb dimer configurations on the cylinder to the counting of certain vertices in Kirillov-Reshetikhin crystal graphs. We show that these dimer configurations yield the quantum Kostka numbers of the small…
The present contribution is the written counterpart of a talk given in Yerevan at the SQS'2019 International Workshop "Supersymmetries and Quantum Symmetries" (SQS'2019, 26 August - August 31, 2019). After a short presentation of various…
Rig groupoids provide a semantic model of \PiLang, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of…
For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…
Given an rc-graph $R$ of permutation $w$ and an rc-graph $Y$ of permutation $v$, we provide an insertion algorithm, which defines an rc-graph $R\leftarrow Y$ in the case when $v$ is a shuffle with the descent at $r$ and $w$ has no descents…
We study "cominuscule tableau combinatorics" by generalizing constructions of M. Haiman, S. Fomin and M.-P. Sch\"utzenberger. In particular, we extend the dual equivalence ideas of [Haiman, 1992] to reformulate the generalized…
The \hbar-dependent KP hierarchy is a formulation of the KP hierarchy that depends on the Planck constant \hbar and reduces to the dispersionless KP hierarchy as \hbar -> 0. A recursive construction of its solutions on the basis of a…