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

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

We study matrix multiplication in the low-bandwidth model: There are $n$ computers, and we need to compute the product of two $n \times n$ matrices. Initially computer $i$ knows row $i$ of each input matrix. In one communication round each…

We study representations of the double affine Lie algebra associated to a simple Lie algebra. We construct a family of indecomposable integrable representations and identify their irreducible quotients. We also give a condition for the…

The simple product formulae for derivatives of scalar functions raised to different powers are generalized for functions which take values in the set of symmetric positive definite matrices. These formulae are fundamental in derivation of…

Building on the work [18], where some standard basis for the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices and their associated double coset representatives, we investigate the matrix…

We construct classes of von Neumann algebra modules by considering ``column sums" of noncommutative L^p spaces. Our abstract characterization is based on an L^{p/2}-valued inner product, thereby generalizing Hilbert C*-modules and…

We show that the moduli problem of deformations of nilpotent displays by quasi-isogenies is representable, without using $p$-divisible groups. The main ingredients are Artin's criterion and the theory of truncated displays. This gives in…

Using the concept of mixable shuffles, we formulate explicitly the quantum quasi-shuffle product, as well as the subalgebra generated by primitive elements of the quantum quasi-shuffle bialgebra. We construct a braided coalgebra structure…

Let $V(1)$ be the natural representation of $U(\mathfrak{sl}_2).$ The multiplicities of $V(k)$ in $V(1)^{\otimes N}$ have multiple interpretations in combinatorics. In this paper, we investigate one such combinatorial interpretation of…

Matrix multiplication consumes a large fraction of the time taken in many machine-learning algorithms. Thus, accelerator chips that perform matrix multiplication faster than conventional processors or even GPU's are of increasing interest.…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

We provide a recursive method for constructing product formula approximations to exponentials of commutators, giving the first approximations that are accurate to arbitrarily high order. Using these formulas, we show how to approximate…

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

Matrix Product Operators (MPOs) are tensor networks representing operators acting on 1D systems. They model a wide variety of situations, including communication channels with memory effects, quantum cellular automata, mixed states in 1D…

In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…

We state and prove product formulae for several generating functions for sequences $(a_n)_{n\ge0}$ that are defined by the property that $Pa_n+b^2$ is a square, where $P$ and $b$ are given integers. In particular, we prove corresponding…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

It is shown that the exponential of a complex power series up to order n can be implemented via (23/12+o(1))M(n) binary arithmetic operations over complex field, where M(n) stands for the (smoothed) complexity of multiplication of…