Generalized skew derivations on triangular algebras determined by action on zero products

For a triangular algebra 𝒜 and an automorphism σ of 𝒜, we describe linear maps F,G:𝒜→𝒜 satisfying F(x)y+σ(x)G(y) = 0 whenever x,y∈𝒜 are such that xy = 0. In particular, when 𝒜 is a zero product determined triangular algebra, maps F and G satisfying the above condition are generalized skew derivations of the form F(x) = F(1)x+D(x) and G(x) = σ(x)G(1)+D(x) for all x∈𝒜, where D:𝒜→𝒜 is a skew derivation. When 𝒜 is not zero product determined, we show that there are also nonstandard solutions for maps F and G.     

Calculus of Functorial Morphisms

We prove that, if F, G: 𝒞 → 𝒟 are two right exact functors between two Grothendieck categories such that they commute with coproducts and U is a generator of 𝒞, then there is a bijection between Nat(F, G) and the centralizer of Hom_𝒟(F(U), G(U)) considered as an Hom_𝒞(U, U)-Hom_𝒞(U, U)-bimodule. We also prove a dual of this result and give applications to Frobenius functors between Grothendieck categories.     

On the rank spread of graphs

For a simple graph G?=?(𝒱, ?) with vertex-set 𝒱?=?{1,?…?,?n}, let 𝒮(G) be the set of all real symmetric n-by-n matrices whose graph is G. We present terminology linking established as well as new results related to the minimum rank problem, with spectral properties in graph theory. The minimum rank mr(G) of G is the smallest possible rank over all matrices in 𝒮(G). The rank spread r _v (G) of G at a vertex v, defined as mr(G)???mr(G???v), can take values ??∈?{0,?1,?2}. In general, distinct vertices in a graph may assume any of the three values. For ??=?0 or 1, there exist graphs with uniform r _v (G) (equal to the same integer at each vertex v). We show that only for ??=?0, will a single matrix A in 𝒮(G) determine when a graph has uniform rank spread. Moreover, a graph G, with vertices of rank spread zero or one only, is a λ-core graph for a λ-optimal matrix A in 𝒮(G). We also develop sufficient conditions for a vertex of rank spread zero or two and a necessary condition for a vertex of rank spread two.     

On the Commuting Graph of Dihedral Group

Let Γ be a non-abelian group and Ω ? Γ. We define the commuting graph G = 𝒞(Γ, Ω) with vertex set Ω and two distinct elements of Ω are joined by an edge when they commute in Γ. In this article, among some properties of commuting graphs, we investigate distant properties as well as detour distant properties of commuting graph on D_2n. We also study the metric dimension of commuting graph on D_2n and compute its resolving polynomial.     

An application of the Turán theorem to domination in graphs

A function f:V(G)→{+1,−1} defined on the vertices of a graph G is a signed dominating function if for any vertex v the sum of function values over its closed neighborhood is at least 1. The signed domination number γ_s(G) of G is the minimum weight of a signed dominating function on G. By simply changing “{+1,−1}” in the above definition to “{+1,0,−1}”, we can define the minus dominating function and the minus domination number of G. In this note, by applying the Turán theorem, we present sharp lower bounds on the signed domination number for a graph containing no (k+1)-cliques. As a result, we generalize a previous result due to Kang et al. on the minus domination number of k-partite graphs to graphs containing no (k+1)-cliques and characterize the extremal graphs.     

Noncyclic Graph of a Group

We associate a graph Γ _G to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ? G| 〈x, y〉 is cyclic for all y ? G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of Γ _G is finite if and only if Γ _G has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with Γ _G  ? Γ _H and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if Γ _G  ? Γ _H for some group H, then G ? H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if Γ _G  ? Γ _H for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.     

On graphs determining links with maximal number of components via medial construction

Let G be a connected plane graph, D(G) be the corresponding link diagram via medial construction, and μ(D(G)) be the number of components of the link diagram D(G). In this paper, we first provide an elementary proof that μ(D(G))≤n(G)+1, where n(G) is the nullity of G. Then we lay emphasis on the extremal graphs, i.e. the graphs with μ(D(G))=n(G)+1. An algorithm is given firstly to judge whether a graph is extremal or not, then we prove that all extremal graphs can be obtained from K₁ by applying two graph operations repeatedly. We also present a dual characterization of extremal graphs and finally we provide a simple criterion on structures of bridgeless extremal graphs.     

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

On the Diameter of a p-Regular Conjugacy Class Graph of Finite Groups II

Abstract

Let Gbe a finite p-solvable group. Let us consider the graph Γ* _p (G) whose vertices are the primes which occur as the divisors of the conjugacy classes of p-regular elements of G and two primes are joined by an edge if there exists such a class whose size is divisible by both primes. Suppose that Γ _p *(G) is a connected graph, then we prove that the diameter of this graph is at most 3 and this is the best bound.     

Nonlinear generalized Lie triple derivation on triangular algebras

Let ? be a commutative ring with identity and let 𝔄 = Tri(𝒜,?,?) be a triangular algebra consisting of unital algebras 𝒜,? over ? and an (𝒜,?)-bimodule ? which is faithful as a left 𝒜-module as well as a right ?-module. In this paper, we prove that under certain assumptions every nonlinear generalized Lie triple derivation G_L:𝔄→𝔄 is of the form G_L = δ+τ, where δ:𝔄→𝔄 is an additive generalized derivation on 𝔄 and τ is a mapping from 𝔄 into its center which annihilates all Lie triple products [[x,y],z].     

All hypoenergetic graphs with maximum degree at most 3

The energy E(G) of a graph G is defined as the sum of the absolute values of its eigenvalues. A connected graph G of order n is said to be hypoenergetic if E(G)<n. All connected hypoenergetic graphs with maximum degree Δ3 have been characterized. In addition to the four (earlier known) hypoenergetic trees, we now show that complete bipartite graph K_2,3 is the only hypoenergetic cycle-containing hypoenergetic graph. By this, the validity of a conjecture by Majstorović et al. has been confirmed.     

Induced disjoint paths problem in a planar digraph

As an extension of the disjoint paths problem, we introduce a new problem which we call the induced disjoint paths problem. In this problem we are given a graph G and a collection of vertex pairs {(s₁,t₁),…,(s_k,t_k)}. The objective is to find k paths P₁,…,P_k such that P_i is a path from s_i to t_i and P_i and P_j have neither common vertices nor adjacent vertices for any distinct i,j.The induced disjoint paths problem has several variants depending on whether k is a fixed constant or a part of the input, whether the graph is directed or undirected, and whether the graph is planar or not. We investigate the computational complexity of several variants of the induced disjoint paths problem. We show that the induced disjoint paths problem is (i) solvable in polynomial time when k is fixed and G is a directed (or undirected) planar graph, (ii) NP-hard when k=2 and G is an acyclic directed graph, (iii) NP-hard when k=2 and G is an undirected general graph.As an application of our first result, we show that we can find in polynomial time certain structures called a “hole” and a “theta” in a planar graph.     

Cluster-Tilted Algebras of Type D n

Let H be a hereditary algebra of Dynkin type D _n over a field k and 𝒞 _H be the cluster category of H. Assume that n ≥ 5 and that T and T′ are tilting objects in 𝒞 _H . We prove that the cluster-tilted algebra Γ = End_{𝒞 H} (T)^op is isomorphic to Γ′ = End_{𝒞 H} (T′)^op if and only if T = τ ⁱ T′ or T = στ ^j T′ for some integers i and j, where τ is the Auslander–Reiten translation and σ is the automorphism of 𝒞 _H defined in Section 4.     

Circular choosability of graphs

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) χ_{c, l}(G) of a graph G and prove that they are equivalent. Then we prove that for any graph G, χ_{c, l}(G) ≥ χ_l(G) ? 1. Examples are given to show that this bound is sharp in the sense that for any ? 0, there is a graph G with χ_{c, l}(G) > χ_l(G) ? 1 + ?. It is also proved that k‐degenerate graphs G have χ_{c, l}(G) ≤ 2k. This bound is also sharp: for each ? < 0, there is a k‐degenerate graph G with χ_{c, l}(G) ≥ 2k ? ?. This shows that χ_{c, l}(G) could be arbitrarily larger than χ_l(G). Finally we prove that if G has maximum degree k, then χ_{c, l}(G) ≤ k + 1. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 210–218, 2005     

TORSION THEORIES FOR FINITE VON NEUMANN ALGEBRAS

ABSTRACT

The study of modules over a finite von Neumann algebra 𝒜 can be advanced by the use of torsion theories. In this work, some torsion theories for 𝒜 are presented, compared, and studied. In particular, we prove that the torsion theory (T, P) (in which a module is torsion if it is zero-dimensional) is equal to both Lambek and Goldie torsion theories for 𝒜.

Using torsion theories, we describe the injective envelope of a finitely generated projective 𝒜-module and the inverse of the isomorphism K ₀(𝒜) → K ₀ (𝒰), where 𝒰 is the algebra of affiliated operators of 𝒜. Then the formula for computing the capacity of a finitely generated module is obtained. Lastly, we study the behavior of the torsion and torsion-free classes when passing from a subalgebra ? of a finite von Neumann algebra 𝒜 to 𝒜. With these results, we prove that the capacity is invariant under the induction of a ?-module.     

On finding the core of a tree with a specified length

A core of a graph G is a path P in G that is central with respect to the property of minizining d(P) = Σ_υεV(G)d(υ, P), where d(υ, P) is the distance from vertex υ to path P. This paper explores some properties of a core of a specified length.     

Commuting Graphs of Matrix Algebras

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all noncentral elements of R, and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this article we investigate some graph-theoretic properties of Γ(M _n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL _n (F) and SL _n (F). We show that Γ(M _n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL _n (F)) and Γ(SL _n (F)). Also we show that for two fields F and E and integers n, m ≥ 2, if Γ(M _n (F))?Γ(M _m (E)), then n = m and |F|=|E|.     

Finite Groups with a Disconnected p -Regular Conjugacy Class Graph

Abstract

Let G be a finite p-solvable group for a fixed prime p. Attach to G a graph Γ _p (G) whose vertices are the non-central p-regular conjugacy classes of G and connect two vertices by an edge if their cardinalities have a common prime divisor. In this note we study the structure and arithmetical properties of the p-regular class sizes in p-solvable groups G having Γ _p (G) disconnected.