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.     

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.     

Groups with the same order and degree pattern

The degree pattern of a finite group has been introduced in [18].A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M .In particular,a 1-fold OD-characterizable group is simply called OD-characterizable.It is shown that the alternating groups A m and A m+1 ,for m = 27,35,51,57,65,77,87,93 and 95,are OD-characterizable,while their automorphism groups are 3-fold OD-characterizable.It is also shown that the symmetric groups S m+2 ,for m = 7,13,19,23,31,37,43,47,53,61,67,73,79,83,89 and 97,are 3-fold OD-characterizable.From this,the following theorem is derived.Let m be a natural number such that m 100.Then one of the following holds: (a) if m = 10,then the alternating groups A m are OD-characterizable,while the symmetric groups S m are OD- characterizable or 3-fold OD-characterizable;(b) the alternating group A 10 is 2-fold OD-characterizable;(c) the symmetric group S 10 is 8-fold OD-characterizable.This theorem completes the study of OD-characterizability of the alternating and symmetric groups A m and S m of degree m 100.     

Recognizing Finite Groups Through Order and Degree Patterns

The degree pattern of a finite group G associated with its prime graph has been introduced by Moghaddamfar in 2005 and it is proved that the following simple groups are uniquely determined by their order and degree patterns:All sporadic simple groups,the alternating groups Ap(p≥5 is a twin prime)and some simple groups of the Lie type.In this paper,the authors continue this investigation.In particular,the authors show that the symmetric groups Sp+3,where p+2 is a composite number and p+4 is a prime and 97相似文献   

On s-semipermutable subgroups of finite groups

Suppose that G is a finite group and H is a subgroup of G. We say that H is ssemipermutable in G if HGv = GpH for any Sylow p-subgroup Gp of G with （p, ｜H｜） = 1. We investigate the influence of s-semipermutable subgroups on the structure of finite groups. Some recent results are generalized and unified.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

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.     

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.     

任意长圈覆盖指定的独立的点

An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k.
The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.     

Smallest close to regular bipartite graphs without an almost perfect matching

A graph G is close to regular or more precisely a （d, d ＋ k）-graph, if the degree of each vertex of G is between d and d ＋ k. Let d ≥ 2 be an integer, and let G be a connected bipartite （d, d＋k）-graph with partite sets X and Y such that ｜X｜- ｜Y｜＋1. If G is of order n without an almost perfect matching, then we show in this paper that·n ≥ 6d ＋7 when k = 1,·n ≥ 4d＋ 5 when k = 2,·n ≥ 4d＋3 when k≥3.Examples will demonstrate that the given bounds on the order of G are the best possible.     

<Emphasis Type="Italic">OD</Emphasis>-Characterization of the automorphism groups of <Emphasis Type="Italic">O</Emphasis><Stack><Subscript>10</Subscript><Superscript>±</Superscript></Stack>(2)

The prime graph of a finite group was introduced by Gruenberg and Kegel. The degree pattern of a finite group G associated to its prime graph was introduced in [1] and denoted by D(G). The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying conditions (1) |G| = |H| and (2) D(G) = D(H). Moreover, a 1-fold OD-characterizable group is simply called an OD-characterizable group. Till now a lot of finite simple groups were shown to be OD-characterizable, and also some finite groups especially the automorphism groups of some finite simple groups were shown not being OD-characterizable but k-fold OD-characterizable for some k > 1. In the present paper, the authors continue this topic and show that the automorphism groups of orthogonal groups O ₁₀⁺(2) and O ₁₀⁻(2) are OD-characterizable.     

Additive Latin transversals and group rings

LetA={a ₁, …,a _k} and {b ₁, …,b _k} be two subsets of an abelian groupG, k≤|G|. Snevily conjectured that, when |G| is odd, there is a numbering of the elements ofB such thata _i+b _i,1≤i≤k are pairwise distinct. By using a polynomial method, Alon affirmed this conjecture for |G| prime, even whenA is a sequence ofk<|G| elements. With a new application of the polynomial method, Dasgupta, Károlyi, Serra and Szegedy extended Alon’s result to the groupsZ _p ^r andZ _p ^rin the casek<p and verified Snevily’s conjecture for every cyclic group. In this paper, by employing group rings as a tool, we prove that Alon’s result is true for any finite abelianp-group withk<√2p, and verify Snevily’s conjecture for every abelian group of odd order in the casek<√p, wherep is the smallest prime divisor of |G|. This work has been supported partly by NSFC grant number 19971058 and 10271080.     

OD-Characterization of alternating and symmetric groups of degrees 16 and 22

Let G be a finite group and π(G) be the set of all prime divisors of its order. The prime graph GK(G) of G is a simple graph with vertex set π(G), and two distinct primes p, q ∈ π(G) are adjacent by an edge if and only if G has an element of order pq. For a vertex p ∈ π(G), the degree of p is denoted by deg(p) and as usual is the number of distinct vertices joined to p. If π(G) = {p ₁, p ₂,...,p _k }, where p ₁ < p ₂ < ... < p _k , then the degree pattern of G is defined by D(G) = (deg(p ₁), deg(p ₂),...,deg(p _k )). The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying conditions |H| = |G| and D(H) = D(G). In addition, a 1-fold OD-characterizable group is simply called OD-characterizable. In the present article, we show that the alternating group A ₂₂ is OD-characterizable. We also show that the automorphism groups of the alternating groups A ₁₆ and A ₂₂, i.e., the symmetric groups S ₁₆ and S ₂₂ are 3-fold OD-characterizable. It is worth mentioning that the prime graph associated to all these groups are connected.     

Exterior algebras and two conjectures on finite abelian groups

Let G be a finite abelian group with |G| > 1. Let a ₁, …, a _k be k distinct elements of G and let b ₁, …, b _k be (not necessarily distinct) elements of G, where k is a positive integer smaller than the least prime divisor of |G|. We show that there is a permutation π on {1, …,k} such that a ₁ b _π(1), …, a _k b _π(k) are distinct, provided that any other prime divisor of |G| (if there is any) is greater than k!. This in particular confirms the Dasgupta-Károlyi-Serra-Szegedy conjecture for abelian p-groups. We also pose a new conjecture involving determinants and characters, and show that its validity implies Snevily’s conjecture for abelian groups of odd order. Our methods involve exterior algebras and characters.     

A division problem for\bar \partial _b - CLOSED forms

LetG ₁,…,G_m be bounded holomorphic functions in a strictly pseudoconvex domainD such that . We prove that for each (0,q)-form ϕ inL ^p(∂D), 1<p<∞, there are formsu ₁, …,u _m inL ^p(∂D) such that ΣG _ju_j=ϕ. This generalizes previous results forq=0. The proof consists in delicate estimates of integral representation formulas of solutions and relies on a certainT1 theorem due to Christ and Journé. For (0,n−1)-forms there is a simpler proof that also gives the result forp=∞. Restricted to one variable this is precisely the corona theorem. The author was partially supported by the Swedish Natural Research Council.     

Disjoint homotopic paths and trees in a planar graph

In this paper we describe a polynomial-time algorithm for the following problem:given: a planar graphG embedded in ℝ², a subset {I ₁, …,I _p} of the faces ofG, and pathsC ₁, …,C _k inG, with endpoints on the boundary ofI ₁ ∪ … ∪I _p; find: pairwise disjoint simple pathsP ₁, …,P _k inG so that, for eachi=1, …,k, P _i is homotopic toC _i in the space ℝ²\(I ₁ ∪ … ∪I _p). Moreover, we prove a theorem characterizing the existence of a solution to this problem. Finally, we extend the algorithm to disjoint homotopic trees. As a corollary we derive that, for each fixedp, there exists a polynormial-time algorithm for the problem:given: a planar graphG embedded in ℝ² and pairwise disjoint setsW ₁, …,W _k of vertices, which can be covered by the boundaries of at mostp faces ofG;find: pairwise vertex-disjoint subtreesT ₁, …,T _k ofG whereT _i (i=1, …, k).     

An optimal version of an inequality involving the third symmetric means

Let (GA) _n ^[k](a), A _n (a), G _n (a) be the third symmetric mean of k degree, the arithmetic and geometric means of a ₁, …, a _n (a _i > 0, i = 1, …, n), respectively. By means of descending dimension method, we prove that the maximum of p is k−1/n−1 and the minimum of q is n/n−1(k−1/k) ^k/n so that the inequalities {fx505-1} hold.     

Uniform estimates for order statistics and Orlicz functions

We establish uniform estimates for order statistics: Given a sequence of independent identically distributed random variables ξ ₁, … , ξ _n and a vector of scalars x = (x ₁, … , x _n ), and 1 ≤ k ≤ n, we provide estimates for \mathbb E   k-min_{1 ￡ i ￡ n} |x_ix_i|{\mathbb E \, \, k-{\rm min}_{1\leq i\leq n} |x_{i}\xi _{i}|} and \mathbb E k-max_{1 ￡ i ￡ n}|x_ix_i|{\mathbb E\,k-{\rm max}_{1\leq i\leq n}|x_{i}\xi_{i}|} in terms of the values k and the Orlicz norm ||y_x||_M{\|y_x\|_M} of the vector y _x  = (1/x ₁, … , 1/x _n ). Here M(t) is the appropriate Orlicz function associated with the distribution function of the random variable |ξ ₁|, G(t) = \mathbb P ({ |x₁| ￡ t}){G(t) =\mathbb P \left(\left\{ |\xi_1| \leq t\right\}\right)}. For example, if ξ ₁ is the standard N(0, 1) Gaussian random variable, then G(t) = ?{\tfrac2p}ò₀^t e^-\fracs22ds {G(t)= \sqrt{\tfrac{2}{\pi}}\int_{0}^t e^{-\frac{s^{2}}{2}}ds }  and M(s)=?{\tfrac2p}ò₀^se^-\frac12t2dt{M(s)=\sqrt{\tfrac{2}{\pi}}\int_{0}^{s}e^{-\frac{1}{2t^{2}}}dt}. We would like to emphasize that our estimates do not depend on the length n of the sequence.     

On the multiplicity of the eigenvalues of a graph

Given a graph G with characteristic polynomial ϕ(t), we consider the ML-decomposition ϕ(t) = q ₁(t)q ₂(t)² ... q _m (t)^m, where each q _i (t) is an integral polynomial and the roots of ϕ(t) with multiplicity j are exactly the roots of q _j (t). We give an algorithm to construct the polynomials q _i (t) and describe some relations of their coefficients with other combinatorial invariants of G. In particular, we get new bounds for the energy E(G) = |λ_i| of G, where λ₁, λ₂, ..., λ_n are the eigenvalues of G (with multiplicity). Most of the results are proved for the more general situation of a Hermitian matrix whose characteristic polynomial has integral coefficients. This work was done during a visit of the second named author to UNAM.     

Transversals of additive Latin squares

LetA={a ₁, …,a _k} andB={b ₁, …,b _k} be two subsets of an Abelian groupG, k≤|G|. Snevily conjectured that, whenG is of odd order, there is a permutationπ ∈S _ksuch that the sums α _i +b _i , 1≤i≤k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even whenA is a sequence ofk<|G| elements, i.e., by allowing repeated elements inA. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (ℤ _p ) ^a and in the casek<p, and verify Snevily’s conjecture for every cyclic group of odd order. Supported by Hungarian research grants OTKA F030822 and T029759. Supported by the Catalan Research Council under grant 1998SGR00119. Partially supported by the Hungarian Research Foundation (OTKA), grant no. T029132.