Lifting Modules with Indecomposable Decompositions

A module M is called a “lifting module” if, any submodule A of M contains a direct summand B of M such that A/B is small in M/B. This is a generalization of projective modules over perfect rings as well as the dual of extending modules. It is well known that an extending module with ascending chain condition (a.c.c.) on the annihilators of its elements is a direct sum of indecomposable modules. If and when a lifting module has such a decomposition is not known in general. In this article, among other results, we prove that a lifting module M is a direct sum of indecomposable modules if (i) rad(M ^(I)) is small in M ^(I) for every index set I, or, (ii) M has a.c.c. on the annihilators of (certain) elements, and rad(M) is small in M.     

Parabolic conjugacy in general linear groups

Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL _n (q). We show that the number of P(q)-conjugacy classes in GL _n (q) is, as a function of q, a polynomial in q with integer coefficients. This answers a question of Alperin in (Commun. Algebra 34(3): 889–891, 2006)     

On two classes of finite supersoluble groups

Let ? be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ?-S-semipermutable if H permutes with every Sylow p-subgroup of G in ? for all p?π(H); H is said to be ?-S-seminormal if it is normalized by every Sylow p-subgroup of G in ? for all p?π(H). The main aim of this paper is to characterize the ?-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ? are ?-S-semipermutable in G and the ?-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ? are ?-S-seminormal in G.     

Domination versus disjunctive domination in graphs

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, a set S of vertices in a graph G is a b-disjunctive dominating set in G if every vertex v not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it in G. The b-disjunctive domination number of G is the minimum cardinality of a b-disjunctive dominating set. In this paper, we continue the study of disjunctive domination in graphs. We present properties of b-disjunctive dominating sets in a graph. A characterization of minimal b-disjunctive dominating sets is given. We obtain bounds on the ratio of the domination number and the b-disjunctive domination number for various families of graphs, including regular graphs and trees.     

Associativity of the <Emphasis Type="Italic">∇</Emphasis>-operation on bands in rings

Given a multiplicative band of idempotents S in a ring R, for all e,f∈S the ∇-product e ∇ f=e+f+fe−efe−fef is an idempotent that lies roughly above e and f in R just as ef and fe lie roughly below e and f. In this paper we study ∇-bands in rings, that is, bands in rings that are closed under ∇, giving various criteria for ∇ to be associative, thus making the band a skew lattice. We also consider when a given band S in R generates a ∇-band.     

Trees with Equal Domination and Restrained Domination Numbers

Let G = (V,E) be a graph and let S V. The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), is the minimum cardinality of a DS of G, while the restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of a RDS of G. The graph G is γ-excellent if every vertex of G belongs to some minimum DS of G. A constructive characterization of trees with equal domination and restrained domination numbers is presented. As a consequence of this characterization we show that the following statements are equivalent: (i) T is a tree with γ(T)=γ_r(T); (ii) T is a γ-excellent tree and T ≠ K₂; and (iii) T is a tree that has a unique maximum packing and this set is a dominating set of T. We show that if T is a tree of order n with ℓ leaves, then γ_r(T) ≤ (n + ℓ + 1)/2, and we characterize those trees achieving equality.     

Integrally Closed Domains,Minimal Polynomials,and Null Ideals of Matrices

Abstract

We show that every element of the integral closure D′ of a domain D occurs as a coefficient of the minimal polynomial of a matrix with entries in D. This answers affirmatively a question of Brewer and Richman, namely, if integrally closed domains are characterized by the property that the minimal polynomial of every square matrix with entries in D is in D[x]. It follows that a domain D is integrally closed if and only if for every matrix A with entries in D the null ideal of A, N _D (A)?=?{f?∈?D[x]?∣?f(A)?=?0} is a principal ideal of D[x].     

On minimum secure dominating sets of graphs

A subset X of the vertex set of a graph G is a secure dominating set of G if X is a dominating set of G and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X/{v}) ? {u} is again a dominating set of G, in which case v is called a defender. The secure domination number of G is the cardinality of a smallest secure dominating set of G. In this paper, we show that every graph of minimum degree at least 2 possesses a minimum secure dominating set in which all vertices are defenders. We also characterise the classes of graphs that have secure domination numbers 1, 2 and 3.     

Associated Prime Submodules of Finitely Generated Modules

As generalizations of annihilators and associated primes, we introduce the notions of weak annihilators and weak associated primes, respectively. We first study the properties of the weak annihilator of a subset X in a ring R. We next investigate how the weak associated primes of a ring R behave under passage to the skew monoid ring R*M. Let R be a semicommutative ring, and M an ordered monoid and φ: M → Aut(R) a compatible monoid homomorphism. Then we can describe all weak associated primes of the skew monoid ring R*M in terms of the weak associated primes of R in a very straightforward way.     

Note on non-D-rings

Abstract

Recall that an integral domain R is said to be a non-D-ring if there exists a non-constant polynomial f (X) in R[X] (called a uv-polynomial) such that f (a) is a unit of R for every a in R. In this note we generalize this notion to commutative rings (that are not necessarily integral domains) as follows: for a positive integer n, we say that R is an n-non-D-ring if there exists a polynomial f of degree n in R[X] such that f (a) is a unit of R for every a in R. We then investigate the properties of this notion in di?erent contexts of commutative rings.     

An Optimal Multisecret Threshold Scheme Construction

A multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret s_K associated with every subset K of k participants such that any t participants in K can reconstruct the secret s_K, but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information. Communicated by: P. Wild     

Linear maps between C*-algebras that are *-homomorphisms at a fixed point

Let A and B be C*-algebras. A linear map T : A → B is said to be a *-homomorphism at an element z ∈ A if ab* = z in A implies T (ab*) = T (a)T (b)* = T (z), and c*d = z in A gives T (c*d) = T (c)*T (d) = T (z). Assuming that A is unital, we prove that every linear map T : A → B which is a *-homomorphism at the unit of A is a Jordan *-homomorphism. If A is simple and infinite, then we establish that a linear map T : A → B is a *-homomorphism if and only if T is a *-homomorphism at the unit of A. For a general unital C*-algebra A and a linear map T : A → B, we prove that T is a *-homomorphism if, and only if, T is a *-homomorphism at 0 and at 1. Actually if p is a non-zero projection in A, and T is a ^?-homomorphism at p and at 1 ? p, then we prove that T is a Jordan *-homomorphism. We also study bounded linear maps that are *-homomorphisms at a unitary element in A.     

CertainC*-algebras with real rank zero and their corona and multiplier algebras: II

We first determine the homotopy classes of nontrivial projections in a purely infinite simpleC*-algebraA, in the associated multiplier algebraM(A) and the corona algebraM A/A in terms ofK _*(A). Then we describe the generalized Fredholm indices as the group of homotopy classes of non-trivial projections ofA; consequently, we determine theK _*-groups of all hereditaryC*-subalgebras of certain corona algebras. Secondly, we consider a group structure of *-isomorphism classes of hereditaryC*-subalgebras of purely infinite simpleC*-algebras. In addition, we prove that ifA is aC*-algebra of real rank zero, then each unitary ofA, in caseA it unital, each unitary ofM(A) and ofM(A)/A, in caseA is nonunital but -unital, can be factored into a product of a unitary homotopic to the identity and a unitary matrix whose entries are all partial isometries (with respect to a decomposition of the identity).Partially supported by a grant from the National Science Foundation.     

PRIME IDEALS IN RINGS WITH INVOLUTION

Abstract

Let R be a ring with involution *. We show that if R is a *-prime ring which is not a prime ring, then R is “essentially” a direct product of two prime rings. Moreover, if P is a *-prime *-ideal of R, which is not a prime ideal of R, and X is minimal among prime ideals of R containing P, then P is a prime ideal of X, P = X ∩ X* and either: (1) P is essential in X and X is essential in R; or (2) for any relative complement C of P in X, then C* is a relative complement of X in R. Further characterizations of *-primeness are provided.     

c-Pancyclic Partial Ordering and （c-1）-Pan-Outpath Partial Ordering in Semicomplete Multipartite Digraphs

An outpath of a vertex v in a digraph is a path starting at v such that v dominates the end vertex of the path only if the end vertex also dominates v.First we show that letting D be a strongly connected semicomplete c-partite digraph (c≥3)1 and one of the partite sets of it consists of a single vertex, say v, then D has a c-pancyclic partial ordering from v, which generalizes a result about pancyclicity of multipartite tournaments obtained by Gutin in 1993.Then we prove that letting D be a strongly connected semicomplete c-partite digraph with c≥3 and letting v be a vertex of D,then Dhas a(c-1)-pan-outpath partly ordering from v.This result improves a theorem about outpaths in semicomplete multipartite digraphs obtained by Guo in 1999.     

Unique Node Extremal Subgroups in Chevalley Groups

Abstract

Taking G to be a Chevalley group of rank at least 3 and U to be the unipotent radical of a Borel subgroup B,an extremal subgroup A is an abelian normal subgroup of U which is not contained in the intersection of all the unipotent radicals of the rank 1 parabolic subgroups of G containing B. If there is an unique rank 1 parabolic subgroup P of G containing B with the property that A is not contained in the unipotent radical of P,then A is called a unique node extremal subgroup. In this paper we investigate the embedding of unique node extremal subgroups in U and prove that,apart from some specified cases,such a subgroup is contained in the unipotent radical of a certain maximal parabolic subgroup.     

On categories associated to a Quasi-Hopf algebra

A quasi-Hopf algebra H can be seen as a commutative algebra A in the center 𝒵(H-Mod) of H-Mod. We show that the category of A-modules in 𝒵(H-Mod) is equivalent (as a monoidal category) to H-Mod. This can be regarded as a generalization of the structure theorem of Hopf bimodules of a Hopf algebra to the quasi-Hopf setting.     

The vertex-cover polynomial of a graph

In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τ^r in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f⁻¹(x)f⁻¹(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ).     

Limiting -subgradient characterizations of constrained best approximation

In this paper, we show that the strong conical hull intersection property (CHIP) completely characterizes the best approximation to any x in a Hilbert space X from the set

K:=C∩{xX:-g(x)S},