Path numbers of tournaments

A family of simple (that is, cycle-free) paths is a path decomposition of a tournament T if and only if partitions the acrs of T. The path number of T, denoted pn(T), is the minimum value of | | over all path decompositions of T. In this paper it is shown that if n is even, then there is a tournament on n vertices with path number k if and only if n/2 k n²/4, k an integer. It is also shown that if n is odd and T is a tournament on n vertices, then (n + 1)/2 pn(T) (n² − 1)/4. Moreover, if k is an integer satisfying (i) (n + 1)/2 k n − 1 or (ii) n < k (n² − 1)/4 and k is even, then a tournament on n vertices having path number k is constructed. It is conjectured that there are no tournaments of odd order n with odd path number k for n k < (n² − 1)/4.     

Characterizations of schunck classes of finite groups

We prove a number of results concerning Armendariz rings and Gaussian rings. Recall that a (commutative) ring R is (Gaussian) Armendariz if for two polynomials f,g∈R[X] (the ideal of R generated by the coefficients of f g is the product of the ideals generated by the coefficients of f and g) fg = 0 implies a _i b _j=0 for each coefficient a _i of f and b _j of g. A number of examples of Armendariz rings are given. We show that R Armendariz implies that R[X] is Armendariz and that for R von Neumann regularR is Armendariz if and only if R is reduced. We show that R is Gaussian if and only if each homomorphic image of R is Armendariz. Characterizations of when R[X] and R[X] are Gaussian are given.     

Amenability of the Second Dual of Hypergroup Algebras

The amenability of the Banach algebra L ¹(G), the measure algebra M(G) and their second duals of a locally compact group have been considered by a number of authors. During these investigations it has been shown that L ¹(G)^** is amenable if and only if G is finite. If LUC (G)^*, the dual of the space of left uniformly continuous functions on G, is amenable, then G is compact and M(G) is amenable. Finally, if M(G)^** is amenable, then G is finite. The aim of this paper is to generalize all of the above results to the locally compact hypergroups.     

Properties of a certain product of submodules

Let R be a commutative ring with identity, let M be an R-module, and let K ₁, . . . ,K _n be submodules of M: We construct an algebraic object called the product of K ₁, . . . ,K _n : This structure is equipped with appropriate operations to get an R(M)-module. It is shown that the R(M)-module M ⁿ   = M . . .M and the R-module M inherit some of the most important properties of each other. Thus, it is shown that M is a projective (flat) R-module if and only if M ⁿ is a projective (flat) R(M)-module.     

The rank of a completion of a dedekind domain

Let D be a Dedekind domain with quotient field K. Let C_p be the completion of the localisationD_p , of D at a nonzero prime idealp, of D. Let r_p be the rank of C_p as a D-module, ier_p , is the dimension of the K-vector space K_p , = K? _DC_p . The following results on r_p are deduced from well-known theorems: if r_p is finite for at least one prime ideal p, then D is a discrete valuation ring; and D = C_p if _p = 1. If D is a discrete valuation ring, then r_p = dimExt(K, D) + 1. A module M is extensionless if every extension of M by M splits. The D-module r_C is an estensionless indecomposable module. If r_C is infinite for every nonzero prime ideal, it is shown that an estensionless D-module of finite rank is a direct sum or certain rank one modulcs.     

Invariant curves and boundedness of solutions of a class of reversible systems

In this paper, the boundedness of all solutions for the following planar reversible system Ju ′ = ?H (u) + G (u) + h (t) (1) is discussed, where the function H (u) ∈ C²(?², ?⁺) is positive for u ≠ 0 and positively (q, p)‐quasihomogeneous of quasi‐degree pq, G ∈ C⁵ is bounded, h ∈ C⁶ is 2π ‐periodic and J is the standard symplectic matrix. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The existence of howell designs of siden+1 and order 2n

AHowell design of side s andorder 2n, or more briefly, anH(s, 2n), is ans×s array in which each cell either is empty or contains an unordered pair of elements from some 2n-set, sayX, such that (a) each row and each column is Latin (that is, every element ofX is in precisely one cell of each row and each column) and (b) every unordered pair of elements fromX is in at most one cell of the array. Atrivial Howell design is anH(s, 0) havingX=? and consisting of ans×s array of empty cells. A necessary condition onn ands for the existence of a nontrivialH(s, 2n) is that 0<n≦s≦2n-1. AnH(n+t, 2n) is said to contain a maximum trivial subdesign if somet×t subarray is theH(t, 0). This paper describes a recursive construction for Howell designs containing maximum trivial subdesigns and applies it to settle the existence question forH(n+1, 2n)’s: forn+1 a positive integer, there is anH(n+1, 2n) if and only ifn+1 ∉ {2, 3, 5}.     

Undirected power graphs of semigroups

The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,b∈S are adjacent if and only if a≠b and a ^m =b or b ^m =a for some positive integer m. In this paper we characterize the class of semigroups S for which G(S) is connected or complete. As a consequence we prove that G(G) is connected for any finite group G and G(G) is complete if and only if G is a cyclic group of order 1 or p ^m . Particular attention is given to the multiplicative semigroup ℤ _n and its subgroup U _n , where G(U _n ) is a major component of G(ℤ _n ). It is proved that G(U _n ) is complete if and only if n=1,2,4,p or 2p, where p is a Fermat prime. In general, we compute the number of edges of G(G) for a finite group G and apply this result to determine the values of n for which G(U _n ) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, G(G) is Hamiltonian and list some values of n for which G(U _n ) has no Hamiltonian cycle.     

Properties of Hadamard product of inverse M‐matrices

This paper concerns with the properties of Hadamard product of inverse M‐matrices. Structures of tridiagonal inverse M‐matrices and Hessenberg inverse M‐matrices are analysed. It is proved that the product A ○ A^T satisfies Willoughby's necessary conditions for being an inverse M‐matrix when A is an irreducible inverse M‐matrix. It is also proved that when A is either a Hessenberg inverse M‐matrix or a tridiagonal inverse M‐matrix then A ○ A^T is an inverse M‐matrix. Based on these results, the conjecture that A ○ A^T is an inverse M‐matrix when A is an inverse M‐matrix is made. Unfortunately, the conjecture is not true. Copyright © 2004 John Wiley Sons, Ltd.     

Retracts of hypercubes

An induced subgraph G of a graph H is a retract of H if there is an edge-preserving map f from H onto G such that f|_G is the identity map on G. A median graph is a connected graph such that for any three vertices u,v and w, there exists a unique vertex x which lies simultaneously on some shortest (u,v)-, (v,w)-, and (w,u)-paths. It is shown that a graph G is a retract of some hypercube if and only if G is a median graph.     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

On the admissibility of finite groups over global fields of finite characteristic

Let k be a global field of characteristic p. A finite group G is called k-admissible if there exists a division algebra finite dimensional and central over k which is a crossed product for G. Let G be a finite group with normal Sylow p-subgroup P. If the factor group G/P is k-admissible, then G is k-admissible. A necessary condition is given for a group to be k-admissible: if a finite group G is k-admissible, then every Sylow l-subgroup of G for l ≠ p is metacyclic with some additional restriction. Then it is proved that a metacyclic group G generated by x and y is k-admissible if some relation between x and y is satisfied.     

A property of weighted graphs without induced cycles of nonpositive weights

It has been conjectured [B. Xu, On signed cycle domination in graphs, Discrete Math. 309 (4) (2009) 1007–1012] that if there is a mapping from the edge set of a 2-connected graph G to {−1,1} such that for each induced subgraph, that is a cycle, the sum of all numbers assigned to its edges by this mapping is positive, then the number of all those edges of G to which 1 is assigned, is more than the number of all other edges of G. This conjecture follows from the main result of this note: If a mapping assigns integers as weights to the edges of a 2-connected graphGsuch that for each edge, its weight is not more than 1 and for each cycle which is an induced subgraph ofG, the sum of all weights of its edges is positive, then the sum of all weights of the edges ofGalso is positive. A simple corollary of this result is the following: If?is a mapping from the edge set of a 2-connected graphGto a set of real numbers such that for each cycleCofG, ∑_e∈E(C)?(e)>0, then∑_e∈E(G)?(e)also is positive.     

A Class of Quasipolar Rings

An element a of a ring R is called J-quasipolar if there exists p ² = p ∈ R satisfying p ∈ comm²(a) and a + p ∈ J(R); R is called J-quasipolar in case each of its elements is J-quasipolar. The class of this sort of rings lies properly between the class of uniquely clean rings and the class of quasipolar rings. In particular, every J-quasipolar element in a ring is quasipolar. It is shown, in this paper, that a ring R is J-quasipolar iff R/J(R) is boolean and R is quasipolar. For a local ring R, we prove that every n × n upper triangular matrix ring over R is J-quasipolar iff R is uniquely bleached and R/J(R) ? ?₂. Moreover, it is proved that any matrix ring of size greater than 1 is never J-quasipolar. Consequently, we determine when a 2 × 2 matrix over a commutative local ring is J-quasipolar. A criterion in terms of solvability of the characteristic equation is obtained for such a matrix to be J-quasipolar.     

The ratio of the distance irredundance and domination numbers of a graph

Let n ≥ 1 be an integer and let G be a graph. A set D of vertices in G is defined to be an n-dominating set of G if every vertex of G is within distance n from some vertex of D. The minimum cardinality among all n-dominating sets of G is called the n-domination number of G and is denoted by γ_n(G). A set / of vertices in G is n-irredundant if for every vertex x ∈ / there exists a vertex y that is within distance n from x but at distance greater than n from every vertex of / - {x}. The n-irredundance number of G, denoted by ir_n(G), is the minimum cardinality taken over all maximal n-irredundant sets of vertices of G. We show that inf{ir_n(G)/γ_n(G) | G is an arbitrary finite undirected graph with neither loops nor multiple edges} = 1/2 with the infimum not being attained. Subsequently, we show that 2/3 is a lower bound on all quotients ir_n(T)/γ_n(T) in which T is a tree. Furthermore, we show that, for n ≥ 2, this bound is sharp. These results extend those of R. B. Allan and R.C. Laskar [“On Domination and Some Related Concepts in Graph Theory,” Utilitas Mathematica, Vol. 21 (1978), pp. 43–56], B. Bollobás and E. J. Cockayne [“Graph-Theoretic Parameters Concerning Domination, Independence and Irredundance,” Journal of Graph Theory, Vol. 3 (1979), pp. 241–249], and P. Damaschke [Irredundance Number versus Domination Number, Discrete Mathematics, Vol. 89 (1991), pp. 101–104].     

Dominating sets of the comaximal and ideal-based zero-divisor graphs of commutative rings

Abstract

Let R be a commutative ring with nonzero identity, and let I be an ideal of R. The ideal-based zero-divisor graph of R, denoted by Γ_I (R), is the graph whose vertices are the set {x ∈ R \ I| xy ∈ I for some y∈ R \ I} and two distinct vertices x and y are adjacent if and only if xy ∈ I. Define the comaximal graph of R, denoted by CG(R), to be a graph whose vertices are the elements of R, where two distinct vertices a and b are adjacent if and only if Ra+Rb=R. A nonempty set S ? V of a graph G=(V, E) is a dominating set of G if every vertex in V is either in S or is adjacent to a vertex in S. The domination number γ(G) of G is the minimum cardinality among the dominating sets of G. The main object of this paper is to study the dominating sets and domination number of Γ_I (R) and the comaximal graph CG₂(R) \ J (R) (or CGJ (R) for short) where CG₂(R) is the subgraph of CG(R) induced on the nonunit elements of R and J (R) is the Jacobson radical of R.     

On zero-divisors of near-rings of polynomials

In this paper, we are interested to study zero-divisor properties of a 0-symmetric nearring of polynomials R₀[x], when R is a commutative ring. We show that for a reduced ring R, the set of all zero-divisors of R₀[x], namely Z(R₀[x]), is an ideal of R₀[x] if and only if Z(R) is an ideal of R and R has Property (A). For a non-reduced ring R, it is shown that Z(R₀[x]) is an ideal of Z(R₀[x]) if and only if ann_R({a, b}) ∩ N i?(R) ≠ 0, for each a, b ∈ Z(R). We also investigate the interplay between the algebraic properties of a 0-symmetric nearring of polynomials R₀[x] and the graph-theoretic properties of its zero-divisor graph. The undirected zero-divisor graph of R₀[x] is the graph Γ(R₀[x]) such that the vertices of Γ(R₀[x]) are all the non-zero zero-divisors of R₀[x] and two distinct vertices f and g are connected by an edge if and only if f ? g = 0 or g ? f = 0. Among other results, we give a complete characterization of the possible diameters of Γ(R₀[x]) in terms of the ideals of R. These results are somewhat surprising since, in contrast to the polynomial ring case, the near-ring of polynomials has substitution for its “multiplication” operation.     

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.     

On the normalizer of finitely generated subgroups of absolute galois groups of uncountable hilbertian fields of characteristic 0

For a fieldK and a positive integere let N _e (K) be the set of alle-tuplesσ = (σ ₁, …,σ _e)εG(K) ^e that generate a selfnormalizer closed subgroup ofG(K). Chatzidakis proved, that ifK is Hilbertian and countable, then N _e (K) has Haar measure 1. IfK is Hilbertian and uncountable, this need not be the case. Indeed, we prove that ifK ₀ is a field of characteristic 0 that contains all roots of unity,T is a set of cardinality ℵ₁ which is algebraically independent overK ₀ andK =K ₀(T), then neither N _e (K) nor its complement contain a set of positive measure. In particular N _e (K) is a nonmeasurable set. This work was partially supported by an NSF grant #DMS-H603187, while the second author enjoyed the hospitality of Rutgers University.     

Nilpotency of finite groups with Frobenius groups of automorphisms

Suppose that a finite group G admits a Frobenius group of automorphisms BC of coprime order with kernel B and complement C such that C _G (C) is abelian. It is proved that if B is abelian of rank at least two and [C_G(u), C_G(v),...,C_G(v)]=1{[C_G(u), C_G(v),\dots,C_G(v)]=1} for any u,v ? B\{1}{u,v\in B{\setminus}\{1\}}, where C _G (v) is repeated k times, then G is nilpotent of class bounded in terms of k and |C| only. It is also proved that if B is abelian of rank at least three and C _G (b) is nilpotent of class at most c for every b ? B\{1}{b \in B{\setminus}\{1\}}, then G is nilpotent of class bounded in terms of c and |C|. The proofs are based on results on graded Lie rings with many commuting components.