Biplanes with flag-transitive automorphism groups of almost simple type,with exceptional socle of Lie type

In this paper we prove that there is no biplane admitting a flag-transitive automorphism group of almost simple type, with exceptional socle of Lie type. A biplane is a (v,k,2)-symmetric design, and a flag is an incident point-block pair. A group G is almost simple with socle X if X is the product of all the minimal normal subgroups of G, and X⊴G≤Aut (G). Throughout this work we use the classification of finite simple groups, as well as results from P.B. Kleidman’s Ph.D. thesis which have not been published elsewhere.     

Flag-transitive point-primitive 2-（v,k,4） symmetric designs and two dimensional classical groups

Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ⊴ G ≤ Aut(X) where X ≅ PSL ₂(q). Then D is a 2-(15, 8, 4) symmetric design with X = PSL ₂(9) and X _x = PGL ₂(3) where x is a point of D.     

On recognizability of some finite simple orthogonal groups by spectrum

It is proved that, if G is a finite group that has the same set of element orders as the simple group D _p (q), where p is prime, p ≥ 5 and q ∈ {2, 3, 5}, then the commutator group of G/F(G) is isomorphic to D _p (q), the subgroup F(G) is equal to 1 for q = 5 and to O _q (G) for q ∈ {2, 3}, F(G) ≤ G′, and |G/G′| ≤ 2.     

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.     

Parabolic bundles and representations¶of the fundamental group

Let X be a smooth complex projective variety with Neron–Severi group isomorphic to ℤ, and D an irreducible divisor with normal crossing singularities. Assume 1<r≤ 3. We prove that if π₁(X) doesn't have irreducible PU(r) representations, then π₁(X- D) doesn't have irreducible U(r) representations. The proof uses the non-existence of certain stable parabolic bundles. We also obtain a similar result for GL(2) when D is smooth. Received: 20 December 1999 / Revised version: 7 May 2000     

Finite classical groups and flag-transitive triplanes

Let D be a finite nontrivial triplane, i.e. a 2-(v,k,3) symmetric design, with a flag-transitive, point-primitive automorphism group G. If G is almost simple, with the simple socle X of G being a classical group, then D is either the unique (11, 6, 3)-triplane, with G=PSL₂(11) and G_α=A₅, or the unique (45, 12, 3)-triplane, with G=X:2=PSp₄(3):2≅PSU₄(2):2 and , where α is a point of D.     

SUZUKI GROUPS Sz（q） AND 2-（v,k, 1） BLOCK DESIGNS

It is proved that if D be a 2-(v,k,1) design with G≤Aut D block primitive then G does not have a Suzuki group Sz(q) as the socle.     

Semistar-Krull and valuative dimension of integral domains

Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type ⋆[X] on the polynomial ring D[X], such that, if n := ⋆-dim(D), then n+1 ≤ ⋆[X]-dim(D[X]) ≤ 2n+1. We also establish that if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain, then ⋆[X]-dim(D[X]) = ⋆- dim(D)+1. Moreover we define the semistar valuative dimension of the domain D, denoted by ⋆-dim _v (D), to be the maximal rank of the ⋆-valuation overrings of D. We show that ⋆-dim _v (D) = n if and only if ⋆[X ₁, . . . , X _n ]-dim(D[X ₁, . . . , X _n ]) = 2n, and that if ⋆-dim _v (D) < ∞ then ⋆[X]-dim _v (D[X]) = ⋆-dim _v (D) + 1. In general ⋆-dim(D) ≤ ⋆-dim _v (D) and equality holds if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain. We define the ⋆-Jaffard domains as domains D such that ⋆-dim(D) < ∞ and ⋆-dim(D) = ⋆-dim _v (D). As an application, ⋆-quasi-Prüfer domains are characterized as domains D such that each (⋆, ⋆′)-linked overring T of D, is a ⋆′-Jaffard domain, where ⋆′ is a stable semistar operation of finite type on T. As a consequence of this result we obtain that a Krull domain D, must be a w _D -Jaffard domain.     

Group measure space decomposition of II1 factors and W*-superrigidity

We prove a “unique crossed product decomposition” result for group measure space II₁ factors L ^∞(X)⋊Γ arising from arbitrary free ergodic probability measure preserving (p.m.p.) actions of groups Γ in a fairly large family G\mathcal{G}, which contains all free products of a Kazhdan group and a non-trivial group, as well as certain amalgamated free products over an amenable subgroup. We deduce that if T _n denotes the group of upper triangular matrices in PSL (n,ℤ), then any free, mixing p.m.p. action of G = \operatornamePSL(n,\mathbbZ)*_Tn\operatornamePSL(n,\mathbbZ)\Gamma=\operatorname{PSL}(n,\mathbb{Z})*_{T_{n}}\operatorname{PSL}(n,\mathbb{Z}) is W^∗-superrigid, i.e. any isomorphism between L ^∞(X)⋊Γ and an arbitrary group measure space factor L ^∞(Y)⋊Λ, comes from a conjugacy of the actions. We also prove that for many groups Γ in the family G\mathcal{G}, the Bernoulli actions of Γ are W^∗-superrigid.     

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.     

Group Chromatic Number of Graphs without K5-Minors

 Let G be a graph with a fixed orientation and let A be a group. Let F(G,A) denote the set of all functions f: E(G) ↦A. The graph G is A -colorable if for any function f∈F(G,A), there is a function c: V(G) ↦A such that for every directed e=u v∈E(G), c(u)−c(v)≠f(e). The group chromatic numberχ₁(G) of a graph G is the minimum m such that G is A-colorable for any group A of order at least m under a given orientation D. In [J. Combin. Theory Ser. B, 56 (1992), 165–182], Jaeger et al. proved that if G is a simple planar graph, then χ₁(G)≤6. We prove in this paper that if G is a simple graph without a K ₅-minor, then χ₁(G)≤5. Received: August 18, 1999 Final version received: December 12, 2000     

A Generalization of the Gallai–Roy Theorem

 A well-known and essential result due to Roy ([4], 1967) and independently to Gallai ([3], 1968) is that if D is a digraph with chromatic number χ(D), then D contains a directed path of at least χ(D) vertices. We generalize this result by showing that if ψ(D) is the minimum value of the number of the vertices in a longest directed path starting from a vertex that is connected to every vertex of D, then χ(D) ≤ψ(D). For graphs, we give a positive answer to the following question of Fajtlowicz: if G is a graph with chromatic number χ(G), then for any proper coloring of G of χ(G) colors and for any vertex v∈V(G), there is a path P starting at v which represents all χ(G) colors. Received: May 20, 1999 Final version received: December 24, 1999     

Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs

Let k≥2 be an integer and G = (V(G), E(G)) be a k-edge-connected graph. For X⊆V(G), e(X) denotes the number of edges between X and V(G) − X. Let {s_i, t_i}⊆X_i⊆V(G) (i=1,2) and X₁∩X₂=∅. We here prove that if k is even and e(X_i)≤2k−1 (i=1,2), then there exist paths P₁ and P₂ such that P_i joins s_i and t_i, V(P_i)⊆X_i (i=1,2) and G − E(P₁∪P₂) is (k−2)-edge-connected (for odd k, if e(X₁)≤2k−2 and e(X₂)≤2k−1, then the same result holds [10]), and we give a generalization of this result and some other results about paths not containing given edges.     

On Finite Groups with Few Automorphism Orbits

Denote by ω(G) the number of orbits of the action of Aut(G) on the finite group G. We prove that if G is a finite nonsolvable group in which ω(G) ≤5, then G is isomorphic to one of the groups A₅, A₆, PSL(2, 7), or PSL(2, 8). We also consider the case when ω(G) = 6 and show that, if G is a nonsolvable finite group with ω(G) = 6, then either G ≈ PSL(3, 4) or there exists a characteristic elementary abelian 2-subgroup N of G such that G/N ≈ A₅.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

Finite 2-groups with a nonabelian Frattini subgroup of order 16

According to a classical result of Burnside, if G is a finite 2-group, then the Frattini subgroup Φ(G) of G cannot be a nonabelian group of order 8. Here we study the next possible case, where G is a finite 2-group and Φ(G) is nonabelian of order 16. We show that in that case Φ(G) ≅ M × C₂, where M ≅ D₈ or M ≅ Q₈ and we shall classify all such groups G (Theorem A). Received: 16 February 2005; revised: 7 March 2005     

Mader’s Conjecture On Extremely Critical Graphs

A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K_2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism). Here we prove this conjecture.     

旗传递5-(v,k,2)设计的分类

本文研究了5-(v,k,2)设计的分类问题.利用典型群PSL(2,q)的子群作用于投影线的轨道定理,证明了旗传递5-(v,k,2)设计的自同构群的基柱不能与PSL(2,3n)同构.从而证明了不存在旗传递的5-(v,k,2)设计.     

On spectral characterizations of amenability

We show that a measuredG-space (X, μ), whereG is a locally compact group, is amenable in the sense of Zimmer if and only if the following two conditions are satisfied: the associated unitary representationπ _X ofG intoL ²(X, μ) is weakly contained into the regular representationλ _G and there exists aG-equivariant norm one projection fromL∞(X×X) ontoL∞(X). We give examples of ergodic discrete group actions which are not amenable, althoughπ _X is weakly contained intoλ _G.     

On total chromatic number of planar graphs without 4-cycles

Let G be a simple graph with maximum degree A(G) and total chromatic number Xve(G). Vizing conjectured thatΔ(G) 1≤Xve(G)≤Δ(G) 2 (Total Chromatic Conjecture). Even for planar graphs, this conjecture has not been settled yet. The unsettled difficult case for planar graphs isΔ(G) = 6. This paper shows that if G is a simple planar graph with maximum degree 6 and without 4-cycles, then Xve(G)≤8. Together with the previous results on this topic, this shows that every simple planar graph without 4-cycles satisfies the Total Chromatic Conjecture.