Related papers: Corrigendum to New Generalized Cyclotomic Binary S…
Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…
We extend Mullin's prime-generating procedures to produce sequences of primes lying in given residue classes. In particular we study the sequences generated by cyclotomic polynomials $\Phi_m(cx)$ for suitable $c\in\mathbb{Z}$. Under the…
In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in odd prime fields by means of a transformation introduced by Cohen in 1992. We make no assumptions on the coefficients of the first…
The Piatetski-Shapiro sequences are of the form ${\mathcal{N}}^{(c)} := (\lfloor n^c \rfloor)_{n=1}^\infty$ with $c > 1, c \not\in \mathbb{N}$. In this paper, we study the distribution of pairs $(p, p^{\#})$ of consecutive primes such that…
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…
In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
By using the sieve method of combinatorics, we study $k$-error linear complexity distribution of $2^n$-periodic binary sequences based on Games-Chan algorithm. For $k=4,5$, the complete counting functions on the $k$-error linear complexity…
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, $k$-error linear complexity, the minimum error and the $k$-error linear complexity…
Presentations for the holomorphs of abelian groups of the form $C_{p^n} \times 1^{m}$ for $p$=2 or an odd prime are given. These presentations extend the results given in Burnside's well-known text on finite groups on the holomorphs for the…
We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on…
In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…
Complex-linearization of a class of systems of second order ordinary differential equations (ODEs) has already been studied with complex symmetry analysis. Linearization of this class has been achieved earlier by complex method, however,…
In this paper, a family of six-weight cyclic codes over GF(p) whose duals have two zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.
We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…
The arithmetic crosscorrelation of binary $m$-sequences with coprime periods $2^{n_1}-1$ and $2^{n_2}-1$\ ($\gcd(n_1,n_2)=1$) is determined. The result shows that the absolute value of arithmetic crosscorrelation of such binary…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.
Two families of symplectic methods specially designed for second-order time-dependent linear systems are presented. Both are obtained from the Magnus expansion of the corresponding first-order equation, but otherwise they differ in…
We give a simple condition for a linear recurrence (mod 2^w) of degree r to have the maximal possible period 2^(w-1).(2^r-1). It follows that the period is maximal in the cases of interest for pseudo-random number generation, i.e. for…