Combined random number generator via the generalized Chinese remainder theorem

The combined random number (RN) generator has been considered by many scholars as a good RN generator. One promising type of combined RN generator, recommended by L'Ecuyer (Oper. Res. 44 (1996) 816; 47 (1999) 159), is the combined multiple recursive generator (MRG). This paper analyzes the combined MRG via the Chinese remainder theorem. A new combined generator based on the generalized Chinese remainder theorem and on the Ore algorithm (Amer. Math. Monthly 59 (1952) 365) is presented. The proposed combined generator improves the combined MRG in terms of both the suitability for various types of RN generators and the restriction on the moduli of the individual generators. Therefore, the proposed combined generator is an ideal RN generator and is most recommended.     

Generalization of the Chinese remainder theorem

Sufficient conditions for a system Ax = r to have an integral solution in the case of a basic matrix A in terms of submatrices and permanents of A are derived. Matrix A in the Chinese remainder theorem is a particular case of a basic matrix. The derivation can be extended to the case where the propositional formula that describes the sign scheme of A is a minimal unsatisfiable CNF.     

An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem

Regarding quasi-cyclic codes as certain polynomial matrices, we show that all reversible quasi-cyclic codes are decomposed into reversible linear codes of shorter lengths corresponding to the coprime divisors of the polynomials with the form of one minus x to the power of m. This decomposition brings us an efficient method to construct reversible quasi-cyclic codes. We also investigate the reversibility and the self-duality of the linear codes corresponding to the coprime divisors of the polynomials. Specializing to the cases where the number of cyclic sections is not more than two, we give necessary and sufficient conditions for the divisors of the polynomials for which the self-dual codes are reversible and the reversible codes of half-length-dimension are self-dual. Our theorems are utilized to search reversible self-dual quasi-cyclic codes with two cyclic sections over binary and quaternary fields of lengths up to seventy and thirty-six, respectively, together with the maximums of their minimum weights.     

Symmetries of directed graphs and the Chinese remainder theorem

It is shown that a permutation group on a finite set is the automorphism group of some directed graph if and only if a generalized Chinese remainder theorem holds for the family of stabilizers. This result can be applied to examine some special permutation groups, including the general linear groups of finite vector spaces.     

A generalization of the remainder theorem and factor theorem

We propose a generalization of the classical Remainder Theorem for polynomials over commutative coefficient rings that allows calculating the remainder without using the long division method. As a consequence we obtain an extension of the classical Factor Theorem that provides a general divisibility criterion for polynomials. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities for college and high school students.     

Chinese remainder codes

Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n for the information bit, embed R/J _i into R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n, and assign the cosets of R/J _i as the subring of R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n and the cosets of R/J _i in R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n as check lines. Many code classes exist in the Chinese remainder codes that have high code rates. Chinese remainder codes are the essential generalization of Sun Zi codes. Selected from Journal of Mathematical Research and Exposition, 2004, 24(2): 347–352     

On estimation of the remainder in the central limit theorem

A nonuniform estimate of the remainder in the central limit theorem is obtained for a sequence of independent, identically distributed random variables. This estimate is a generalization of an earlier result of L. V. Osipov and the author. Bibliography: 5 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 341, 2007, pp. 142–146.     

A nonuniform estimate of the remainder in the central limit theorem

In this note, a refinement and generalization of one result of V. V. Petrov are obtained. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 351, 2007, pp. 238–241.