English
Related papers

Related papers: Super RSK-algorithms and super plactic monoid

200 papers

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-11-02 Florian Aigner , Gabriel Frieden

We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…

High Energy Physics - Theory · Physics 2024-08-09 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

We give a new type of Schur-Weyl duality for the representations of a family of quantum subgroups and their centralizer algebra. We define and classify singly-generated, Yang-Baxter relation planar algebras. We present the skein theoretic…

Operator Algebras · Mathematics 2016-04-05 Zhengwei Liu

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…

Combinatorics · Mathematics 2020-05-08 Laura Colmenarejo , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

String theory, specifically type-II superstring theory, can be formulated in any ten-dimensional signature. To facilitate the study of supergravity and superstring theories in this setting, we present a uniform construction of supersymmetry…

High Energy Physics - Theory · Physics 2021-11-10 Louis Gall , Thomas Mohaupt

We introduce a new basis for the polynomial ring which lifts the complete homogeneous symmetric polynomials while retaining representation theoretic significance. Using a specialized RSK algorithm we give an explicit nonnegative expansion…

Combinatorics · Mathematics 2023-05-08 Henry Ehrhard

The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in ${\bf N}$, and standard Young tableaux by semistandard ones. For $r>0$, the Robinson-Schensted…

Combinatorics · Mathematics 2007-05-23 Marc A. A. Van Leeuwen

The supercharacter theory of algebra groups gave us a representation theoretic realization of the Hopf algebra of symmetric functions in noncommuting variables. The underlying representation theoretic framework comes equipped with two…

Combinatorics · Mathematics 2018-10-04 Farid Aliniaeifard , Nathaniel Thiem

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

Combinatorics · Mathematics 2011-04-19 Yasuhide Numata

We develop classical globally supersymmetric theories. As much as possible, we treat various dimensions and various amounts of supersymmetry in a uniform manner. We discuss theories both in components and in superspace. Throughout we…

High Energy Physics - Theory · Physics 2007-05-23 Pierre Deligne , Daniel S. Freed

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

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Logic · Mathematics 2024-07-24 M. Malliaris , S. Shelah

We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock space, we prove a Cauchy identity for…

Combinatorics · Mathematics 2022-01-04 Michael J. Curran , Claire Frechette , Calvin Yost-Wolff , Sylvester W. Zhang , Valerie Zhang

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

Logic · Mathematics 2022-03-14 Deacon Linkhorn

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Group Theory · Mathematics 2026-02-13 Mehmet Yeşil

We formulate and classify super Satake diagrams under a mild assumption, building on arbitrary Dynkin diagrams for finite-dimensional basic Lie superalgebras. We develop a theory of quantum supersymmetric pairs associated to the super…

Quantum Algebra · Mathematics 2025-08-25 Yaolong Shen , Weiqiang Wang

Asymptotic representation theory of general linear groups GL(n,q) over a finite field leads to studying probability measures \rho on the group U of all infinite uni-uppertriangular matrices over F_q, with the condition that \rho is…

Probability · Mathematics 2015-03-13 Alexey Bufetov , Leonid Petrov

The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…

Optimization and Control · Mathematics 2021-12-08 Helmut Gfrerer , Jiri V. Outrata

We prove that every automorphism of the restricted root system of a real semisimple Lie algebra -- when defined properly -- can be lifted to an automorphism of that Lie algebra. In particular, this can be applied to automorphisms of the…

Differential Geometry · Mathematics 2022-08-22 Ivan Solonenko

We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…

Computational Complexity · Computer Science 2024-10-22 Dmitriy Zhuk