Recognition of the Projective Special Linear Group over GF（3）

Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.     

On the Stabilizer of the Automorphism Group of a 4—valent Vertex—transitive Graph with Odd—prime—power Order

Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p^κ（κ≥1） and let A be the full automorphism group of X.In this paper,we prove that the stabilizer Av of a vertex v in A is a 2-group if p≠5,or a {2,3}-group if p=5.Furthermore,if p=5|Av| is not divisible by 3^2.As a result ,we show that any 4-valent connected vertex-transitive graph with odd-prime-power order p^κ(κ≥1） is at most 1-arc-transitive for p≠5 and 2-arc-transitive for p=5.     

OD-characterization of Almost Simple Groups Related to U3（5）

Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.     

On the Classification of Arc-transitive Circulant Digraphs of Order Odd-Prime-Squared

A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.     

Finite groups in which elements of the same order outside the center are conjugate

We prove that if G is a finite group in which the elements of the same order outside the center are conjugate,then either G is abelian or G(?)S_3.     

EXPANSIONS OF STEP-TRANSITION OPERATORS OF MULTI-STEP METHODS AND ORDER BARRIERS FOR DAHLQUIST PAIRS

Using least parameters, we expand the step-transition operator of any linear multi-step method （LMSM） up to O（τ^s＋5） with order s = 1 and rewrite the expansion of the steptransition operator for s = 2 （obtained by the second author in a former paper）. We prove that in the conjugate relation G3^λτ o G1^τ =G2^τ o G3^λτ with G1 being an LMSM,（1） theorder of G2 can not be higher than that of G1; （2） if G3 is also an LMSM and G2 is a symplectic B-series, then the orders of G1, G2 and G3 must be 2, 2 and 1 respectively.     

Tetravalent Edge-transitive Cayley Graphs of PGL （2, p）

t Let F = Cay（G, S）, R（G） be the right regular representation of G. The graph Г is called normal with respect to G, if R（G） is normal in the full automorphism group Aut（F） of F. Г is called a bi-normal with respect to G if R（G） is not normal in Aut（Г）, but R（G） contains a subgroup of index 2 which is normal in Aut（F）. In this paper, we prove that connected tetravalent edge-transitive Cayley graphs on PGL（2,p） are either normal or bi-normal when p ≠ 11 is a prime.     

OD-CHARACTERIZATION OF ALMOST SIMPLE GROUPS RELATED TO U6（2）

Let G be a finite group and π(G) = { p 1 , p 2 , ··· , p k } be the set of the primes dividing the order of G. We define its prime graph Γ(G) as follows. The vertex set of this graph is π(G), and two distinct vertices p, q are joined by an edge if and only if pq ∈π e (G). In this case, we write p ～ q. For p ∈π(G), put deg(p) := |{ q ∈π(G) | p ～ q }| , which is called the degree of p. We also define D(G) := (deg(p 1 ), deg(p 2 ), ··· , deg(p k )), where p 1 < p 2 < ··· < p k , which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a 1-fold OD-characterizable group is simply called an OD-characterizable group. Let L := U 6 (2). In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S 3 is 5-fold OD-characterizable.     

Hamiltonicity of 4-connected graphs

Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of order n and σ5（G） 〉 n ＋ 3σ（G） ＋ 11, then G is Hamiltonian.     

On Two Theorems of Finite Solvable Groups

For a finite group G, let T（G） denote a set of primes such that a prime p belongs to T（G） if and only if p is a divisor of the index of some maximal subgroup of G. It is proved that if G satisfies any one of the following conditions： （1） G has a p-complement for each p∈T（G）; （2）│T（G）│= 2： （3） the normalizer of a Sylow p-subgroup of G has prime power index for each odd prime p∈T（G）; then G either is solvable or G/Sol（G）≌PSL（2, 7） where Sol（G） is the largest solvable normal subgroup of G.     

Semisymmetric graphs of order 6p 2 and prime valency

In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.     

Characterization of L2(16) by Τe(L2(16))

Let G be a group and πe(G) the set of element orders of G.Let k∈πe(G) and m k be the number of elements of order k in G.Letτe(G)={mk|k∈πe(G)}.In this paper,we prove that L2(16) is recognizable byτe (L2(16)).In other words,we prove that if G is a group such that τe(G)=τe(L2(16))={1,255,272,544,1088,1920},then G is isomorphic to L2(16).     

Finite groups with its power automorphism groups having small indices

In this paper, a finite group G with IAut（G） ： P（G）I ~- p or pq is determined, where P（G） is the power automorphism group of G, and p, q are distinct primes. Especially, we prove that a finite group G satisfies ｜Aut（G） ： P（G）｜= pq if and only if Aut（G）/P（G） ≌S3. Also, some other classes of finite groups are investigated and classified, which are necessary for the proof of our main results.     

3-restricted connectivity of graphs with given girth

Let G = （V, E） be a connected graph. X belong to V（G） is a vertex set. X is a 3-restricted cut of G, if G- X is not connected and every component of G- X has at least three vertices. The 3-restricted connectivity κ3（G） （in short κ3） of G is the cardinality of a minimum 3-restricted cut of G. X is called κ3-cut, if ｜X｜ = κ3. A graph G is κ3-connected, if a 3-restricted cut exists. Let G be a graph girth g ≥ 4, κ3（G） is min{d（x） ＋ d（y） ＋ d（z） - 4 ： xyz is a 2-path of G}. It will be shown that κ3（G） = ξ3（G） under the condition of girth.     

Finite groups with seminormal Sylow subgroups

In this paper, we prove the following theorem： Let p be a prime number, P a Sylow psubgroup of a group G and π = π（G） ／ {p}. If P is seminormal in G, then the following statements hold： 1） G is a p-soluble group and P＇ ≤ Op（G）; 2） lp（G） ≤ 2 and lπ（G） ≤ 2; 3） if a π-Hall subgroup of G is q-supersoluble for some q ∈ π, then G is q-supersoluble.     

On Generic Well-posedness of Restricted Chebyshev Center Problems in Banach Spaces

Let B （resp. K, BC,KC） denote the set of all nonempty bounded （resp. compact, bounded convex, compact convex） closed subsets of the Banach space X, endowed with the Hausdorff metric, and let G be a nonempty relatively weakly compact closed subset of X. Let B° stand for the set of all F ∈B such that the problem （F, G） is well-posed. We proved that, if X is strictly convex and Kadec, the set KC ∩ B° is a dense Gδ-subset of KC ／ G. Furthermore, if X is a uniformly convex Banach space, we will prove more, namely that the set B ／B° （resp. K ／ B°, BC ／B°, KC ／ B°） is a-porous in B （resp. K,BC, KC）. Moreover, we prove that for most （in the sense of the Baire category） closed bounded subsets G of X, the set K ／ B° is dense and uncountable in K.     

Global Poincaré Inequalities on the Heisenberg Group and Applications

Let f be in the localized nonisotropic Sobolev space Wloc^1,p （H^n） on the n-dimensional Heisenberg group H^n = C^n ×R, where 1≤ p ≤ Q and Q = 2n ＋ 2 is the homogeneous dimension of H^n. Suppose that the subelliptic gradient is gloablly L^p integrable, i.e., fH^n ｜△H^n f｜^p du is finite. We prove a Poincaré inequality for f on the entire space H^n. Using this inequality we prove that the function f subtracting a certain constant is in the nonisotropic Sobolev space formed by the completion of C0^∞（H^n） under the norm of （∫H^n ｜f｜ Qp/Q-p）^Q-p/Qp ＋ （∫ H^n ｜△H^n f｜^p）^1/p. We will also prove that the best constants and extremals for such Poincaré inequalities on H^n are the same as those for Sobolev inequalities on H^n. Using the results of Jerison and Lee on the sharp constant and extremals for L^2 to L（2Q/Q-2） Sobolev inequality on the Heisenberg group, we thus arrive at the explicit best constant for the aforementioned Poincaré inequality on H^n when p=2. We also derive the lower bound of the best constants for local Poincaré inequalities over metric balls on the Heisenberg group H^n.     

Beurling's theorem and invariant subspaces for the shift on Hardy spaces

Let G be a bounded open subset in the complex plane and let H~2(G) denote the Hardy space on G. We call a bounded simply connected domain W perfectly connected if the boundary value function of the inverse of the Riemann map from W onto the unit disk D is almost 1-1 with respect to the Lebesgue measure on D and if the Riemann map belongs to the weak-star closure of the polynomials in H~∞(W). Our main theorem states: in order that for each M∈Lat (M_z), there exist u∈H~∞(G) such that M=∨{uH~2(G)}, it is necessary and sufficient that the following hold: (1) each component of G is a perfectly connected domain; (2) the harmonic measures of the components of G are mutually singular; (3) the set of polynomials is weak-star dense in H~∞(G). Moreover, if G satisfies these conditions, then every M∈Lat (M_z) is of the form uH~2(G), where u∈H~∞(G) and the restriction of u to each of the components of G is either an inner function or zero.     

On κ—ordered Graphs Involved Degree Sum

A graph G is κ-ordered Hamiltonian 2≤κ≤n,if for every ordered sequence S of κ distinct vertices of G,there exists a Hamiltonian cycle that encounters S in the given order,In this article,we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least n 3κ-9/2,then G is κ-ordered Hamiltonian for κ=3,4,…,[n/19].We also show that the degree sum bound can be reduced to n 2[κ/2]-2 if κ(G）≥3κ-1/2 or δ（G）≥5κ-4.Several known results are generalized.     

用$\tau_e(L_2(16))$刻画$L_2(16)$

Let G be a group and πe(G) the set of element orders of G.Let k∈πe(G) and m k be the number of elements of order k in G.Letτe(G)={mk|k∈πe(G)}.In this paper,we prove that L2(16) is recognizable byτe (L2(16)).In other words,we prove that if G is a group such that τe(G)=τe(L2(16))={1,255,272,544,1088,1920},then G is isomorphic to L2(16).