Related papers: Card shuffling and the decomposition of tensor pro…
Let V be a symplectic vector space and let $\mu$ be the oscillator representation of Sp(V). It is natural to ask how the tensor power representation $\mu^{\otimes t}$ decomposes. If V is a real vector space, then Howe-Kashiwara-Vergne (HKV)…
The problem of partitioning a large and sparse tensor is considered, where the tensor consists of a sequence of adjacency matrices. Theory is developed that is a generalization of spectral graph partitioning. A best rank-$(2,2,\lambda)$…
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…
We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about…
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
Let $\mathbb{F}$ be an algebraically closed field and $G$ be an almost quasi-simple group. An important problem in representation theory is to classify the subgroups $H<G$ and $\mathbb{F} G$-modules $L$ such that the restriction…
Tensor decompositions are promising tools for big data analytics as they bring multiple modes and aspects of data to a unified framework, which allows us to discover complex internal structures and correlations of data. Unfortunately most…
The symmetry-constrained response tensors on transport, optical, and electromagnetic effects are of central importance in condensed matter physics because they can guide experimental detections and verify theoretical calculations. These…
The random transposition shuffle on repeated cards induces a Markov chain on the quotient space of arrangements with multiplicities, and is equivalent to the many-urn mean-field Bernoulli-Laplace model introduced by Scarabotti. Writing…
Second-order Recurrent Neural Networks (2RNNs) extend RNNs by leveraging second-order interactions for sequence modelling. These models are provably more expressive than their first-order counterparts and have connections to well-studied…
Twisted tensor powers of quasitriangular Hopf algebras with diagonal sub-Hopf-algebras (self-diagonal tensor powers) are introduced together with their duals and their mutual *-structures as generalizations of the Drinfel'd double as given…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing…
Birkhoff's theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
We introduce an efficient algorithm for reducing bond dimensions in an arbitrary tensor network without changing its geometry. The method is based on a novel, quantitative understanding of local correlations in a network. Together with a…
In this paper, we study 2-representations of 2-quantum groups (in the sense of Rouquier and Khovanov-Lauda) categorifying tensor products of irreducible representations. Our aim is to construct knot homologies categorifying…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…