Circular Chromatic Number and Mycielski Graphs

As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by ^*(G). Later, Zhu called it circular chromatic number and denoted it by _c(G). Let (G) be the chromatic number of G. In this paper, it is shown that if the complement of G is non-hamiltonian, then _c(G)=(G). Denote by M(G) the Mycielski graph of G. Recursively define M^m(G)=M(M^m–1(G)). It was conjectured that if mn–2, then _c(M^m(K_n))=(M^m(K_n)). Suppose that G is a graph on n vertices. We prove that if , then _c(M(G))=(M(G)). Let S be the set of vertices of degree n–1 in G. It is proved that if |S| 3, then _c(M(G))=(M(G)), and if |S| 5, then _c(M²(G))=(M²(G)), which implies the known results of Chang, Huang, and Zhu that if n3, _c(M(K_n))=(M(K_n)), and if n5, then _c(M²(K_n))=(M²(K_n)).* Research supported by Grants from National Science Foundation of China and Chinese Academy of Sciences.     

Classification of Morse-Smale diffeomorphisms with one-dimensional set of unstable separatrices

Let M ⁿ be a closed orientable manifold of dimension n > 3. We study the class G ₁(M ⁿ ) of orientation-preserving Morse-Smale diffeomorphisms of M ⁿ such that the set of unstable separatrices of any f ∈ G ₁(M ⁿ ) is one-dimensional and does not contain heteroclinic intersections. We prove that the Peixoto graph (equipped with an automorphism) is a complete topological invariant for diffeomorphisms of class G ₁(M ⁿ ), and construct a standard representative for any class of topologically conjugate diffeomorphisms.     

The connectivity threshold for the min‐degree random graph process

Let ??_n = {G_min(n, M)}_M≥0 denote a min‐degree random multigraph process in which G_min(n, M + 1) is obtained from G_min(n, M) by connecting a randomly chosen vertex of a minimum degree with another vertex of the multigraph. We study the probability that the random multigraph G_min(n, M) is connected. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Effect of the initial estimator on the asymptotic behavior of one-step M-estimator

For a general (real) parameter, let M _nbe the M-estimator and M _n ⁽¹⁾ be its one-step version (based on a suitable initial estimator M _n ⁽⁰⁾). It is known that, under certain regularity conditions, n(M _n ⁽¹⁾-M _n)=O _p(1). The asymptotic distribution of n(M _n ⁽¹⁾-M _n) is studied; it is typically non-normal and it reveals the role of the initial estimator M _n ⁽⁰⁾.Work of this author was partially supported by the Office of Naval Research, Contract No. N00014-83-K-0387     

Inverse-preserving Linear Maps Between Spaces of Matrices over Fields

Suppose F is a field different from F2, the field with two elements. Let Mn（F） and Sn（F） be the space of n × n full matrices and the space of n ×n symmetric matrices over F, respectively. For any G1, G2 ∈ {Sn（F）, Mn（F）}, we say that a linear map f from G1 to G2 is inverse-preserving if f（X）^-1 = f（X^-1） for every invertible X ∈ G1. Let L （G1, G2） denote the set of all inverse-preserving linear maps from G1 to G2. In this paper the sets .L（Sn（F）,Mn（F））, L（Sn（F）,Sn（F））, L （Mn（F）,Mn（F）） and L（Mn （F）, Sn （F）） are characterized.     

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.     

Cycles in a random graph near the critical point

Let G(n, M) be a graph chosen at random from the family of all labelled graphs with n vertices and M(n) = 0.5n + s(n) edges, where s³(n)n^?2→∞ but s(n) = o(n). We find the limit distribution of the length of shortest cycle contained in the largest component of G(n, M), as well as of the longest cycle outside it. We also describe the block structure of G(n, M) and derive from this result the limit probability that G(n, M) contains a cycle with a diagonal. Finally, we show that the probability tending to 1 as n-→∞ the length of the longest cycle in G(n, M) is of the order s²(n)/n.     

On simple modules and normal subgroups of p-solvable groups

Let N be a normal subgroup of a p-solvable group G and let M be a simple FN-module, where F is an algebraically closed field of characteristic p. Next, denote by IRR⁰(FG|M) the set of all simple FG-modules V lying over M such that the p-part of dim_F V is as small as possible. In this paper, |IRR⁰(FG|M)| and the vertices of modules in IRR⁰(FG|M) are determined. The p-blocks of G to which modules in IRR⁰(FG|M) belong are also determined.Received: 5 December 2003     

Finite Groups with S-permutable n-maximal Subgroups

Let G be a finite group and M _n (G) be the set of n-maximal subgroups of G, where n is an arbitrary given positive integer. Suppose that M _n (G) contains a nonidentity member and all members in M _n (G) are S-permutable in G. Then any of of the following conditions guarantees the supersolvability of G: (1) M _n (G) contains a nonidentity member whose order is not a prime; (2) all nonidentity members in M _n (G) are of prime order, and all cyclic members in M _n?1(G) of order 4 are S-permutable in G.     

Isometric immersions with homothetical Gauss map

Let f:M be an isometric immersion of an m-dimensional Riemannian manifold M into the n-dimensional Euclidean space. Its Gauss map g:MG _m ( ⁿ ) into the Grassmannian G _m ( ⁿ ) is defined by assigning to every point of M its tangent space, considered as a vector subspace of ⁿ . The third fundamental form b of f is the pull-back of the canonical Riemannian metric on G _m ( ⁿ ) via g. In this article we derive a complete classification of all those f (with flat normal bundle) for which the Gauss map g is homothetical; i.e. b is a constant multiple of the Riemannian metric on M. Using these results we furthermore classify all those f (with flat normal bundle) for which the third fundamental form b is parallel w.r.t. the Levi-Civita connection on M.     

A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

There exist graphs with super‐exponential Ramsey multiplicity constant

The Ramsey multiplicity M(G;n) of a graph G is the minimum number of monochromatic copies of G over all 2‐colorings of the edges of the complete graph K_n. For a graph G with a automorphisms, ν vertices, and E edges, it is natural to define the Ramsey multiplicity constant C(G) to be , which is the limit of the fraction of the total number of copies of G which must be monochromatic in a 2‐coloring of the edges of K_n. In 1980, Burr and Rosta showed that 0 ≥ C(G) ≤ 2^1?E for all graphs G, and conjectured that this upper bound is tight. Counterexamples of Burr and Rosta's conjecture were first found by Sidorenko and Thomason independently. Later, Clark proved that there are graphs G with E edges and 2^E?1C(G) arbitrarily small. We prove that for each positive integer E, there is a graph G with E edges and C(G) ≤ E^{?E/2 + o(E)}. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 89–98, 2008     

On the maximal subgroup of the sandwich semigroup of generalized circulant Boolean matrices

Let n be a positive integer, and C _n (r) the set of all n × n r-circulant matrices over the Boolean algebra B = {0, 1}, . For any fixed r-circulant matrix C (C ≠ 0) in G _n , we define an operation “*” in G _n as follows: A * B = ACB for any A, B in G _n , where ACB is the usual product of Boolean matrices. Then (G _n , *) is a semigroup. We denote this semigroup by G _n (C) and call it the sandwich semigroup of generalized circulant Boolean matrices with sandwich matrix C. Let F be an idempotent element in G _n (C) and M(F) the maximal subgroup in G _n (C) containing the idempotent element F. In this paper, the elements in M(F) are characterized and an algorithm to determine all the elements in M(F) is given.     

Steiner centers and Steiner medians of graphs

Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d_G(S) or d(S). The Steiner n-eccentricity e_n(v) and Steiner n-distance d_n(v) of a vertex v in G are defined as e_n(v)=max{d(S)| SV(G), |S|=n and vS} and d_n(v)=∑{d(S)| SV(G), |S|=n and vS}, respectively. The Steiner n-center C_n(G) of G is the subgraph induced by the vertices of minimum n-eccentricity. The Steiner n-median M_n(G) of G is the subgraph induced by those vertices with minimum Steiner n-distance. Let T be a tree. Oellermann and Tian [O.R. Oellermann, S. Tian, Steiner centers in graphs, J. Graph Theory 14 (1990) 585–597] showed that C_n(T) is contained in C_n+1(T) for all n2. Beineke et al. [L.W. Beineke, O.R. Oellermann, R.E. Pippert, On the Steiner median of a tree, Discrete Appl. Math. 68 (1996) 249–258] showed that M_n(T) is contained in M_n+1(T) for all n2. Then, Oellermann [O.R. Oellermann, On Steiner centers and Steiner medians of graphs, Networks 34 (1999) 258–263] asked whether these containment relationships hold for general graphs. In this note we show that for every n2 there is an infinite family of block graphs G for which C_n(G)C_n+1(G). We also show that for each n2 there is a distance–hereditary graph G such that M_n(G)M_n+1(G). Despite these negative examples, we prove that if G is a block graph then M_n(G) is contained in M_n+1(G) for all n2. Further, a linear time algorithm for finding the Steiner n-median of a block graph is presented and an efficient algorithm for finding the Steiner n-distances of all vertices in a block graph is described.     

Characterization of finite simple group <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(2)

Let G be a finite group, and let π _e (G) be the spectrum of G, that is, the set of all element orders of G. In 1987, Shi Wujie put forward the following conjecture. If G is a finite group and M is a non-abelian simple group, then G ≅ M if and only if |G| = |M| and π _e (G) = π _e (M). In this short paper, we prove that if G is a finite group, then G ≅ M if and only if |G| = |M| and π _e (G) = π _e (M), where M = D _n (2) and n is even.     

Matrix Near-rings over Centralizer Near-rings

For a finite group G and a subgroup A of Aut(G), let M_A(G) denote the centralizer near-ring determined by A and G. The group G is an M_A(G)-module. Using the action of M_A(G) on G, one has the n × n generalized matrix near-ring Mat_n(M_A(G);G). The correspondence between the ideals of M_A(G) and those of Mat_n(M_A(G);G) is investigated. It is shown that if every ideal of M_A(G) is an annihilator ideal, then there is a bijection between the ideals of M_A(G) and those of Mat_n(M_A(G);G).1991 Mathematics Subject Classification: 16Y30     

Weighted Polynomial Approximation in the Complex Plane

Given a pair (G,W) of an open bounded set G in the complex plane and a weight function W(z) which is analytic and different from zero in G , we consider the problem of the locally uniform approximation of any function f(z) , which is analytic in G , by weighted polynomials of the form {W ⁿ (z)P _n (z) } ^$\infinity$ _n=0 , where deg P_n n. The main result of this paper is a necessary and sufficient condition for such an approximation to be valid. We also consider a number of applications of this result to various classical weights, which give explicit criteria for these weighted approximations. May 1, 1996. Date revised: October 8, 1996.     

Preduals of semigroup algebras

For a locally compact group G, the measure convolution algebra M(G) carries a natural coproduct. In previous work, we showed that the canonical predual C ₀(G) of M(G) is the unique predual which makes both the product and the coproduct on M(G) weak^*-continuous. Given a discrete semigroup S, the convolution algebra ℓ ¹(S) also carries a coproduct. In this paper we examine preduals for ℓ ¹(S) making both the product and the coproduct weak^*-continuous. Under certain conditions on S, we show that ℓ ¹(S) has a unique such predual. Such S include the free semigroup on finitely many generators. In general, however, this need not be the case even for quite simple semigroups and we construct uncountably many such preduals on ℓ ¹(S) when S is either ℤ₊×ℤ or (ℕ,⋅).     

Abelian Group Gradings on Full Matrix Rings

For positive integers ? and n, several authors studied ?_?-gradings of the full matrix ring M _n (k) over a field k. In this article, we show that every (G × H)-grading of M _n (k) can be constructed by a pair of compatible G-grading and H-grading of M _n (k), where G and H are any finite groups. When G and H are finite cyclic groups, we characterize all (G × H)-gradings which are isomorphic to a good grading. Moreover, the results can be generalized for any finite abelian group grading of M _n (k).