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.     

ENUMERATION ON EXACTLY K-REDUCIBLE N-TOURNAMENTS

The formula for the number r~+(n,k)of all isomorphism classes ofexactly k-reducible n-tournamens and the formula on the number r(n,2)of allisomorphism classes of 2-reducible n-tournaments are obtained.By using theseresults,another formula on the number s(n)of all isomorphism classes of strongn-touruaments is established,which is represented by recurrence relations.     

Circulant Double Coverings of a Circulant Graph of Valency Five

Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73-85 （2004）1 enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21,386 400 （2005）], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated.     

On the Characterizability of the Automorphism Groups of Sporadic Simple Groups by Their Element Orders

For G a finite group,π_e(G) denotes the set of orders of elements in G.If Ω is a subsetof the set of natural numbers,h(Ω) stands for the number of isomorphism classes of finite groups withthe stone set Ω of element orders.We say that G is k-distinguishable if h(π_e(G))=k<∞,otherwiseG is called non-distinguishable.Usually,a 1-distinguishable group is called a characterizable group.Itis shown that if M is a sporadic simple group different from M_(12),M_(22),J_2,He,Suz,M~cL and O'N,then Aut(M) is characterizable by its element orders.It is also proved that if M is isomorphic toM_(12),M_(22),He,Suz or O'N,then h(π_e(Aut(M)))∈{1,∞}.     

A RECOGNITION OF SIMPLE GROUPS PSL（3, q） BY THEIR ELEMENT ORDERS

For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.     

NUMBERS OF CONJUGATE CLASSES OF SYMMETRIC AND ALTERNATING GROUPS

Let d(n)be the excess of the number of even conjugate classes of S_n over that of oddconjugate classes of S_n and q(n)the number of splitting classes of S_n.In this paper arecurrence formula for d(n)and one for q(n)are given.As a recurrence formula for thenumber p(n)of conjugate classes of S_n is known,one can make use of p(n),d(n)andq(n)to calculate the numbers of even(odd)conjugate classes of S_n and that of conjugateclasses of A_n.By means of a graphical method the author proves the identity d(n)=q(n)when n≥2,which seems to have been obtained first by Sylvester by use of generatingfunctions.     

The Generalized Center-Weak Saddle of General Homogeneous System of Degree n

In this paper,a problem of center-weak focus of a homogeneous system of degree n is transformed into a problem of generalized center-weak saddle. It provides formulae for the saddle values of the first (4-(-1)n)m orders in such a system,where m=n-1 if n is an even number and m=(n-1)/2 if n is an odd number.     

Extremal Problems on Components and Loops in Graphs

The authors recently defined a new graph invariant denoted by Ω(G) only in terms of a given degree sequence which is also related to the Euler characteristic. It has many important combinatorial applications in graph theory and gives direct information compared to the better known Euler characteristic on the realizability, connectedness, cyclicness, components, chords, loops etc. Many similar classification problems can be solved by means of Ω. All graphs G so that Ω(G) ≤-4 are shown to be disconnected, and if Ω(G) ≥-2, then the graph is potentially connected. It is also shown that if the realization is a connected graph and Ω(G) =-2, then certainly the graph should be a tree.Similarly, it is shown that if the realization is a connected graph G and Ω(G) ≥ 0, then certainly the graph should be cyclic. Also, when Ω(G) ≤-4, the components of the disconnected graph could not all be cyclic and if all the components of G are cyclic, then Ω(G) ≥ 0. In this paper, we study an extremal problem regarding graphs. We find the maximum number of loops for three possible classes of graphs.We also state a result giving the maximum number of components amongst all possible realizations of a given degree sequence.     

{(3,4),4}-富勒烯图的极大共振性（英文）

A {(3,4), 4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then ...     

The Solution of Scholz's Problem

Def. The natural n is called a satisfiable number of a(in first order logic)formula α if α has a model of cardinality n. Def.The set M is called a finite spectrum if M is the set of all the satis-fiable numbers of a certain formula of first order logic.     

A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point

The reduced equations for the isomorphism classes of hyperelliptic curves of genus 2 admitting a Weierstrass point over a finite field of arbitrary characteristic, are shown and the number of such classes is included. This work picks up in a unified way a series of previous results published by several authors by using different methodologies. These classifications are of interest in designing and implementing of hyperelliptic curve cryptosystems.     

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

This paper is devoted to computing 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 odd characteristic. The number of isomorphism classes is computed. This number can be represented as a polynomial in q of degree 7, where q is the order of the finite field. The results have applications in the classification problems and in the hyperelliptic curve cryptosystems.     

一类超椭圆曲线的整点个数

设ｎ是大于２的工整数，Ｄ是无平方因子正整数，分别是Ｋ的理想类群和类数．对于正整数ｍ，设ｇｋ（ｍ）是Ｉｘ中阶数等于ｍ的理想类的个数．本文证明了：超椭圆曲线ｆ（ｘ，ｙ）＝Ｄｘ２－４ｙｎ＋１＝０上整数点（ｘ，ｙ）的个数不超过ｍａｘ（８，２１６４Ｐ８１ｇｋ（Ｐ）），其中ｐ是ｎ的奇素因数．     

Isomorphism classes of elliptic and hyperelliptic curves over finite fields

We give the number and representatives of isomorphism classes of hyperelliptic curves of genus g defined over finite fields , g=1,2,3. These results have applications to hyperelliptic curve cryptography.     

Towers of 2-covers of hyperelliptic curves

In this article, we give a way of constructing an unramified Galois-cover of a hyperelliptic curve. The geometric Galois-group is an elementary abelian -group. The construction does not make use of the embedding of the curve in its Jacobian, and it readily displays all subcovers. We show that the cover we construct is isomorphic to the pullback along the multiplication-by- map of an embedding of the curve in its Jacobian.

We show that the constructed cover has an abundance of elliptic and hyperelliptic subcovers. This makes this cover especially suited for covering techniques employed for determining the rational points on curves. In particular the hyperelliptic subcovers give a chance for applying the method iteratively, thus creating towers of elementary abelian 2-covers of hyperelliptic curves.

As an application, we determine the rational points on the genus curve arising from the question of whether the sum of the first fourth powers can ever be a square. For this curve, a simple covering step fails, but a second step succeeds.

     

关于A.Menezes和S.Vanstone一文的注记

1987年,R.Schoof对于有限域Fq上的椭圆曲线的同构类数目得出了一个公式.1990年,A.M enezes和S.V anstone对此当q为偶数时给出了一个初等证明.本文利用Burnside引理对q为偶数时给出一个更简单的证明.     

Explicit Mumford isomorphism for hyperelliptic curves

Using an explicit version of the Mumford isomorphism on the moduli space of hyperelliptic curves we derive a closed formula for the Arakelov-Green function of a hyperelliptic Riemann surface evaluated at its Weierstrass points.     

Elliptic subcovers of hyperelliptic curves

The main result of this paper states that if C is a hyperelliptic curve of even genus over an arbitrary field K , then there is a natural bijection between the set of equivalence classes of elliptic subcovers of and the set of elliptic subgroups of its Jacobian .     

Maximal amplitudes of hyperelliptic solutions of the derivative nonlinear Schrödinger equation

A simple formula is proven for an upper bound for amplitudes of hyperelliptic (finite-gap or N-phase) solutions of the derivative nonlinear Schrödinger equation. The upper bound is sharp, viz, it is attained for some initial conditions. The method used to prove the upper bound is the same method, with necessary modifications, used to prove the corresponding bound for solutions of the focusing NLS equation (Wright OC, III. Sharp upper bound for amplitudes of hyperelliptic solutions of the focusing nonlinear Schrödinger equation. Nonlinearity. 2019;32:1929-1966).