相关论文: Defying Dimensions Mod 6
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
We consider the problem of preprocessing an $n\times n$ matrix $\mathbf{M}$, and supporting queries that, for any vector $v$, returns the matrix-vector product $\mathbf{M} v$. This problem has been extensively studied in both theory and…
We give a one dimensional octonionic representation of the different Clifford algebra Cliff(5,5)\sim Cliff(9,1), Cliff(6,6)\sim Cliff(10,2) and lastly Cliff(7,6)\sim Cliff(10,3) which can be given by (8x8) real matrices taking into account…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
We construct a weak dilation of a not necessarily unital CP-semigroup to an E-semigroup acting on the adjointable operators of a Hilbert module with a unit vector. We construct the dilation in such a way that the dilating E-semigroup has a…
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
We consider typical finite dimensional complex irreducible representations of a basic classical simple Lie superalgebra, and give a sufficient condition on when unique factorization of finite tensor products of such representations hold. We…
We show that under natural and quite general assumptions, a large part of a matrix for a bounded linear operator on a Hilbert space can be preassigned. The result is obtained in a more general setting of operator tuples leading to…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
We establish relations between representation dimensions of two algebras connected by a Frobenius bimodule or extension. Consequently, upper bounds and equality formulas for representation dimensions of group algebras, symmetric separably…
We introduce the spinor representations for osp(m|2n). These generalize the spinors for so(m) and the symplectic spinors for sp(2n) and correspond to representations of the supergroup with supergroup pair (Spin(m) x Mp(2n),osp(m|2n)). We…
Planar 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 an even number n of dimensions, the variables x_0,...,x_{n-1} being real numbers. The planar n-complex numbers can be described by the…
We derive an explicit expression for an associative *-product on fuzzy complex projective spaces. This generalises previous results for the fuzzy 2-sphere and gives a discrete non-commutative algebra of functions on fuzzy complex projective…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
For minimization problems without 2nd derivative information, methods that estimate Hessian matrices can be very effective. However, conventional techniques generate dense matrices that are prohibitive for large problems. Limited-memory…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq…
Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…