THE CLASSIFICATION AND PERIOD OF STATES FOR MARKOV CHAIN IN RANDOM ENVIRONMENT

This paper is a continuation of [8]. In Section 1, three kinds of communication are introdnced for two states and the relations among them are investigated. In Section 2, two kinds of period of a state are introdnced and it is obtained that the period is a “class property” ,i.e. two states x and y belong to same class implies the period of x is equal to the period of y.     

Algorithms for Finding the Inverses of Factor Block Circulant Matrices

In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.     

TRANSPORTATION NETWORKS： OLD AND NEW

This paper shows a number of problems in pure and applied mathematics that are solved by constructing transportation networks Moreover, it also shows thatall the solutions are characterized by forbidden configuratlozz which are not minors.However, all the characterisations are much related to the graphic method which was found by Chinese for solving a kind of the transportation problem in the fifties.     

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration

A graph is called a semi-regular graph if its automorphism group action on its ordered pair of adjacent vertices is semi-regular. In this paper, a necessary and sufficient condition for an automorphism of the graph F to be an automorphism of a map with the underlying graph F is obtained. Using this result, all orientation-preserving automorphisms of maps on surfaces (orientable and non-orientable) or just orientable surfaces with a given underlying semi-regular graph F are determined. Formulas for the numbers of non-equivalent embeddings of this kind of graphs on surfaces (orientable, non-orientable or both) are established, and especially, the non-equivalent embeddings of circulant graphs of a prime order on orientable, non-orientable and general surfaces are enumerated.     

TWO PROBLEMS ABOUT COMPOSITION OPERATORS ON HARDY SPACE

In this paper, two problems about composition operator on Hardy space are considered. Firstly, a new estimation of the norm of a class of composition operators is given. Secondly, the cyclic behavior of the adjoint operator of a composition operator is discussed.     

两类循环线性系统中反问题的可解性条件及其快速算法

In this paper., some necessary and sufficient conditions for solving the inverse problem of linear equation system Ax = b taken both on r-circulating and symmetric r-circulating systems are given, furthermore a criterion for decision whether there exists a solution as well a fast algorithm for it and its implementation on computer are given too.     

ON INVERSES AND ALGEBRAIC LOOPS OF CO-H-SPACES

In this paper we study the properties of homotopy inverses of comultiplications and Mgebraic loops of co-H-spaces based on a wedge of spheres. We also investigate a method to construct new comultiplications out of old ones by using a group action. We are primarily interested in the algebraic loops which have inversive, power-associative and Moufang properties for some comultiplications.     

图的循环带宽和

Abstract. Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied.     

On Cycles Containing a Given Arc in Regular Multipartite Tournaments

In this paper we prove that if T is a regular n-partite tournament with n≥4, then each arc of T lies on a cycle whose vertices are from exactly κ partite sets for κ=4,5,…,n. Our result, in a sense, generalizes a theorem due to Alspach.     

Convergence analysis for the Secant method based on new recurrence relations

A new convergence theorem for the Secant method in Banach spaces based on new recurrence relations is established for approximating a solution of a nonlinear operator equation. It is assumed that the divided difference of order one of the nonlinear operator is Lipschitz continuous. The convergence conditions differ from some existing ones and are easily satisfied. The results of the paper are justified by numerical examples that cannot be handled by earlier works.     

Solvable infinite-dimensional linear groups with restrictions on the nonabelian subgroups of infinite rank

Under study are the solvable nonabelian linear groups of infinite central dimension and sectional p-rank, p ≥ 0, in which all proper nonabelian subgroups of infinite sectional p-rank have finite central dimension. We describe the structure of the groups of this class.     

2-Recognizability by prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and let Γ(G) be the prime graph of G. Assume p prime. We determine the finite groups G such that Γ(G) = Γ(PSL(2, p ²)) and prove that if p ≠ 2, 3, 7 is a prime then k(Γ(PSL(2, p ²))) = 2. We infer that if G is a finite group satisfying |G| = |PSL(2, p ²)| and Γ(G) = Γ(PSL(2, p ²)) then G ? PSL(2, p ²). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications are also considered of this result to the problem of recognition of finite groups by element orders.     

A solvability criterion for finite groups

We show that if for every prime p, the normalizer of a Sylow p-subgroup of a finite group G admits a p-solvable supplement, then G is solvable. This generalizes a solvability criterion of Hall which asserts that a finite group G is solvable if and only if G has a Hall p′-subgroup for every prime p.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Universality of mod-p cohomology

Let p be an odd prime number. We relate the algebraic notion of a mod-p formal group law and the topological notion of a mod-p oriented ring spectrum. It is shown that there exists a universal mod-p oriented ring spectrum MOp which splits as a wedge sum of Eilenberg-MacLane spectra. The mod-p Eilenberg-MacLane spectrum is shown to be the universal mod-p oriented ring spectrum with an additive mod-p formal group law.     

Torsion-free constructive nilpotent <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-groups

We consider a torsion-free nilpotent R _p -group, the p-rank of whose quotient by the commutant is equal to 1 and either the rank of the center by the commutant is infinite or the rank of the group by the commutant is finite. We prove that the group is constructivizable if and only if it is isomorphic to the central extension of some divisible torsion-free constructive abelian group by some torsion-free constructive abelian R _p -group with a computably enumerable basis and a computable system of commutators. We obtain similar criteria for groups of that type as well as divisible groups to be positively defined. We also obtain sufficient conditions for the constructivizability of positively defined groups.     

Selmer groups of elliptic curves that can be arbitrarily large

In this article, it is shown that certain kinds of Selmer groups of elliptic curves can be arbitrarily large. The main result is that if p is a prime at least 5, then p-Selmer groups of elliptic curves can be arbitrarily large if one ranges over number fields of degree at most g+1 over the rationals, where g is the genus of X₀(p). As a corollary, one sees that p-Selmer groups of elliptic curves over the rationals can be arbitrarily large for p=5,7 and 13 (the cases p?7 were already known). It is also shown that the number of elements of order N in the N-Selmer group of an elliptic curve over the rationals can be arbitrarily large for N=9,10,12,16 and 25.     

On Groups Generated by Elements of Pirme Order

In the first part of the paper we give a characterization of groups generated by elements of fixed prime order p. In the second part we study the group G _n ^(p) of n × n matrices with the pth power of the determinant equal to 1 over a field F containing a primitive pth root of 1. It is known that the group G _n ⁽²⁾ of n × n matrices of determinant ± 1 over a field F and the group SL _n (F) are generated by their involutions and that each element in these groups is a product of four involutions. We consider some subgroups G of G _n ^(p) and study the following problems: Is G generated by its elements of order p? If so, is every element of G a product of k elements of order p for some fixed integer k? We show that G _n ^(p) and SL _n (F) are generated by their elements of order p and that the bound k exists and is equal to 4. We show that every universal p-Coxeter group has faithful two-dimensional representations over many fields F (including ? and ?). For a universal p-Coxeter group of rank ≥ 2 for p ≥ 3 or of rank ≥ 3 for p = 2 there is no bound k.     

Galois groups of polynomials arising from circulant matrices

Circulant matrices are used to construct polynomials, associated with Chebyshev polynomials of the first kind, whose roots are real and made explicit. Then the Galois groups of the polynomials are computed, giving rise to new examples of polynomials with cyclic Galois groups and Galois groups of order p(p−1) that are generated by a cycle of length p and a cycle of length p−1.     

On the <Emphasis Type="Italic">p</Emphasis>-supersolubility of a finite group with a µ-supplemented sylow <Emphasis Type="Italic">p</Emphasis>-subgroup

A subgroup H of a group G is called µ-supplemented in G if there exists a subgroup K such that G = HK and H ₁ K is a proper subgroup in G for every maximal subgroup H ₁ in H. For the initial values of p, we establish the p-supersolubility of a finite group with a μ-supplemented Sylow p-subgroup.