Related papers: Computationally easy, spectrally good multipliers …

A simple construction of pseudorandom generator is appear.This pseudorandom generator is always passed by NIST statistical test.This paper reports a pseudorandom number generator which has good property is able to construct using only…

In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…

Approximate computing is a promising approach to reduce the power, delay, and area in hardware design for many error-resilient applications such as machine learning (ML) and digital signal processing (DSP) systems, in which multipliers…

We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.

In this paper, we count the number of matrices whose rows generate different $\mathbb{Z}_2\mathbb{Z}_8$ additive codes. This is a natural generalization of the well known Gaussian numbers that count the number of matrices whose rows…

We introduce a notion of an algebra of generalized pseudo-differential operators and prove that a spectral triple is regular if and only if it admits an algebra of generalized pseudo-differential operators. We also provide a self-contained…

In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the…

We present a complete set of Fortran 90 modules that can be used to write very compact, efficient, and high level QCD programs. The modules define fields (gauge, fermi, generators, complex, and real fields) as abstract data types, together…

Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…

A new symbolic algorithm to compute sums of squares multipliers (certificates) to witness the membership of non-negative univariate polynomials in a saturated univariate quadratic module is presented. Certificates are first computed in…

In this paper, we present a multiplier based on a sequence of approximated accumulations. According to a given splitting point of the carry chains, the technique herein introduced allows varying the quality of the accumulations and,…

The pseudo-random number generators (PRNGs), sampling algorithms, and algorithms for generating random integers in some common statistical packages and programming languages are unnecessarily inaccurate, by an amount that may matter for…

Let $L$ be a non-negative self adjoint operator acting on $L^2(X)$ where $X$ is a space of homogeneous type. Assume that $L$ generates a holomorphic semigroup $e^{-tL}$ whose kernels $p_t(x,y)$ satisfy generalized $m$-th order Gaussian…

$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…

In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that…

Probabilistic generative models of graphs are important tools that enable representation and sampling. Many recent works have created probabilistic models of graphs that are capable of representing not only entity interactions but also…

Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX…

Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide "true" random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate…