Related papers: Card shuffling and the decomposition of tensor pro…

Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…

We give a decomposition formula for tensor powers of the defining representation of $S_n$ and apply it to bound the mixing time of a Markov chain on $S_n$.

We introduce the concept of shape partition of a tensor and formulate a general tensor eigenvalue problem that includes all previously studied eigenvalue problems as special cases. We formulate irreducibility and symmetry properties of a…

Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…

We show that the Tensor Renormalization Group (TRG) method can be applied to O(N) spin models, principal chiral models and pure gauge theories (Z2, U(1) and SU(2)) on (hyper) cubic lattices. We explain that contrarily to some common belief,…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

Randomized numerical linear algebra is proved to bridge theoretical advancements to offer scalable solutions for approximating tensor decomposition. This paper introduces fast randomized algorithms for solving the fixed Tucker-rank problem…

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…

Let $H$ be a connected reductive subgroup of a complex connected reductive group $G$. Fix maximal tori and Borel subgroups of $H$ and $G$. Consider the pairs $(V,V')$ of irreducible representations of $H$ and $G$ such that $V$ is a…

The tensor renormalization group method is a promising approach to lattice field theories, which is free from the sign problem unlike standard Monte Carlo methods. One of the remaining issues is the application to gauge theories, which is…

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Let $p\geq 5$ be a prime number. In this paper, we construct Galois representations associated with modular forms for which the dimension of the $p$-torsion in the Bloch-Kato Selmer group can be made arbitrarily large. Our result extends…

In the two parts of this paper we solve a problem of De Rham, proving that Reidemeister torsion invariants determine topological equivalence of linear G-representations, for G a finite cyclic group. Methods in controlled K-theory and…

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

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…

Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with…

Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure…

Using the example of configurations generated with the worm algorithm for the two-dimensional Ising model, we propose renormalization group (RG) transformations, inspired by the tensor RG, that can be applied to sets of images. We relate…