Related papers: Defying Dimensions Mod 6

We show how one can use non-prime-power, composite moduli for computing representations of the product of two $n\times n$ matrices using only $n^{2+o(1)}$ multiplications.

We show how one can encode $n$ bits with $n^{o(1)}$ ``wave-bits'' using still hypothetical filter-machines (here $o(1)$ denotes a positive quantity which goes to 0 as $n$ goes to infity). Our present result - in a completely different…

We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…

We construct a class of negative spin irreducible representations of the su(2) Lie algebra. These representations are infinite-dimensional and have an indefinite inner product. We analyze the decomposition of arbitrary products of positive…

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…

We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly…

We develop a combinatorial approach to the quantum permutation algebras, as Hopf images of representations of type $\pi:A_s(n)\to B(H)$. We discuss several general problems, including the commutativity and cocommutativity ones, the…

We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications…

We analyze the decomposition of tensor products between infinite dimensional (unitary) and finite-dimensional (non-unitary) representations of SL(2,R). Using classical results on indefinite inner product spaces, we derive explicit…

We study the decomposition as an $\textrm{SO}(3)$-module of the multiplicity space corresponding to the branching from $\textrm{SO}(n+3)$ to $\textrm{SO}(n)$. Here, $\textrm{SO}(n)$ (resp.\ $\textrm{SO}(3)$) is considered embedded in…

Polar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in n dimensions, the variables x_0,...,x_{n-1} being real numbers. The polar n-complex number can be represented, in an even number of…

We explore various techniques to compress a permutation $\pi$ over n integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi$(i) and the application of its inverse $\pi^{-1}(i)$ in small time. Our…

We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…

Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

We study the problem of determining the Boolean product of two n\times n Boolean matrices in an unconventional computational model allowing for mechanical operations. We show that O(n^2) operations are sufficient to compute the product in…

We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…

Let $V_n=<e_1,...,e_{n+1}>$ be a vector products n-Lie algebra with n-Lie commutator $[e_1,...,\hat{e_i},...,e_{n+1}]=(-1)^ie_i$ over the field of complex numbers. Any finite-dimensional n-Lie $V_n$-module is completely reducible. Any…