Genus Distributions for Several Types of Ladder-class Graphs

Calculating the genus distributions of ladder graphs is a concerned topic in topological graph theory.In this paper,we formulate several ladder-class graphs by using a starting graph iterative amalgamation with copies of a path to construct a base graph and then adding some edges to the appointed root-vertices of the base graph.By means of transfer matrix and a finer partition of the embeddings,the explicit formulas for the genus distribution polynomials of four types of ladder-class graphs are derived.     

Remarks on the lower bounds for the average genus

Let G be a graph of maximum degree at most four. By using the overlap matrix method which is introduced by B. Mohar, we show that the average genus of G is not less than 1/3 of its maximum genus, and the bound is best possible. Also, a new lower bound of average genus in terms of girth is derived.     

无环多重图的最大亏格的下界

The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous known results. Thus, a picture of the lower bounds on the maximum genus of loopless multigraphs is presented.     

The genus of a type of graph

Based on the joint tree model introduced by Liu, the genera of further types of graphs not necessary to have certain symmetry can be obtained. In this paper, we obtain the genus of a new type of graph with weak symmetry. As a corollary, the genus of complete tripartite graph K n,n,l (l≥n≥2) is also derived. The method used here is more direct than those methods, such as current graph, used to calculate the genus of a graph and can be realized in polynomial time.     

The genus polynomials of cross-ladder digraphs in orientable surfaces

Some results about the genus distributions of graphs are known,but little is known about those of digraphs.In this paper,the method of joint trees initiated by Liu is generalized to compute the embedding genus distributions of digraphs in orientable surfaces.The genus polynomials for a new kind of 4-regular digraphs called the cross-ladders in orientable surfaces are obtained.These results are close to solving the third problem given by Bonnington et al.     

Maximum Genus of Strong Embeddings

The strong embedding conjecture states that any 2-connected graph has a strong embedding on some surface. It implies the circuit double cover conjecture: Any 2-connected graph has a circuit double cover.Conversely, it is not true. But for a 3-regular graph, the two conjectures are equivalent. In this paper, a characterization of graphs having a strong embedding with exactly 3 faces, which is the strong embedding of maximum genus, is given. In addition, some graphs with the property are provided. More generally, an upper bound of the maximum genus of strong embeddings of a graph is presented too. Lastly, it is shown that the interpolation theorem is true to planar Halin graph.     

Quadratic perturbations of a class of quadratic reversible center of genus one

This paper is concerned with the quadratic perturbations of a one-parameter family of quadratic reversible system, having a center of genus one. The exact upper bound of the number of limit cycles emerging from the period annulus surrounding the center of the unperturbed system is given.     

EXPLICIT EXPRESSIONS FOR SOME DISTRIBUTIONS RELATED TO RUIN PROBLEMS

The classical risk process that is perturbed by diffusion is studied .The explicit expressions for the runi probability and the surplus distribution of the risk process at the time of runi are obtained when the claim amount distribution is a finite mixture of exponential distributions of a Gamma (2,α） distribution.     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

The maximum genus of a 3-regular simplicial graph

In this paper, the relationship between non-separating independent number and the maximum genus of a 3-regular simplicial graph is presented. A lower bound on the maximumgenus of a 3-regular graph invalving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu.     

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.     

The nonorientable genus of the join of two cycles

In this paper, we show that the nonorientable genus of Cm ＋ Cn, the join of two cycles Cm and Cn, is equal to [（（m-2）（n-2））/2] if m = 3, n ≡ 1 （mod 2）, or m ≥ 4, n ≥ 4, （m, n） （4, 4）. We determine that the nonorientable genus of C4 ＋C4 is 3, and that the nonorientable genus of C3 ＋Cn is n/2 if n ≡ 0 （mod 2）. Our results show that a minimum nonorientable genus embedding of the complete bipartite graph Km,n cannot be extended to an embedding of the join of two cycles without increasing the genus of the surface.     

LAPLACE TRANSFORM OF THE SURVIVAL PROBABILITY UNDER SPARRE ANDERSEN MODEL

In this paper a class of risk processes in which claims occur as a renewal process is studied. A clear expression for Laplace transform of the survival probability is well given when the claim amount distribution is Erlang distribution or mixed Erlang distribution. The expressions for moments of the time to ruin with the model above are given.     

EMBEDDINGS OF ONE KIND OF GRAPHS

The purpose of this paper is to display a new kind of simple graphs which belong to B. inwhich any graph has its orientable genus n,n≥3. Furthermore, for any integer k,1≤k≤n,there exists a graph B^kn of B. such that the non-orientable genus of B^kn is k.     

ON THE ORDER OF SUMMABILITY OF THE FOURIER INVERSION FORMULA

In this article we show that the order of the point value, in the sense of Lojasiewicz, of a tempered distribution and the order of summability of the pointwise Fourier inversion formula are closely related. Assuming that the order of the point values and certain order of growth at infinity are given for a tempered distribution, we estimate the order of summability of the Fourier inversion formula. For Fourier series, and in other cases, it is shown that if the distribution has a distributional point value of order k, then its Fourier series is e.v. Cesaro summable to the distributional point value of order k＋1. Conversely, we also show that if the pointwise Fourier inversion formula is e.v. Cesaro summable of order k, then the distribution is the （k ＋ 1）-th derivative of a locally integrable function, and the distribution has a distributional point value of order k ＋ 2. We also establish connections between orders of summability and local behavior for other Fourier inversion problems.     

Exponentially many genus embeddings of the complete graph K 12s+3

In this paper, we consider the problem of construction of exponentially many distinct genus embeddings of complete graphs. There are three approaches to solve the problem. The first approach is to construct exponentially many current graphs by the theory of graceful labellings of paths; the second approach is to find a current assignment of the current graph by the theory of current graph; the third approach is to find exponentially many embedding(or rotation) scheme of complete graph by finding exponentially many distinct maximum genus embeddings of the current graph. According to these three approaches, we can construct exponentially many distinct genus embeddings of complete graph K12s+3, which show that there are at least12× 2(009)s distinct genus embeddings for K12s+3.     

Fiducial inference in the pivotal family of distributions

In this paper a family, called the pivotal family, of distributions is considered. A pivotal family is determined by a generalized pivotal model. Analytical results show that a great many parametric families of distributions are pivotal. In a pivotal family of distributions a general method of deriving fiducial distributions of parameters is proposed. In the method a fiducial model plays an important role. A fiducial model is a function of a random variable with a known distribution, called the pivotal random element, when the observation of a statistic is given. The method of this paper includes some other methods of deriving fiducial distributions. Specially the first fiducial distribution given by Fisher can be derived by the method. For the monotone likelihood ratio family of distributions, which is a pivotal family, the fiducial distributions have a frequentist property in the Neyman-Pearson view. Fiducial distributions of regular parametric functions also have the above frequentist property. Some advantages of the fiducial inference are exhibited in four applications of the fiducial distribution. Many examples are given, in which the fiducial distributions cannot be derived by the existing methods.     

Light-tailed behavior of stationary distribution for state-dependent random walks on a strip

We consider the state-dependent reflecting random walk on a half- strip. We provide explicit criteria for （positive） recurrence, and an explicit expression for the stationary distribution. As a consequence, the light-tailed behavior of the stationary distribution is proved under appropriate conditions. The key idea of the method employed here is the decomposition of the trajectory of the random walk and the main tool is the intrinsic branching structure buried in the random walk on a strip, which is different from the matrix-analytic method.     

TESTING SPHERICITY IN A GMANOVA-MANOVA MODEL WITH NORMAL ERROR

This article presents a statistic for testing the sphericity in a GMANOVA- MANOVA model with normal error. It is shown that the null distribution of this statistic is beta and its nonnull distribution is given in series form of beta distributions.     

STRONG EMBEDDINGS OF PLANAR GRAPHS ON HIGHER SURFACES

In this paper, the authors discuss the upper bound for the genus of strong embeddings for 3-connected planar graphs on higher surfaces. It is shown that the problem of determining the upper bound for the strong embedding of 3-connected planar near-triangulations on higher non-orientable surfaces is NP-hard. As a corollary, a theorem of Richter, Seymour and Siran about the strong embedding of 3-connected planar graphs is generalized to orientable surface.