Related papers: Computationally easy, spectrally good multipliers …
A new class of structured codes called Quasi Group Codes (QGC) is introduced. A QGC is a subset of a group code. In contrast with group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen such that the…
We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…
Approximate computing is a nascent energy-efficient computing paradigm suitable for error-tolerant applications. However, the value of approximation error depends on the applied inputs where individual output error may reach intolerable…
Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both methods demonstrated in…
The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…
We construct explicit pseudorandom generators that fool $n$-variate polynomials of degree at most $d$ over a finite field $\mathbb{F}_q$. The seed length of our generators is $O(d \log n + \log q)$, over fields of size exponential in $d$…
Let G be GL_N or SL_N as reductive linear algebraic group over a field k of positive characteristic p. We prove several results that were previously established only when N < 6 or p > 2^N. Let G act rationally on a finitely generated…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…
Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits.…
In this paper, we explore polynomial accelerators that are well-suited for parallel computations, specifically as smoothers in Algebraic MultiGrid (AMG) preconditioners. These accelerators address a minimax problem, initially formulated in…
We extend previously known two-dimensional multiplication tiling systems that simulate multiplication by two natural numbers $p$ and $q$ in base $pq$ to higher dimensional multiplication tessellation systems. We develop the theory of these…
An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials $L^{(\alpha)}_n(z)$ are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic…
The existence of a strong spectral gap for lattices in semi-simple Lie groups is crucial in many applications. In particular, for arithmetic lattices it is useful to have bounds for the strong spectral gap that are uniform in the family of…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
In this work, we add an additional condition to strong pseudo prime test to base 2. Then, we provide theoretical and heuristics evidences showing that the resulting algorithm catches all composite numbers. Our method is based on the…
Finding a good way to model probability densities is key to probabilistic inference. An ideal model should be able to concisely approximate any probability while being also compatible with two main operations: multiplications of two models…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
The authors prove that the probability of choosing a nonlinear filter of m-sequences with optimal properties, that is, maximum period and maximum linear complexity, tends assymptotically to 1 as the linear feedback shift register length…
We study certain polynomial trace identities in the group $SL(2,\IC)$ and their application in the theory of discrete groups. We obtain canonical representations for two generator groups in \S 4 and then in \S 5 we give a new proof for…