On J. H. C. Whitehead's aspherical question I

A connected, finite two-dimensional CW-complex with fundamental group isomorphic toG is called a [G, 2] _f -complex. LetL⊲G be a normal subgroup ofG. L has weightk if and only ifk is the smallest integer such that there exists {l ₁,…,l _k}⊆L such thatL is the normal closure inG of {l ₁,…,l _k}. We prove that a [G, 2] _f -complexX may be embedded as a subcomplex of an aspherical complexY=X∪{e ₁ ² ,…,e _k ² } if and only ifG has a normal subgroupL of weightk such thatH=G/L is at most two-dimensional and defG=defH+k. Also, ifX is anon-aspherical [G, 2] _f -subcomplex of an aspherical 2-complex, then there exists a non-trivial superperfect normal subgroupP such thatG/P has cohomological dimension ≤2. In this case, any torsion inG must be inP.     

Mutually Independent Hamiltonian Connectivity of (n, k)-Star Graphs

A graph G is hamiltonian connected if there exists a hamiltonian path joining any two distinct nodes of G. Two hamiltonian paths and of G from u to v are independent if u = u ₁ = v ₁, v = u _v(G) = v _v(G) , and u _i ≠ v _i for every 1 < i < v(G). A set of hamiltonian paths, {P ₁, P ₂, . . . , P _k }, of G from u to v are mutually independent if any two different hamiltonian paths are independent from u to v. A graph is k mutually independent hamiltonian connected if for any two distinct nodes u and v, there are k mutually independent hamiltonian paths from u to v. The mutually independent hamiltonian connectivity of a graph G, IHP(G), is the maximum integer k such that G is k mutually independent hamiltonian connected. Let n and k be any two distinct positive integers with n–k ≥ 2. We use S _n,k to denote the (n, k)-star graph. In this paper, we prove that IHP(S _n,k ) = n–2 except for S _4,2 such that IHP(S _4,2) = 1.      

Finite dimensional representations and subgroup actions on homogeneous spaces

LetH be an ℝ-subgroup of a ℚ-algebraic groupG. We study the connection between the dynamics of the subgroup action ofH onG/G _ℤ and the representation-theoretic properties ofH being observable and epimorphic inG. We show that ifH is a ℚ-subgroup thenH is observable inG if and only if a certainH orbit is closed inG/G _ℤ; that ifH is epimorphic inG then the action ofH onG/G _ℤ is minimal, and that the converse holds whenH is a ℚ-subgroup ofG; and that ifH is a ℚ-subgroup ofG then the closure of the orbit underH of the identity coset image inG/G _ℤ is the orbit of the same point under the observable envelope ofH inG. Thus in subgroup actions on homogeneous spaces, closures of ‘rational orbits’ (orbits in which everything which can be defined over ℚ, is defined over ℚ) are always submanifolds.     

On the modality of parabolic subgroups of linear algebraic groups

For a linear algebraic group G over an algebraically closed field k and a parabolic subgroup P of G the modality of P is defined to be the maximal number of parameters upon which a family of G-orbits on Lie P _u depends and it is denoted by mod P, where P _u is the unipotent radical of P. The principal aim of this note is a generalization of two basic “monotonicity” results from [19] to positive characteristic: (1) If Θ is a semisimple automorphism of G and P is Θ-stable, then mod P ^\Θ≤ mod P. (2) If G is reductive, char k is a good prime for G, and H is a closed reductive subgroup of G normalized by a maximal torus T⊂P of G, then mod (P∩H)≤ mod P. Received: 22 April 1998 / Revised version: 3 July 1998     

Lefschetz fixed point theory on fibrations

For a fibre preserving map ϕ: E → E on a fibration (E, π, B), we construct a grading preserving map T(ϕ, π) between H*(E) and H*(B) that generalizes the Lefschetz number. If T(ϕ, π) is an isomorphism between H ⁰(E) and H ⁰(B), then π restricts to a surjective local diffeomorphism on each connected component of the fixed point set of ϕ under a transversality condition. This yields a characterization for the bundle H → G → G/H to be trivial when π ₁ (G/H) = 0.     

Gargano,Lewinter and Malerba问题的解

§1　IntroductionLet G be a graph with vertex-set V(G) ={ v1 ,v2 ,...,vn} .A labeling of G is a bijectionL:V(G)→{ 1,2 ,...,n} ,where L (vi) is the label of a vertex vi.A labeled graph is anordered pair (G,L) consisting of a graph G and its labeling L.Definition1.An increasing nonconsecutive path in a labeled graph(G,L) is a path(u1 ,u2 ,...,uk) in G such thatL(ui) + 1相似文献   

AF-Embedding of Crossed Products of Certain Graph C＊-algebras by Quasi-free Actions （II）

Let E be a row-finite directed graph, let G be a locally compact abelian group with dual group Ĝ = Γ, let ω be a labeling map from E* to Γ, and let (C*(E), G, α ^ω ) be the C*-dynamical system defined by ω. Some mappings concerning the AF-embedding construction of C*(E) ×_a^w GC*(E) \times _{\alpha ^\omega } G are studied in more detail. Several necessary conditions of AF-embedding and some properties of almost proper labeling map are obtained. Moreover it is proved that if E is constructed by attaching some 1-loops to a directed graph T consisting of some rooted directed trees and G is compact, then ω is almost proper, that is a sufficient condition for AF-embedding, if and only if Σ _j=1 ^k w_gj 1 1_G\omega _{\gamma _j } \ne 1_\Gamma for any loop γ _i , γ ₂, ..., γ _k attached to one path in T.     

On the structure of linear graphs

Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n ²/4]+1) contains a circuit ofl edges for every 3 ≦l<c ₂ n, also that everyG(n; [n ²/4]+1) contains ak _e(u _n, u_n) withu _n=[c ₁ logn] (for the definition ofk _e(u _n, u_n) see the introduction). Finally fort>t ₀ everyG(n; [tn ^3/2]) contains a circuit of 2l edges for 2≦l<c ₃ t ². This work was done while the author received support from the National Science Foundation, N.S.F. G.88.     

The Virtual Poincaré Polynomials of Homogeneous Spaces

We factor the virtual Poincaré polynomial of every homogeneous space G/H, where G is a complex connected linear algebraic group and H is an algebraic subgroup, as t^2u (t²–1)^r Q_G/H(t²) for a polynomial Q_G/H with nonnegative integer coefficients. Moreover, we show that Q_G/H(t²) divides the virtual Poincaré polynomial of every regular embedding of G/H, if H is connected.     

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.     

The Convexity Number of a Graph

 For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented. Received: August 19, 1998 Final version received: May 17, 2000     

Higher Chern Classes and Steenrod Operations in Motivic Cohomology

In this short paper we investigate the relation between higher Chern classes and reduced power operations in motivic cohomology. More precisely, we translate the well-known arguments [5] into the context of motivic cohomology and define higher Chern classes c_p,q : K _p(X) → H^2q-p (X,Z(q)) → H^2q-p(X, Z/l(q)), where X is a smooth scheme over the base field k, l is a prime number and char(k) ≠ l. The same approach produces the classes for K-theory with coefficients as well. Let further Pⁱ : H^m(X, Z/l(n)) → H^m+2i(l-1) (X, Z/l(n + i(l - 1))) denote the ith reduced power operation in motivic cohomology, constructed in [2]. The main result of the paper looks as follows.     

On degrees of maps between Grassmannians

Let G_n,k denote the oriented grassmann manifold of orientedk-planes in ℝⁿ. It is shown that for any continuous mapf: G_n,k → G_n,k, dim G_n,k = dim G_m,l = l(m −l), the Brouwer’s degree is zero, providedl > 1,n ≠ m. Similar results for continuous mapsg: ℂG_m,l → ℂG_n,k,h: ℍG_m,l → ℍG_n,k, 1 ≤ l < k ≤ n/2, k(n — k) = l(m — l) are also obtained.     

Unique ergodicity of flows on homogeneous spaces

LetG be a unimodular Lie group, Γ a co-compact discrete subgroup ofG and ‘a’ a semisimple element ofG. LetT _a be the mapgΓ →ag Γ:G/Γ →G/Γ. The following statements are pairwise equivalent: (1) (T _a, G/Γ,θ) is weak-mixing. (2) (T _a, G/Γ) is topologically weak-mixing. (3) (G ^u, G/Γ) is uniquely ergodic. (4) (G ^u, G/Γ,θ) is ergodic. (5) (G ^u, G/Γ) is point transitive. (6) (G ^u, G/Γ) is minimal. If in additionG is semisimple with finite center and no compact factors, then the statement “(T _a, G/Γ,θ) is ergodic” may be added to the above list. The authors were partially supported by NSF grant MCS 75-05250.     

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).     

Higher levels of ℤ/plℤ and period equations

We first study the d ^th levels of the finite prime fields ? _p . These are the numbers

On products of k atoms

Let H be an atomic monoid. For k ? \Bbb Nk \in {\Bbb N} let V_k (H){\cal V}_k (H) denote the set of all m ? \Bbb Nm \in {\Bbb N} with the following property: There exist atoms (irreducible elements) u ₁, …, u _k , v ₁, …, v _m ∈ H with u ₁· … · u _k = v ₁ · … · v _m . We show that for a large class of noetherian domains satisfying some natural finiteness conditions, the sets V_k (H){\cal V}_k (H) are almost arithmetical progressions. Suppose that H is a Krull monoid with finite cyclic class group G such that every class contains a prime (this includes the multiplicative monoids of rings of integers of algebraic number fields). We show that, for every k ? \Bbb Nk \in {\Bbb N}, max V_2k+1 (H) = k |G|+ 1{\cal V}_{2k+1} (H) = k \vert G\vert + 1 which settles Problem 38 in [4].     

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.     

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.