Dynamical Properties of Additive Cellular Automata over Finite Abelian Groups

Some dynamical properties were discussed for additive cellular automata(CA)over finite abelian groups.These properties include surjection,ergodicity,sensitivity to initial conditions and positive expansivity.Some necessary and sufficient conditions of determining ergodicity and sensitivity of the above additive CA were presented,respectively.A necessary condition for the positive expansivity of the above additive CA was given.The positive expansivity was proved to be preserved under the shift mappings for the general CA.The discussion was mainly based on the structure theorem of the finite abelian groups and the matrix associated with the global rule of the additive CA over the finite abelian p-groups.

CALCULATION OF THE GIBBS DERIVATIVES ON FINITE ABELIAN GROUPS THROUGH THE DECISION DIAGRAMS

Paper considers the calculation of the values of Gibbs derivatives on finite Abelian groups. The calculation procedure is based upon the decision diagram representation of functions defined on finite Abelian groups. Approach permits processing of large functions.

Finite Abelian Groups of K3 Surfaces with Smooth Quotient

The quotient space of a K3 surface by a finite group is an Enriques surface or a rational surface if it is smooth.Finite groups where the quotient space are Enriques surfaces are known.In this paper,by analyzing effective divisors on smooth rational surfaces,the author will study finite groups which act faithfully on K3 surfaces such that the quotient space are smooth.In particular,he will completely determine effective divisors on Hirzebruch surfaces such that there is a finite Abelian cover from a K3 surface to a Hirzebrunch surface such that the branch divisor is that effective divisor.Furthermore,he will decide the Galois group and give the way to construct that Abelian cover from an effective divisor on a Hirzebruch surface.Subsequently,he studies the same theme for Enriques surfaces.

On the Average Number of Unitary Factors of Finite Abelian Groups (Ⅱ)

Let t（G） be the number of unitary factors of finite abelian group G. In this paper we prove T（x）=∑(G≤（）t（G） =main terms+O(x(（1+2k）/（3+4k）for any exponent pair （k, 1/2+2K）. which improves on the exponent 9/25 obtained by Xiaodong Cao and the author.

Weak Isomorphism of Finite Group

On the basis of the quasi-isomorphism of finite groups, a new mapping, weak isomorphism, from a finite group to another finite group is defined. Let G and H be two finite groups and G be weak-isomorphic to H. Then G≌H if G satisfies one of the following conditions. 1） G is a finite Abelian group. 2） The order of G is p^3. 3 ） The order of G is p^n＋1 and G has a cyclic normal subgroup N = 〈a〉 of order p^n. 4） G is a nilpotent group and if p^││G│, then for any P ∈ Sylp （G）, P has a cyclic maximal subgroup, where p is a prime; 5） G is a maximal class group of order p4（p〉3）.

Full-Rank Factoring of Elementary 2-Groups with Equal Size Factors

In order to answer a question motivated by constructing substitution boxes in block ciphers we will exhibit an infinite family of full-rank factorizations of elementary 2-groups into two factors having equal sizes.

On the Number of Finite Non-isomorphic Abelian Groups in Short Intervals

Let the arithmetic function a(n) denote the number of non-isomorphic Abeliangroups of order n;k, positive integer, and x≥0. We setA_k(x)= sum from n≤x a(n)=k to (1)andA_k(x;h) =A_k(x+h)-A_k(x). A. Ivice first investigated the distribution of the values of finite non-isomorphicAbelian groups in short intervals. E. Kratzel reduced the problem to estimate theerror term △(1, 2, 3;x) in the three-dimensional multiplicative problem, and furtherimproved Ivice’s result.

Characterization of Finite Simple Groups With Abelian Sylow 2-Subgroups

For the non-Abelian simple groups with Abelian Sylow 2-subgroups J. H. Walterhas proved the following famous theorem. Lemma 1. If F is a non-Ablian simple group with Abelian Sylow 2-subgroups, thenone of the following holds:（i）F≌PSL（2,Q）,q】3,q≡3,5（mod 8） or q=2n,n≥2;（ii）F≌J1;（iii）F≌R（q）,q=32m+1,m≥1.Let G be a finite group and let πe（G） denote the set of all orders of elements