有限域上的本原最优正规元

Let q be a prime or prime power and Fqn the extension of q elements finite field Fq with degree n(n1).Davenport,Lenstra and Schoof proved that there exists a primitive element α∈ Fqn such that α generates a normal basis of Fqn over Fq.Later,Mullin,Gao and Lenstra,etc.,raised the definition of optimal normal bases and constructed such bases.In this paper,we determine all primitive type I optimal normal bases and all finite fields in which there exists a pair of reciprocal elements α and α-1 such that both of them generate optimal normal bases of Fqn over Fq.Furthermore,we obtain a sufficient condition for the existence of primitive type II optimal normal bases over finite fields and prove that all primitive optimal normal elements are conjugate to each other.     

t-PBIB DESIGNS

A new type of design, called a t-PBIB design, is introduced by combining the notion of a t-design and the one of PBIB design. Some basic properties of a t-PBIB design are given, and a class of 3-PBIB designs is constructed by means of finite vector spaces.     

Cyclotomic problem, Gauss sums and Legendre curve

In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the corresponding Gauss sums. The main results in this paper are related with the number of rational points of certain elliptic curve, called "Legendre curve", and the properties and value distribution of such number are also presented.     

Weak minimum aberration and maximum number of clear two-factor interactions in 2_(IV)~(m-p) designs

Both the clear effects and minimum aberration criteria are the important rules for the design selection. In this paper, it is proved that some 2IVm-p designs have weak minimum aberration, by considering the number of clear two-factor interactions in the designs. And some conditions are provided, under which a 2IVm-p design can have the maximum number of clear two-factor interactions and weak minimum aberration at the same time. Some weak minimum aberration 2IVm-p designs are provided for illustrations and two non-isomorphic weak minimum aberration 2IV13-6 designs are constructed at the end of this paper.     

The existence of even cycles with specific lengths in Wenger’s graph

Wenger＇s graph Hm（q） is a q-regular bipartite graph of order 2qm constructed by using the mdimensional vector space Fq^m over the finite field Fq. The existence of the cycles of certain even length plays an important role in the study of the accurate order of the Turan number ex（n; C2m） in extremal graph theory. In this paper, we use the algebraic methods of linear system of equations over the finite field and the “critical zero-sum sequences” to show that： if m ≥ 3, then for any integer l with l ≠ 5, 4 ≤ l ≤ 2ch（Fq） （where ch（Fq） is the character of the finite field Fq） and any vertex v in the Wenger＇s graph Hm（q）, there is a cycle of length 21 in Hm（q） passing through the vertex v.     

Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic

This paper is devoted to counting the number of isomorphism classes of pointed hyperelliptic curves over finite fields. We deal with the genus 4 case and the finite fields are of even characteristics. The number of isomorphism classes is computed and the explicit formulae are given. This number can be represented as a polynomial in q of degree 7, where q is the order of the finite field. The result can be used in the classification problems and it is useful for further studies of hyperelliptic curve cryptosystems, e.g. it is of interest for research on implementing the arithmetics of curves of low genus for cryptographic purposes. It could also be of interest for point counting problems; both on moduli spaces of curves, and on finding the maximal number of points that a pointed hyperelliptic curve over a given finite field may have.     

Some results on 4~m2~n designs with clear two-factor interaction components

Clear effects criterion is one of the important rules for selecting optimal fractional factorial designs,and it has become an active research issue in recent years.Tang et al.derived upper and lower bounds on the maximum number of clear two-factor interactions(2fi's) in 2n-(n-k) fractional factorial designs of resolutions III and IV by constructing a 2n-(n-k) design for given k,which are only restricted for the symmetrical case.This paper proposes and studies the clear effects problem for the asymmetrical case.It improves the construction method of Tang et al.for 2n-(n-k) designs with resolution III and derives the upper and lower bounds on the maximum number of clear two-factor interaction components(2fic's) in 4m2n designs with resolutions III and IV.The lower bounds are achieved by constructing specific designs.Comparisons show that the number of clear 2fic's in the resulting design attains its maximum number in many cases,which reveals that the construction methods are satisfactory when they are used to construct 4m2n designs under the clear effects criterion.     

Construction of optimal supersaturated designs by the packing method

A supersaturated design is essentially a factorial design with the equal occurrence of levels property and no fully aliased factors in which the number of main effects is greater than the number of runs. It has received much recent interest because of its potential in factor screening experiments. A packing design is an important object in combinatorial design theory. In this paper, a strong link between the two apparently unrelated kinds of designs is shown. Several criteria for comparing supersaturated designs are proposed, their properties and connections with other existing criteria are discussed. A combinatorial approach, called the packing method, for constructing optimal supersaturated designs is presented, and properties of the resulting designs are also investigated. Comparisons between the new designs and other existing designs are given, which show that our construction method and the newly constructed designs have good properties.     

COSET DIAGRAMS FOR A HOMOMORPHIC IMAGE OF △（3, 3, k）

Let q be a prime power. By PL（Fq） the authors mean a projective line over the finite field Fq with the additional point ∞. In this article, the authors parametrize the conjugacy classes of nondegenerate homomorphisms which represent actions of △（3, 3, k） = （u, v： u^3 = v^3 = （uv）^k = 1〉on PL（Fq）, where q ≡ ±1（modk）. Also, for various values of k, they find the conditions for the existence of coset diagrams depicting the permutation actions of △（3, 3, k） on PL（Fq）. The conditions are polynomials with integer coefficients and the diagrams are such that every vertex in them is fixed by （u^-v^-）^k. In this way, they get △（3, 3, k） as permutation groups on PL（Fq）.     

Permutation polynomials with low differential uniformity over finite fields of odd characteristic

In this paper, we propose a construction of functions with low differential uniformity based on known perfect nonlinear functions over finite fields of odd characteristic. For an odd prime power q, it is proved that the proposed functions over the finite field Fq are permutations if and only if q≡3(mod 4).     

A construction of maximal linearly independent array

Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.     

GEOMETRIC CONSTRUCTION OF ASSOCIATION SCHEMES FROM DEGENERATE QUADRICS INPROJECTIVE SPACES PG(2v+δ+l-1,Fq) FOR q ODD

Let Fq be a finite field with q elements,where q is a power of an odd prime.In this paper,the authors consider a projective space PG(2v+δ+l,Fq) with dimension 2v+δ+l,partitioned into an affine space AG(2v+δ+l,Fq) of dimension 2v+δ+l and a hyperplane H=PG(2v+δ+l-1,Fq) of dimension 2v+δ+l-1 at infinity,where l≠0.The points of the hyperplane Hare next partitioned into four subsets.A pair of points a and b of the affine space is defined to belong to class i if the line ab meets the subset i of H.Finally,a family of four-class association schemes are constructed,and parameters are also computed.     

Some Optimal Block-Factorial Designs

The theory of optimal design plays a fundamental role in experimental design. Some of the results have been widely applied to the realistic world. In[1], Kiefer proved the optimality of some block designs. In this paper some block-factorial designs are discussed. When a block design d_2(v_2,b,k) is superimposed on other block design d_1(v_1,b,k), the resulting structure is called a block-factorial design and is abbreviated as d_1*d_2. The collection of all such designs is denoted by π(v_1,v_2, bk) or Ω. If d_1,d_2 are uniform and they are orthogonal to each other, the structure can be considered as an orthogonal design with three factors. In[2] Cheng pointed out that     

Construction of 2Ⅲ^[m-（m-k）] Designs with the Maximum Number of Clear Two-factor Interactions

It is useful to know the maximum number of clear two-factor interactions in a_Ⅲ~(m-(m-k))design.This paper provides a method to construct a 2_Ⅲ~(m-(m-k))design with the maximum number of clear two-factorinteractions.And it is proved that the resulting designs have more clear two-factor interactions than thoseconstructed by Tang et al.Moreover,the designs constructed are shown to have concise grid representations.     

APPLICATION OF MINIMUM PROJECTION UNIFORMITY CRITERION IN COMPLEMENTARY DESIGNS

In this article, we consider the characterization problem in design theory. The objective is to characterize minimum projection uniformity for two-level designs in terms of their complementary designs. Here, the complementary design means a design in which all the Hamming distances of any two runs are the same, which generalizes the concept of a pair of complementary designs in the literature. Based on relationships of the uniformity pattern between a pair of complementary designs, we propose a minimum projection uniformity （MPU） rule to assess and compare two-level factorials.     

利用有限域上一类幂零阵的标准形构造Cartesian认证码

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.     

The MAP/PH/N retrial queue in a random environment

We consider the MAP/PH/N retrial queue with a finite number of sources operating in a finite state Markovian random environment. Two different types of multi-dimensional Markov chains are investigated describing the behavior of the system based on state space arrangements. The special features of the two formulations are discussed. The algorithms for calculating the stationary state probabilities are elaborated, based on which the main performance measures are obtained, and numerical examples are presented as well.     

Theoretical Analyses on Discrete Formulae of Directional Differentials in the Finite Point Method

For the five-point discrete formulae of directional derivatives in the finite point method,overcoming the challenge resulted from scattered point sets and making full use of the explicit expressions and accuracy of the formulae,this paper obtains a number of theoretical results:(1)a concise expression with definite meaning of the complicated directional difference coefficient matrix is presented,which characterizes the correlation between coefficients and the connection between coefficients and scattered geometric characteristics;(2)various expressions of the discriminant function for the solvability of numerical differentials along with the estimation of its lower bound are given,which are the bases for selecting neighboring points and making analysis;(3)the estimations of combinatorial elements and of each element in the directional difference coefficient matrix are put out,which exclude the existence of singularity.Finally,the theoretical analysis results are verified by numerical calculations.The results of this paper have strong regularity,which lay the foundation for further research on the finite point method for solving partial differential equations.     

On enumeration of polynomial equivalence classes

The isomorphism of polynomials(IP),one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials.Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate public key cryptosystem.In this paper we show the enumeration of the equivalence classes containing ∑n-1 i=0 aiX2qi when char(Fq) = 2,which implies that these polynomials are all weak IP instances.Moreover,we study the cardinality of an equivalence class containing the binomial aX 2q i + bX 2qj(i=j) over Fqn without the restriction that char(Fq) = 2,which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.     

THE UPWIND FINITE ELEMENT SCHEME AND MAXIMUM PRINCIPLE FOR NONLINEAR CONVECTION-DIFFUSION PROBLEM

In this paper, a kind of partial upwind finite element scheme is studied for twodimensional nonlinear convection-diffusion problem. Nonlinear convection term approximated by partial upwind finite element method considered over a mesh dual to the triangular grid, whereas the nonlinear diffusion term approximated by Galerkin method. A linearized partial upwind finite element scheme and a higher order accuracy scheme are constructed respectively. It is shown that the numerical solutions of these schemes preserve discrete maximum principle. The convergence and error estimate are also given for both schemes under some assumptions. The numerical results show that these partial upwind finite element scheme are feasible and accurate.