Related papers: Kronecker products and the RSK correspondence
Super RSK correspondence is a bijective correspondence between superbiwords and pairs of semistandard supertableaux. Such a bijection was given by Bonetti, Senato and Venezia, via an insertion algorithm closely related to Schensted…
Separable, or Kronecker product, dictionaries provide natural decompositions for 2D signals, such as images. In this paper, we describe a highly parallelizable algorithm that learns such dictionaries which reaches sparse representations…
We present a computational approach to studying the structure of the representation ring of the symmetric group in dimension six. The Kronecker coefficients and all power formulae of irreducible representations of $S_6$ are computed using…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line…
We derive relations between theoretical properties of restricted Boltzmann machines (RBMs), popular machine learning models which form the building blocks of deep learning models, and several natural notions from discrete mathematics and…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…
We address the local spectral behavior of the random matrix $\Pi_1 U^{\otimes k} \Pi_2 U^{\otimes k *} \Pi_1$, where $U$ is a Haar distributed unitary matrix of size $n\times n$, the factor $k$ is at most $c_0\log n$ for a small constant…
Let $\det_2(A)$ be the block-wise determinant (partial determinant). We consider the condition for completing the determinant $\det(\det_2(A)) = \det(A),$ and characterize the case for an arbitrary Kronecker product $A$ of matrices over an…
It is well-known that to every binary relation on a non-void set I there can be assigned its incidence matrix, also in the case when I is infinite. We show that a certain kind of "multiplication" of such incidence matrices corresponds to…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
The complete characterization of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one is known, and it is stated in terms of very involved conditions. This paper is devoted to, loosing accuracy, better…
It is shown in the paper that each Hecke symmetry R with the R-symmetric algebra freely generated by 3 commuting elements is determined by a bivector and a symmetric bilinear form on a 3-dimensional vector space. A general formula for such…
We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…
In this paper we discuss the mathematical background and the computational aspects which underly the implementation of a collection of Julia functions in the MatrixPencils package for the determination of structural properties of polynomial…
We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…