相关论文: Near Quadratic Matrix Multiplication Modulo Compos…

We consider a construction of the fundamental spin representations of the simple Lie algebras $\mathfrak{so}(n)$ in terms of binary arithmetic of fixed width integers. This gives the spin matrices as a Lie subalgebra of a…

The Strassen algorithm and Winograd's variant accelerate matrix multiplication by using fewer arithmetic operations than standard matrix multiplication. Although many papers have been published to accelerate single- as well as…

We study moduli spaces of (semi-)stable representations of one-point extensions of quivers by rigid representations. This class of moduli spaces unifies Grassmannians of subrepresentations of rigid representations and moduli spaces of…

Representations of the symmetry group D_n of the n-sided regular polygon have generic multiplication rules if n is prime. Using D_n with n=5 or greater, a particular well-known form of the Majorana neutrino mass matrix is derived.

Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of…

In this paper we consider certain quaternary quadratic forms and octonary quadratic forms and by using the theory of modular forms, we find formulae for the number of representations of a positive integer by these quadratic forms.

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…

In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…

We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…

A counterpart of the modular double for quantum superalgebra $\cU_q(\osp(1|2))$ is constructed by means of supersymmetric quantum mechanics. We also construct the $R$-matrix operator acting in the corresponding representations, which is…

We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.

We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two $n \cross n$ matrices over finite fields. In particular we obtain the following results: 1. We show that the number of…

In the conventional formulation of N=1 supersymmetry, a vector multiplet is supposed to be in the adjoint representation of a given gauge group. We present a new formulation with a vector multiplet in the non-adjoint representation of SO(N)…

We present an efficient proof scheme for any instance of left-to-right modular exponentiation, used in many computational tests for primality. Specifically, we show that for any $(a,n,r,m)$ the correctness of a computation $a^n\equiv r\pmod…

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the existence of a basis in which the signal class under…

We formulate N-fold supersymmetry in quantum mechanical matrix models. As an example, we construct general two-by-two Hermitian matrix 2-fold supersymmetric quantum mechanical systems. We find that there are two inequivalent such systems,…

A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…

In this note, we extend to a composite modulo a recent result of Chan (2016) dealing with mean values of the product of an integer and its multiplicative inverse modulo a prime number.