Related papers: A Note on the Group-theoretic Approach to Fast Mat…
Tensor networks, which are originally developed for characterizing complex quantum many-body systems, have recently emerged as a powerful framework for capturing high-dimensional probability distributions with strong physical…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
We establish several new topological generation results for the quantum permutation groups $S^+_N$ and the quantum reflection groups $H^{s+}_N$. We use these results to show that these quantum groups admit sufficiently many "matrix models".…
We prove some unique factorization results for tensor products of free quantum group factors. They are type III analogues of factorization results for direct products of bi-exact groups established by Ozawa and Popa. In the proof, we first…
Let X and Y be two nxn Hermitian matrices. In the article "Proof of a conjectured exponential formula" (Linear and Multilinear Algebra (19) 1986, 187-197) R. C. Thompson proved that there exist two nxn unitary matrices U and V such that $$…
We introduce an infinite family of lower triangular matrices $\Gamma^{(s)}$, where $\gamma_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of…
There are two very natural products of compact matrix quantum groups: the tensor product $G\times H$ and the free product $G*H$. We define a number of further products interpolating these two. We focus more in detail to the case where $G$…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…
In $1801$, Gauss found an explicit description, in the language of binary quadratic forms, for the $2$-torsion of the narrow class group and dual narrow class group of a quadratic number field. This is now known as Gauss's genus theory. In…
We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…
Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…
We establish a connection between generalised commuting schemes $C_g(U_n)$ of higher genus $g$, which are associated with a group scheme $U_n$ consisting of upper triangular unipotent matrices, and the representation homology…
We study the topos of sets equipped with an action of the monoid of regular $2 \times 2$ matrices over the integers. In particular, we show that the topos-theoretic points are given by the double quotient $\left. GL_2(\hat{\mathbb{Z}})…
Transformation coefficients between {\it standard} bases for irreducible representations of the symmetric group $S_n$ and {\it split} bases adapted to the $S_{n_1} \times S_{n_2} \subset S_n$ subgroup ($n_1 +n_2 = n$) are considered. We…
We use the superspace method of hep-th/0211017 to prove the matrix model conjecture for N=1 USp(N) and SO(N) gauge theories in four dimensions. We derive the prescription to relate the matrix model to the field theory computations. We…
Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…
We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC '81) it was shown that to compute a product of dense $U…