An arithmetic version of the crosscorrelation of two sequences is defined, generalizing Mandelbaum’s arithmetic autocorrelations. Large families of sequences are constructed with ideal (vanishing) arithmetic cross-correlations. These sequences are decimations of the 2-adic expansions of rational numbers p/q such that 2 is a primitive root modulo q.

Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f(X) ∈ Z[X] from approximate values of the residues of f(t) modulo a prime p at polynomially many points t taken from a short interval.

To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, often prevent the modulo scheduler from achieving ideal loop initiation intervals. As a result, replicated functiona...

We provide some variations on the Greene-Krammer's identity which involve q-Catalan numbers. Our method reveals a curious analogy between these new identities and some congruences modulo a prime.

We prove the existence of a subset, with positive natural density, squarefree integers n>0 such that 4–rank ideal class group ℚ(-n,n) is ω 3 (n)-1, where (n) number prime divisors n are modulo 4. Recall for groups associated to ℚ(n) or ℚ(-n) an analogous subset does not exist.

An arithmetic version of the crosscorrelation of two sequences is defined, generalizing Mandelbaum’s arithmetic autocorrelations. Large families of sequences are constructed with ideal (vanishing) arithmetic crosscorrelations. These sequences are decimations of the 2adic expansions of rational numbers p=q such that 2 is a primitive root modulo q.

We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene algebra. We prove completeness of this model with respect to continuous probabilistic Kleene algebras. Hence an identity is valid in continuous probabilistic Kleene algebras if and only if the associated automata are simulation equivalent.

We show that a ring $R$ has stable range one if and only every left unit lifts modulo principal ideal. also quasi-morphic it is uniquely generated. Thus we answer in the affirmative two questions raised by W. K. Nicholson.

Let k be an algebraic number eld with maximal order o k and let m 0 be an ideal of o k. We develop an algorithm for the computation of the multiplicative group (o k =m 0) of the residue class ring o k =m 0. It is applied to the computation of the ray class group Cl m k modulo m = m 0 m 1 , where m 1 denotes a formal product of real innnite places, and also to the computation of the conductor of...