English
Related papers

Related papers: A bijection between $K$-Kohnert diagrams and rever…

200 papers

Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…

Combinatorics · Mathematics 2023-11-16 Alejandro H. Morales , Greta Panova , GaYee Park

A prism tableau is a set of reverse semistandard tableaux, each positioned within an ambient grid. Prism tableaux were introduced to provide a formula for the Schubert polynomials of A. Lascoux and M.P. Sch\"utzenberger. This formula…

Combinatorics · Mathematics 2017-08-25 Anna Weigandt

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

Combinatorics · Mathematics 2024-10-23 Avichai Cohen , Shaul Zemel

An element of a Weyl group of classical type is skew if it is the left factor in a reduced factorization of a Grassmannian element. The skew Grothendieck polynomials are those which are indexed by skew elements of the Weyl group. We define…

Combinatorics · Mathematics 2024-01-30 Harry Tamvakis

Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…

Probability · Mathematics 2026-03-31 Anton Nazarov , Anton Selemenchuk

Let $\lambda=(\lambda_1 \geqslant \ldots \geqslant \lambda_k > 0)$. For any $c$ Coxeter element of $\mathfrak{S}_{\lambda_1+k-1}$, we construct a bijection from fillings of $\lambda$ to reverse plane partitions. We recover two previous…

Combinatorics · Mathematics 2024-12-18 Benjamin Dequêne

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

Lanczos methods for solving $\textit{A}\textbf{x}=\textbf{b}$ consist in constructing a sequence of vectors $(\textbf{x}_k), k=1,...$ such that $\textbf{r}_{k}=\textbf{b}-\textit{A}\textbf{x}_{k}=\textit{P}_{k}(\textit{A})\textbf{r}_{0}$,,…

Numerical Analysis · Mathematics 2014-05-08 Muhammad Farooq , Abdellah Salhi

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

Combinatorics · Mathematics 2021-04-29 Florian Aigner , Gabriel Frieden

The discrete-time Toda equation arises as a universal equation for the relevant Hankel determinants associated with one-variable orthogonal polynomials through the mechanism of adjacency, which amounts to the inclusion of shifted weight…

Exactly Solvable and Integrable Systems · Physics 2015-05-18 Paul E. Spicer , Frank W. Nijhoff , Peter H. van der Kamp

In [Matveev-Petrov 2016](arXiv:1504.00666) a $q$-deformed Robinson-Schensted-Knuth algorithm ($q$RSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and…

Combinatorics · Mathematics 2017-09-18 Yuchen Pei

Several families of polynomials of combinatorial and representation theoretic interest (notably the Schur polynomials $s_\lambda$, Demazure characters $\mathfrak{D}_a$, and Demazure atoms $\mathfrak{A}_a$) can be defined in terms of divided…

Combinatorics · Mathematics 2025-08-19 Laura Pierson

We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…

Algebraic Geometry · Mathematics 2019-05-06 Elzbieta Adamus , Teresa Crespo , Zbigniew Hajto

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Combinatorics · Mathematics 2013-01-25 Olcay Coşkun , Müge Taşkın

We use Kashiwara-Nakashima's combinatorics of crystal graphs associated to the roots sytems $B_{n}$ and $D_{n}$ to extend the results of \QCITE{cite}{}{lec3} and \QCITE{cite}{}{Mor} by showing that Morris type recurrence formulas also exist…

Combinatorics · Mathematics 2007-05-23 Cedric Lecouvey

We review the X = K conjecture and important ingredients for the proof. We also attach notes on the rank estimate for the X = K theorem to hold and on the strange relation that was found to be valid without the assumption that the rank is…

Quantum Algebra · Mathematics 2011-05-10 Cedric Lecouvey , Masato Okado , Mark Shimozono

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…

Combinatorics · Mathematics 2024-11-05 Alexander Esterov , Arina Voorhaar

By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a…

High Energy Physics - Theory · Physics 2018-01-09 A. Mironov , A. Morozov

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

Algebraic Geometry · Mathematics 2024-05-24 Jiajun Hu , Jian Xiao

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

Combinatorics · Mathematics 2011-10-19 Hugh Thomas , Alexander Yong