Related papers: Super Multiset RSK and a Mixed Multiset Partition …
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
The Berele row-insertion is a symplectic analogue of the Schensted row-insertion. In the present paper, we provide it with a representation theoretical interpretation via the quantum symmetric pairs of type $A\mathrm{II}$. As applications,…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…
We introduce the multiset partition algebra $\mathcal{MP}_k(\xi)$ over $F[\xi]$, where $F$ is a field of characteristic $0$ and $k$ is a positive integer. When $\xi$ is specialized to a positive integer $n$, we establish the Schur-Weyl…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…
We study global subalgebras of superconformal algebras in two dimensions and their unitary representations. Global superconformal multiplets are decomposed into conformal multiplets using Racah-Speiser algorithm, revealing many essential…
We review some algebraic and combinatorial structures that underlie models in the KPZ universality class.Emphasis is placed on the Robinson-Schensted-Knuth correspondence and its geometric lifting due to A.N.Kirillov. We present how these…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…
We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
The symmetric group $\mathsf{S}_n$ and the partition algebra $\mathsf{P}_k(n)$ centralize one another in their actions on the $k$-fold tensor power $\mathsf{M}_n^{\otimes k}$ of the $n$-dimensional permutation module $\mathsf{M}_n$ of…
In this paper we develop a symbolic algorithm to calculate multivariate power series expansions of univariate polynomials over general base rings. We use this to give a complete power series algorithm to calculate the dual intersection…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…