A generalization of Brauer''s map of decomposition

We first reformulate Quillen's localization theorem forG-theory in complicial bi-Waldhausen category setting. Secondly, because of this reformulation, we are able to generalize Brauer's decomposition mapd ₀:G ₀(KG)G ₀(kG) to higherG-theory leveld _n :G _n (KG)G _n (kG),n=0, 1 ..., whereG is a finite group,R a Dedekind domain,m a maximal ideal ofR,K=quotient field ofR andk=R/m.     

Commutative rings whose zero-divisor graph is a proper refinement of a star graph

A graph is called a proper refinement of a star graph if it is a refinement of a star graph, but it is neither a star graph nor a complete graph. For a refinement of a star graph G with center c, let G _c ^* be the subgraph of G induced on the vertex set V (G)\ {c or end vertices adjacent to c}. In this paper, we study the isomorphic classification of some finite commutative local rings R by investigating their zero-divisor graphs G = Γ(R), which is a proper refinement of a star graph with exactly one center c. We determine all finite commutative local rings R such that G _c ^* has at least two connected components. We prove that the diameter of the induced graph G _c ^* is two if Z(R)² ≠ {0}, Z(R)³ = {0} and G _c ^* is connected. We determine the structure of R which has two distinct nonadjacent vertices α, β ∈ Z(R)* \ {c} such that the ideal [N(α) ∩ N(β)]∪ {0} is generated by only one element of Z(R)*\{c}. We also completely determine the correspondence between commutative rings and finite complete graphs K _n with some end vertices adjacent to a single vertex of K _n .     

On subgroups of the general linear group that contain a maximal nonsplit torus

The paper deals with the structure of intermediate subgroups of the general linear group GL(n, k) of degree n over a field k of odd characteristic that contain a nonsplit maximal torus related to a radical extension of degree n of the ground field k. The structure of ideal nets over a ring that determine the structure of intermediate subgroups containinga transvection is given. Let K = k( ⁿ?{d} ) K = k\left( {\sqrt[n]{d}} \right) be a radical degree-n extension of a field k of odd characteristic, and let T =(d) be a nonsplit maximal torus, which is the image of the multiplicative group of the field K under the regular embedding in G =GL(n, k). In the paper, the structure of intermediate subgroups H, T ≤ H ≤ G, that contain a transvection is studied. The elements of the matrices in the torus T = T (d) generate a subring R(d) in the field k.Let R be an intermediate subring, R(d) ⊆ R ⊆ k, d ∈ R. Let σ_R denote the net in which the ideal dR stands on the principal diagonal and above it and all entries of which beneath the principal diagonal are equal to R. Let σ^R denote the net in which all positions on the principal diagonal and beneath it are occupied by R and all entries above the principal diagonal are equal to dR. Let E(σ_R) be the subgroup generated by all transvections from the net group G(σ_R). In the paper it is proved that the product TE(σ_R) is a group (and thus an intermediate subgroup). If the net σ associated with an intermediate subgroup H coincides with σ_R,then TE(σ_R) ≤ H ≤ N(σ_R),where N(σ_R) is the normalizer of the elementary net group E(σ_R) in G. For the normalizer N(σ_R),the formula N(σ_R)= TG(σ^R) holds. In particular, this result enables one to describe the maximal intermediate subgroups. Bibliography: 13 titles.     

The structure of injective covers of special modules

In this paper, we prove that the injective cover of theR-moduleE(R/B)/R/B for a prime ideal B ofR is the direct sum of copies ofE(R/B) for prime ideals D ⊃ B, and if B is maximal, the injective cover is a finite sum of copies ofE(R/B). For a finitely generatedR-moduleM withn generators andG an injectiveR-module, we argue that the natural mapG ⁿ →G ⁿ/Hom _R (M, G) is an injective precover if Ext _R ¹ (M, R) = 0, and that the converse holds ifG is an injective cogenerator ofR. Consequently, for a maximal ideal R ofR, depth_R R ≧ 2 if and only if the natural mapE(R/R) →E(R/R)/R/R is an injective cover and depth_R R > 0.     

The cotype constant and an almost euclidean decomposition for finite-dimensional normed spaces

Every 2n-dimensional normed spaceE contains twon-dimensional subspacesE ₁ andE ₂ which are orthogonal with respect to the inner product induced by the John ellipsoid ofE and which satisfyd(E _i, l ₂ ⁿ )≦f(K ₂(E)), wheref(K ₂(E)) is some number that depends only on the cotype constant ofE, denotedK ₂(E). Supported in part by NSF grant DMS 8401906.     

On the average distance property and certain energy integrals

One of our main results is the following: LetX be a compact connected subset of the Euclidean spaceR ⁿ andr(X, d ₂) the rendezvous number ofX, whered ₂ denotes the Euclidean distance inR ⁿ . (The rendezvous numberr(X, d ₂) is the unique positive real number with the property that for each positive integern and for all (not necessarily distinct)x ₁,x ₂,...,x _n inX, there exists somex inX such that .) Then there exists some regular Borel probability measure μ₀ onX such that the value of ∫ _X d ₂(x, y)dμ₀ (y) is independent of the choicex inX, if and only ifr(X, d ₂) = sup_μ ∫ _X ∫ _X d ₂(x, y)dμ(x)dμ(y), where the supremum is taken over all regular Borel probability measures μ onX.     

On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph

 Let G be a 2-connected graph with maximum degree Δ (G)≥d, and let x and y be distinct vertices of G. Let W be a subset of V(G)−{x, y} with cardinality at most d−1. Suppose that max{d _G(u), d _G(v)}≥d for every pair of vertices u and v in V(G)−({x, y}∪W) with d _G(u,v)=2. Then x and y are connected by a path of length at least d−|W|. Received: February 5, 1998 Revised: April 13, 1998     

On 2-Detour Subgraphs of the Hypercube

A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y ∈ V(G), d _H (x, y) ≤ d _G (x, y) + 2. We prove a conjecture of Erdős, Hamburger, Pippert, and Weakley by showing that for some positive constant c and every n, each 2-detour subgraph of the n-dimensional hypercube Q _n has at least clog₂ n · 2 ⁿ edges. József Balogh: Research supported in part by NSF grants DMS-0302804, DMS-0603769 and DMS-0600303, UIUC Campus Reseach Board #06139 and #07048, and OTKA 049398. Alexandr Kostochka: Research supported in part by NSF grants DMS-0400498 and DMS-0650784, and grant 06-01-00694 of the Russian Foundation for Basic Research.     

Automorphism group of exceptional symmetric domains RVI

Here we give the definition of the exceptional symmetric Siegel domain R_VI(27) in C²⁷, and compute the exceptional symmetric domain ℛ_VI(27) = τ(R_VI(27)), where t is the Bergman mapping of the Siegel domainR _VI (27). Moreover, we present the holomorphical automorphism group Aut (ℛ_VI(27)) of the exceptional symmetric domain (ℛ_VI(27)).     

Topological *-algebras withC*-enveloping algebras II

UniversalC*-algebrasC*(A) exist for certain topological *-algebras called algebras with aC*-enveloping algebra. A Frechet *-algebraA has aC*-enveloping algebra if and only if every operator representation ofA mapsA into bounded operators. This is proved by showing that every unbounded operator representation π, continuous in the uniform topology, of a topological *-algebraA, which is an inverse limit of Banach *-algebras, is a direct sum of bounded operator representations, thereby factoring through the enveloping pro-C*-algebraE(A) ofA. Given aC*-dynamical system (G,A,α), any topological *-algebraB containingC _c (G,A) as a dense *-subalgebra and contained in the crossed productC*-algebraC*(G,A,α) satisfiesE(B) =C*(G,A,α). IfG = ℝ, ifB is an α-invariant dense Frechet *-subalgebra ofA such thatE(B) =A, and if the action α onB ism-tempered, smooth and by continuous *-automorphisms: then the smooth Schwartz crossed productS(ℝ,B,α) satisfiesE(S(ℝ,B,α)) =C*(ℝ,A,α). WhenG is a Lie group, theC ^∞-elementsC ^∞(A), the analytic elementsC ^ω(A) as well as the entire analytic elementsC ^є(A) carry natural topologies making them algebras with aC*-enveloping algebra. Given a non-unitalC*-algebraA, an inductive system of idealsI _α is constructed satisfyingA =C*-ind limI _α; and the locally convex inductive limit ind limI _α is anm-convex algebra with theC*-enveloping algebraA and containing the Pedersen idealK _a ofA. Given generatorsG with weakly Banach admissible relationsR, we construct universal topological *-algebraA(G, R) and show that it has aC*-enveloping algebra if and only if (G, R) isC*-admissible.     

One sufficient condition for Hamiltonian graphs involving distances

In 1990 G. T. Chen proved that if G is a 2-connected graph of order n and 2|N(x) ∪ N(y)| + d(x) + d(y) ≥ 2n − 1 for each pair of nonadjacent vertices x, y ∈ V (G), then G is Hamiltonian. In this paper we prove that if G is a 2-connected graph of order n and 2|N(x) ∪ N(y)| + d(x)+d(y) ≥ 2n−1 for each pair of nonadjacent vertices x, y ∈ V (G) such that d(x, y) = 2, then G is Hamiltonian.     

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

Vertex pancyclicity and new sufficient conditions

For a graph G, ??(G) denotes the minimum degree of G. In 1971, Bondy proved that, if G is a 2-connected graph of order n and d(x)?+?d(y)????n for each pair of non-adjacent vertices x,y in G, then G is pancyclic or G?=?K _n/2,n/2. In 2001, Xu proved that, if G is a 2-connected graph of order n????6 and |N(x)????N(y)|?+???(G)????n for each pair of non-adjacent vertices x,y in G, then G is pancyclic or G?=?K _n/2,n/2. In this paper, we introduce a new sufficient condition of generalizing degree sum and neighborhood union and prove that, if G is a 2-connected graph of order n????6 and |N(x)????N(y)|?+?d(w)????n for any three vertices x,y,w of d(x,y)?=?2 and wx or $wy\not\in E(G)$ in G, then G is 4-vertex pancyclic or G belongs to two classes of well-structured exceptional graphs. This result also generalizes the above results.     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

X-inner automorphisms of crossed products and semi-invariants of Hopf algebras

LetR*G be a crossed product of the groupG over the prime ringR and assume thatR*G is also prime. In this paper we study unitsq in the Martindale ring of quotientsQ ₀(R*G) which normalize bothR and the group of trivial units ofR*G. We obtain quite detailed information on their structure. We then study the group ofX-inner automorphisms ofR*G induced by such elements. We show in fact that this group is fairly close to the group of automorphisms ofR*G induced by certain trivial units inQ ₀(R)*G. As an application we specialize to the case whereR=U(L) is the enveloping algebra of a Lie algebraL. Here we study the semi-invariants forL andG which are contained inQ ₀(R*G) and we obtain results which extend known properties ofU(L). Finally, every cocommutative Hopf algebraH over an algebraically closed field of characteristic 0 is of the formH=U(L)*G. Thus we also obtain information on the semi-invariants forH contained inQ ₀(H). Research supported in part by N.S.F. Grant Nos. MCS 83-01393 and MCS 82-19678.     

The Decomposition Dimension of Graphs

 For an ordered k-decomposition ? = {G ₁, G ₂,…,G _k } of a connected graph G and an edge e of G, the ?-representation of e is the k-tuple r(e|?) = (d(e, G ₁), d(e, G ₂),…,d(e, G _k )), where d(e, G _i ) is the distance from e to G _i . A decomposition ? is resolving if every two distinct edges of G have distinct representations. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dec(G). It is shown that for every two positive integers k and n≥ 2, there exists a tree T of order n with dec(T) = k. It is also shown that dec(G) ≤n for every graph G of order n≥ 3 and that dec(K _n ) ≤⌊(2n + 5)/3⌋ for n≥ 3. Received: June 17, 1998 Final version received: August 10, 1999     

Automorphism group of exceptional symmetric domainsRV

The exceptional symmetric Siegel domainR _v(16) in ℂ¹⁶ is defined. The exceptional classical domain ℛ_v(16) = t(R_v(16)) is computed, where t is the Bergman mapping of the Siegel domain R_v(16). And holomorphical automorphism group Aut (R_v(16)) of the exceptional symmetric Siegel domainR _v(16) is presented     

Ordering connected graphs having small degree distances

The concept of degree distance of a connected graph G is a variation of the well-known Wiener index, in which the degrees of vertices are also involved. It is defined by D^′(G)=∑_x∈V(G)d(x)∑_y∈V(G)d(x,y), where d(x) and d(x,y) are the degree of x and the distance between x and y, respectively. In this paper it is proved that connected graphs of order n≥4 having the smallest degree distances are K_1,n−1,BS(n−3,1) and K_1,n−1+e (in this order), where BS(n−3,1) denotes the bistar consisting of vertex disjoint stars K_1,n−3 and K_1,1 with central vertices joined by an edge.