Omega subgroups of pro-<Emphasis Type="Italic">p</Emphasis> groups

Let G be a pro-p group and let k ≥ 1. If γ _k(p−1) (G) ≤ γ _r for some r and s such that k(p − 1) < r + s(p − 1), we prove that the exponent of Ω_i(G) is at most p ^i+k−1 for all i. Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds. The first author is also supported by the University of the Basque Country, grant UPV05/99. The second author is also supported by the Basque Government.     

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.     

Finite <Emphasis Type="Italic">p</Emphasis>-central groups of height <Emphasis Type="Italic">k</Emphasis>

A finite group G is called p ⁱ -central of height k if every element of order p ⁱ of G is contained in the k ^th -term ζ _k (G) of the ascending central series of G. If p is odd, such a group has to be p-nilpotent (Thm. A). Finite p-central p-groups of height p − 2 can be seen as the dual analogue of finite potent p-groups, i.e., for such a finite p-group P the group P/Ω₁(P) is also p-central of height p − 2 (Thm. B). In such a group P, the index of P ^p is less than or equal to the order of the subgroup Ω₁(P) (Thm. C). If the Sylow p-subgroup P of a finite group G is p-central of height p − 1, p odd, and N _G (P) is p-nilpotent, then G is also p-nilpotent (Thm. D). Moreover, if G is a p-soluble finite group, p odd, and P ∈ Syl _p (G) is p-central of height p − 2, then N _G (P) controls p-fusion in G (Thm. E). It is well-known that the last two properties hold for Swan groups (see [11]).     

D p spaces on bounded symmetric domains ofC n

In this paper, the spaceD ^p(Ω) of functions holomorphic on bounded symmetric domain ofC ⁿ is defined. We prove thatH ^p(Ω)⊂D ^p(Ω) if 0<p≤2, andD ^p(Ω)⊂H ^p(Ω) ifp≥2, and both the inclusions are proper. Further, we find that some theorems onH ^p(Ω) can be extended to a wider classD ^p(Ω) for 0<p≤2.     

Potential space estimates in local Hardy spaces for Green potentials in convex domains

Let Ω be a bounded co.nvex domain in Rn(n≥3) and G(x,y) be the Green function of the Laplace operator -△ on Ω. Let hrp(Ω) = {f ∈ D'(Ω) :(E)F∈hp(Rn), s.t. F|Ω = f}, by the atom characterization of Local Hardy spaces in a bounded Lipschitz domain, the bound of f→(△)2(Gf) for every f ∈ hrp(Ω) is obtained, where n/(n 1)＜p≤1.     

Lower semicontinuity of quasiconvex integrals

Summary New lower semicontinuity results for quasiconvex integrals. In particular, under certain structure conditions and growth 0≤F(ξ)≤C(∣≤∣ ^q ) the functional ∫ _Ω F(∇u)dx is proved to be lower semicontinuous onW ^1,q with respect to the weak convergence inW ^1,p, p≥q−1. Research supported by the grant No. 201/93/2171 of Czech Grant Agency (GAČR) and by the grant No. 364 of Charles University (GAUK). This article was processed by the author using the Springer-VerlagTex P Jourlg marco package 1991.     

Permutability of minimal subgroups and<Emphasis Type="Italic">p</Emphasis>-nilpotency of finite groups

In this paper it is proved that ifp is a prime dividing the order of a groupG with (|G|,p − 1) = 1 andP a Sylowp-subgroup ofG, thenG isp-nilpotent if every subgroup ofP ∩G ^N of orderp is permutable inN _G (P) and whenp = 2 either every cyclic subgroup ofP ∩G ^N of order 4 is permutable inN _G (P) orP is quaternion-free. Some applications of this result are given. The research of the first author is supported by a grant of Shanxi University and a research grant of Shanxi Province, PR China. The research of the second author is partially supported by a UGC(HK) grant #2160126 (1999/2000).     

The finite <Emphasis Type="Italic">p</Emphasis>-groups with <Emphasis Type="Italic">p</Emphasis> conjugacy classes of non-normal subgroups

Let ν(G) be the number of conjugacy classes of non-normal subgroups of a finite group G. The finite groups for which ν(G) ≤ 2 were determined by Dedekind and by Schmidt in the early times of group theory. On the other hand, if G is a finite p-group, La Haye and Rhemtulla have proved that either ν(G) ≤ 1 or ν(G) ≥ p. In this note, we determine all finite p-groups satisfying ν(G) = p for p > 2.     

Two order superconvergence of finite element methods for Sobolev equations

We consider finite element methods applied to a class of Sobolev equations inR ^d(d ≥ 1). Global strong superconvergence, which only requires that partitions are quais-uniform, is investigated for the error between the approximate solution and the Ritz-Sobolev projection of the exact solution. Two order superconvergence results are demonstrated inW ^1,p (Ω) andL _p(Ω) for 2 ≤p < ∞.     

Higher order Poincaré inequalities associated with linear operators on stratified groups and applications

 This paper considers the dual of anisotropic Sobolev spaces on any stratified groups 𝔾. For 0≤k<m and every linear bounded functional T on anisotropic Sobolev space W ^m−k,p (Ω) on Ω⊂𝔾, we derive a projection operator L from W ^m,p (Ω) to the collection 𝒫 _k+1 of polynomials of degree less than k+1 such that T(X ^I (Lu))=T(X ^I u) for all uW ^m,p (Ω) and multi-index I with d(I)≤k. We then prove a general Poincaré inequality involving this operator L and the linear functional T. As applications, we often choose a linear functional T such that the associated L is zero and consequently we can prove Poincaré inequalities of special interests. In particular, we obtain Poincaré inequalities for functions vanishing on tiny sets of positive Bessel capacity on stratified groups. Finally, we derive a Hedberg-Wolff type characterization of measures belonging to the dual of the fractional anisotropic Sobolev spaces W ^α,p 𝔾. Received: 25 March 2002; in final form: 10 September 2002 / Published online: 1 April 2003 Mathematics Subject Classification (1991): 46E35, 41A10, 22E25 The second author was supported partly by U.S NSF grant DMS99-70352 and the third author was supported partly by NNSF grant of China.     

Some results on distance two labelling of outerplanar graphs

Let G be an outerplanar graph with maximum degree △. Let χ（G^2） and A（G） denote the chromatic number of the square and the L（2, 1）-labelling number of G, respectively. In this paper we prove the following results： （1） χ（G^2） = 7 if △= 6; （2） λ（G） ≤ △ ＋5 if △ ≥ 4, and ）,（G）≤ 7 if △ = 3; and （3） there is an outerplanar graph G with △ = 4 such that ）λ（G） = 7. These improve some known results on the distance two labelling of outerplanar graphs.     

The roots of <Emphasis Type="Italic">σ</Emphasis>-polynomials

Let G be a connected graph. We denote by σ(G,x) and δ(G) respectively the σ-polynomial and the edge-density of G, where . If σ(G,x) has at least an unreal root, then G is said to be a σ-unreal graph. Let δ(n) be the minimum edgedensity over all n vertices graphs with σ-unreal roots. In this paper, by using the theory of adjoint polynomials, a negative answer to a problem posed by Brenti et al. is given and the following results are obtained: For any positive integer a and rational number 0≤c≤1, there exists at least a graph sequence {G _i}_1≤i≤a such that G _i is σ-unreal and δ(G _i)→c as n→∞ for all 1 ≤i≤a, and moreover, δ(n)→0 as n→∞. Supported by the National Natural Science Foundation of China (10061003) and the Science Foundation of the State Education Ministry of China.     

On hamiltonicity of <Emphasis Type="Italic">P</Emphasis><Subscript>3</Subscript>-dominated graphs

We introduce a new class of graphs which we call P ₃-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P ₃-dominated graph. We prove that G is hamiltonian if α(G ²) ≤ κ(G), with two exceptions: K _2,3 and K _1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. This paper was completed when both authors visited the Center for Combinatorics, Nankai University, Tianjin. They gratefully acknowledge the hospitality and support of the Center for Combinatorics and Nankai University. The work of E.Vumar is sponsored by SRF for ROCS, REM.     

The intersection of subgroups of finite <Emphasis Type="Italic">p</Emphasis>-groups

For a finite p-group G and a positive integer k let I _k (G) denote the intersection of all subgroups of G of order p ^k . This paper classifies the finite p-groups G with I_k(G) @ C_p^k-1{{I}_k(G)\cong C_{p^{k-1}}} for primes p > 2. We also show that for any k, α ≥ 0 with 2(α + 1) ≤ k ≤ n−α the groups G of order p ⁿ with I_k(G) @ C_p^k-a{{I}_k(G)\cong C_{p^{k-\alpha}}} are exactly the groups of exponent p ^n-α .     

On the abelianizations of congruence subgroups of Aut(<Emphasis Type="Italic">F</Emphasis><Subscript>2</Subscript>)

Let F _n be the free group of rank n, and let Aut⁺(F _n ) be its special automorphism group. For an epimorphism π : F _n → G of the free group F _n onto a finite group G we call the standard congruence subgroup of Aut⁺(F _n ) associated to G and π. In the case n = 2 we fully describe the abelianization of Γ⁺(G, π) for finite abelian groups G. Moreover, we show that if G is a finite non-perfect group, then Γ⁺(G, π) ≤ Aut⁺(F ₂) has infinite abelianization.     

Can visibility graphs Be represented compactly?

We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques. Given a graphG, a familyG={G ₁,G ₂,...,G _k } is called aclique cover ofG if (i) eachG _i is a clique or a bipartite clique, and (ii) the union ofG _i isG. The size of the clique coverG is defined as ∑ _i=1 ^k n _i , wheren _i is the number of vertices inG _i . Our main result is that there are visibility graphs ofn nonintersecting line segments in the plane whose smallest clique cover has size Ω(n ²/log² n). An upper bound ofO(n ²/logn) on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility graph of a simple polygon always admits a clique cover of sizeO(nlog³ n), and that there are simple polygons whose visibility graphs require a clique cover of size Ω(n logn). The work by the first author was supported by National Science Foundation Grant CCR-91-06514. The work by the second author was supported by a USA-Israeli BSF grant. The work by the third author was supported by National Science Foundation Grant CCR-92-11541.     

Full friendly index sets of Cartesian products of two cycles

Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.     

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

For a graph G, we define σ₂(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k of length at most four such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k. And show if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k, V(C ₁) ∪...∪ V(C _k ) = V(G), and |C _i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ₂(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.     

On a graph packing conjecture by Bollobás,Eldridge and Catlin

Two graphs G ₁ and G ₂ of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets are disjoint. In 1978, Bollobás and Eldridge, and independently Catlin, conjectured that if (Δ(G ₁) + 1)(Δ(G ₂) + 1) ≤ n + 1, then G ₁ and G ₂ pack. Towards this conjecture, we show that for Δ(G ₁),Δ(G ₂) ≥ 300, if (Δ(G ₁) + 1)(Δ(G ₂) + 1) ≤ 0.6n + 1, then G ₁ and G ₂ pack. This is also an improvement, for large maximum degrees, over the classical result by Sauer and Spencer that G ₁ and G ₂ pack if Δ(G ₁)Δ(G ₂) < 0.5n. This work was supported in part by NSF grant DMS-0400498. The work of the second author was also partly supported by NSF grant DMS-0650784 and grant 05-01-00816 of the Russian Foundation for Basic Research. The work of the third author was supported in part by NSF grant DMS-0652306.     

Chromatic uniqueness of certain complete tripartite graphs

Let P(G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H, λ) = P(G, λ) implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.: A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discrete Math., 289, 175–179 (2004)], and Lau and Peng [Lau, G. C., Peng, Y. H.: Chromatic uniqueness of certain complete t-partite graphs. Ars Comb., 92, 353–376 (2009)] show that K(p − k, p − i, p) for i = 0, 1 are chromatically unique if p ≥ k + 2 ≥ 4. In this paper, we show that if 2 ≤ i ≤ 4, the complete tripartite graph K(p − k, p − i, p) is chromatically unique for integers k ≥ i and p ≥ k ²/4 + i + 1.