Related papers: Super Multiset RSK and a Mixed Multiset Partition …
We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…
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…
We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…
We explore an application of the Robinson-Schensted-Knuth (RSK) algorithm in the context of the quantum product of multi-symmetric functions. After reviewing the combinatorial foundations of quantum symmetric functions, we establish…
There is a classical connection between the representation theory of the symmetric group and the general linear group called Schur-Weyl duality. Variations on this principle yield analogous connections between the symmetric group and other…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
We introduce the multiset partition algebra, ${\rm M\!P}_{r,k}(x)$, that has bases elements indexed by multiset partitions, where $x$ is an indeterminate and $r$ and $k$ are non-negative integers. This algebra can be realized as a diagram…
The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. This correspondence satisfies the symmetry property, that is,…
We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…
The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known…
We show that the reformulation of the geometric Robinson-Schensted-Knuth (gRSK) correspondence via local moves, introduced in \cite{OSZ14} can be extended to cases where the input matrix is replaced by more general polygonal,…
We construct new "standard modules" for the representations of general linear groups over a local non-archimedean field. The construction uses a modified Robinson-Schensted-Knuth correspondence for Zelevinsky's multisegments. Typically, the…
A short review of Algebraic Geometry tools for the decomposition of tensors and polynomials is given from the point of view of applications to quantum and atomic physics. Examples of application to assemblies of indistinguishable two-level…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
In this paper we extend the Robinson-Schensted-Knuth (RSK) superinsertion algorithm to hook-multipartitions and derive the super Frobenius formula for the characters of cyclotomic Hecke algebras (Linear and Multilinear Algebra, DOI:…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the…
For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…