Bounded factorization property for Fréchet spaces

An operator T ∈ L(E, F) factors over G if T = RS for some S ∈ L(E, G) and R ∈ L(G, F); the set of such operators is denoted by L^G(E, F). A triple (E, G, F) satisfies bounded factorization property (shortly, (E, G, F) ∈ ???) if L^G(E, F) ? LB(E, F), where LB(E, F) is the set of all bounded linear operators from E to F. The relationship (E, G, F) ∈ ??? is characterized in the spirit of Vogt's characterisation of the relationship L(E, F) = LB(E, F) [23]. For triples of K?othe spaces the property ??? is characterized in terms of their K?othe matrices. As an application we prove that in certain cases the relations L(E, G₁) = LB(E, G₁) and L(G₂, F) = LB(G₂, F) imply (E, G, F) ∈ ??? where G is a tensor product of G₁ and G₂.     

Biring Theory and Its Galois Theory of Rings

Biring theory is about birings (A, P), that is, algops (A, P) of an associative algebra A and (A, A)-biring P acting on A via a morphism γ: P → Pres _F A from P to the terminal (A, A)-biring Pres _F A of preservations of A. (The word biring is used in a theory for a structure with unit, product, counit, coproduct subject to conditions of the theory.) Biring theory has its central simple theory and its Galois theory of rings. Its Galois birings are the reduced simple birings.     

One-dimensional Tilings Using Tiles with Two Gap Lengths

Let n,p,k,q,l be positive integers with n=k+l+1. Let x₁,x₂, . . . ,x_n be a sequence of positive integers with x₁<x₂<···<x_n. A set {x₁,x₂, . . . ,x_n} is called a set of type (p,k;q,l) if the set of differences {x₂–x₁,x₃–x₂, . . . ,x_n–x_n–1} equals {p, . . . ,p,q, . . . ,q} as a multiset, where p and q appear k and l times, respectively. Among other results, it is shown that for any p,k,q, there exists a finite interval I in the set of integers such that I is partitioned into sets of type (p,k;q,1).     

A constructive approach for the lower bounds on the Ramsey numbers R (s,t)

Graph G is a (k, p)‐graph if G does not contain a complete graph on k vertices K_k, nor an independent set of order p. Given a (k, p)‐graph G and a (k, q)‐graph H, such that G and H contain an induced subgraph isomorphic to some K_k?1‐free graph M, we construct a (k, p + q ? 1)‐graph on n(G) + n(H) + n(M) vertices. This implies that R (k, p + q ? 1) ≥ R (k, p) + R (k, q) + n(M) ? 1, where R (s, t) is the classical two‐color Ramsey number. By applying this construction, and some its generalizations, we improve on 22 lower bounds for R (s, t), for various specific values of s and t. In particular, we obtain the following new lower bounds: R (4, 15) ≥ 153, R (6, 7) ≥ 111, R (6, 11) ≥ 253, R (7, 12) ≥ 416, and R (8, 13) ≥ 635. Most of the results did not require any use of computer algorithms. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 231–239, 2004     

Best proximity point theorems

Let us assume that A and B are non-empty subsets of a metric space. In view of the fact that a non-self mapping T:A?B does not necessarily have a fixed point, it is of considerable significance to explore the existence of an element x that is as close to Tx as possible. In other words, when the fixed point equation Tx=x has no solution, then it is attempted to determine an approximate solution x such that the error d(x,Tx) is minimum. Indeed, best proximity point theorems investigate the existence of such optimal approximate solutions, known as best proximity points, of the fixed point equation Tx=x when there is no solution. Because d(x,Tx) is at least d(A,B), a best proximity point theorem ascertains an absolute minimum of the error d(x,Tx) by stipulating an approximate solution x of the fixed point equation Tx=x to satisfy the condition that d(x,Tx)=d(A,B). This article establishes best proximity point theorems for proximal contractions, thereby extending Banach’s contraction principle to the case of non-self mappings.     

On Some Monogenic Semigroups with an Associate Subgroup

Let S be any semigroup and a, s ∈ S. If a = asa, then s is an associate of a. A subgroup G of S is an associate subgroup of S if every a ∈ S has a unique associate a* in G. It turns out that G = H _z for some idempotent z, the zenith of S. The mapping a → a* is a unary operation on S. We say that S is monogenic if S is generated, as a unary semigroup, by a single element.

We embark upon the problem of the structure of monogenic semigroups in this sense by characterizing monogenic ones belonging to completely simple semigroups, normal cryptogroups, orthogroups, combinatorial semigroups, cryptic medial semigroups, cryptic orthodox semigroups, and orthodox monoids. In each of these cases, except one, we construct a free object. The general problem remains open.     

Hall parameters of complete and complete bipartite graphs

Given a graph G, for each υ ∈V(G) let L(υ) be a list assignment to G. The well‐known choice number c(G) is the least integer j such that if |L(υ)| ≥j for all υ ∈V(G), then G has a proper vertex colouring ? with ?(υ) ∈ L (υ) (?υ ∈V(G)). The Hall number h(G) is like the choice number, except that an extra non‐triviality condition, called Hall's condition, has to be satisfied by the list assignment. The edge‐analogue of the Hall number is called the Hall index, h′(G), and the total analogue is called the total Hall number, h″(G), of G. If the stock of colours from which L(υ) is selected is restricted to a set of size k, then the analogous numbers are called k‐restricted, or restricted, Hall parameters, and are denoted by h_k(G), h′_k(G) and h″_k(G). Our main object in this article is to determine, or closely bound, h′(K), h″(K_n), h′(K_m,n) and h′_k(K_m,n). We also answer some hitherto unresolved questions about Hall parameters. We show in particular that there are examples of graphs G with h′(G)?h′(G ? e)>1. We show that there are examples of graphs G and induced subgraphs H with h_k(G)<h_k(H) [this phenomenon cannot occur with unrestricted Hall numbers]. We also give an example of a graph G and an integer k such that h_k(G)<χ(G)<h(G). © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 208–237, 2002     

On the acyclic choosability of graphs

A proper vertex coloring of a graph G = (V,E) is acyclic if G contains no bicolored cycle. A graph G is L‐list colorable if for a given list assignment L = {L(v): v ∈ V}, there exists a proper coloring c of G such that c (v) ∈ L(v) for all v ∈ V. If G is L‐list colorable for every list assignment with |L (v)| ≥ k for all v ∈ V, then G is said k‐choosable. A graph is said to be acyclically k‐choosable if the obtained coloring is acyclic. In this paper, we study the links between acyclic k‐choosability of G and Mad(G) defined as the maximum average degree of the subgraphs of G and give some observations about the relationship between acyclic coloring, choosability, and acyclic choosability. © 2005 Wiley Periodicals, Inc. J Graph Theory 51: 281–300, 2006     

List circular coloring of trees and cycles

Suppose G=(V, E) is a graph and p ≥ 2q are positive integers. A (p, q)‐coloring of G is a mapping ?: V → {0, 1, …, p‐1} such that for any edge xy of G, q ≤ |?(x)‐?(y)| ≤ p‐q. A color‐list is a mapping L: V → ({0, 1, …, p‐1}) which assigns to each vertex v a set L(v) of permissible colors. An L‐(p, q)‐coloring of G is a (p, q)‐coloring ? of G such that for each vertex v, ?(v) ∈ L(v). We say G is L‐(p, q)‐colorable if there exists an L‐(p, q)‐coloring of G. A color‐size‐list is a mapping ? which assigns to each vertex v a non‐negative integer ?(v). We say G is ?‐(p, q)‐colorable if for every color‐list L with |L(v)| = ?(v), G is L‐(p, q)‐colorable. In this article, we consider list circular coloring of trees and cycles. For any tree T and for any p ≥ 2q, we present a necessary and sufficient condition for T to be ?‐(p, q)‐colorable. For each cycle C and for each positive integer k, we present a condition on ? which is sufficient for C to be ?‐(2k+1, k)‐colorable, and the condition is sharp. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 249–265, 2007     

Multiplication Modules in Which Every Prime Submodule is Contained in a Unique Maximal Submodule

Abstract

Let R be a commutative ring. An R-module M is called a multiplication module if for each submodule N of M, N?=?IM for some ideal I of R. An R-module M is called a pm-module, i.e., M is pm, if every prime submodule of M is contained in a unique maximal submodule of M. In this paper the following results are obtained. (1) If R is pm, then any multiplication R-module M is pm. (2) If M is finitely generated, then M is a multiplication module if and only if Spec(M) is a spectral space if and only if Spec(M)?=?{PM?|?P?∈?Spec(R) and P???M ^⊥}. (3) If M is a finitely generated multiplication R-module, then: (i) M is pm if and only if Max(M) is a retract of Spec(M) if and only if Spec(M) is normal if and only if M is a weakly Gelfand module; (ii) M is a Gelfand module if and only if Mod(M) is normal. (4) If M is a multiplication R-module, then Spec(M) is normal if and only if Mod(M) is weakly normal.     

Brooks-type theorems for choosability with separation

We consider the following type of problems. Given a graph G = (V, E) and lists L(v) of allowed colors for its vertices v ∈ V such that |L(v)| = p for all v ∈ V and |L(u) ∩ L(v)| ≤ c for all uv ∈ E, is it possible to find a “list coloring,” i.e., a color f(v) ∈ L(v) for each v ∈ V, so that f(u) ≠ f(v) for all uv ∈ E? We prove that every of maximum degree Δ admits a list coloring for every such list assignment, provided p ≥ . Apart from a multiplicative constant, the result is tight, as lists of length may be necessary. Moreover, for G = K_n (the complete graph on n vertices) and c = 1 (i.e., almost disjoint lists), the smallest value of p is shown to have asymptotics (1 + o(1)) . For planar graphs and c = 1, lists of length 4 suffice. ˜© 1998 John Wiley & Sons, Inc. J Graph Theory 27: 43–49, 1998     

Necessary and sufficient condition in Lyapunov robust control: Multi-input case

We consider a linear time-invariant finite-dimensional system x=Ax+Bu with multi-inputu, in which the matricesA andB are in canonical controller form. We assume that the system is controllable andB has rankm. We study the Lyapunov equationPA+A ^T P+Q=0, withQ>0, and investigate the properties thatP must satisfy in order that the canonical controller matrixA be Hurwitz. We show that, for the matrixA being Hurwitz, it is necessary and sufficient thatB ^T PB>0 and that the determinant ofB ^T PW be Hurwitz, whereW=block diag[w ₁,...,w _m ], with elementw _i =[s ^k _i –1,s ^k _i –2,...,s, 1] ^T ; here, the symbolsk _i ,i=1, 2, ...,m, denote the Kronecker invariants with respect to the pair {A, B}. This result has application in designing robust controllers for linear uncertain systems.     

A note on the Picard bundle over a moduli space of vector bundles

Let ??(n , d ) be a coprime moduli space of stable vector bundles of rank n ≥ 2 and degree d over a complex irreducible smooth projective curve X of genus g ≥ 2 and ??_ξ ? ??(n , d ) a fixed determinant moduli space. Assuming that the degree d is sufficiently large, denote by ?? the vector bundle over X ×??(n , d ) defined by the kernel of the evaluation map H ⁰(X , E ) → E_x , where E ∈??(n , d ) and x ∈ X . We prove that ?? and its restriction ??_ξ to X × ??ξ are stable. The space of all infinitesimal deformations of ?? over X ×??(n , d ) is proved to be of dimension 3g and that of ??ξ over X × ??ξ of dimension 2g , assuming that g ≥ 3 and if g = 3 then n ≥ 4 and if g = 4 then n ≥ 3. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Applications of Duality to the Pure-injective Envelope

Given an R-T-bimodule _R K _T and R-S-bimodule _R M _S , we study how properties of _R K _T affect the K-double dual M** = Hom _T [Hom _R (M, K), K] considered as a right S-module. If _R K is a cogenerator, then for every R-S-bimodule, the natural morphism Φ _M : M → M** is a pure-monomorphism of right S-modules. If _R K is the minimal (injective) cogenerator and K _T is quasi-injective, then M ^** is a pure-injective right S-module. If _R K is the minimal (injective) cogenerator, and T = End _R K it is shown that K _T is quasi-injective if and only if the K-topology on R is linearly compact. If the _R K-topology on R is of finite type, then the natural morphism Φ _R : R → R** is the pure-injective envelope of R _R as a right module over itself. The author is partially supported by NSF Grant DMS-02-00698.     

Uniformly continuous superposition operators in the space of bounded variation functions

Let I, J ? ? be intervals. The main result says that if a superposition operator H generated by a function of two variables h: I × J → ?, H (φ)(x) ? h (x, φ (x)), maps the set BV (I, J) of all bounded variation functions, φ: I → J into the Banach space BV (I, ?) and is uniformly continuous with respect to the BV ‐norm, then h (x, y) = a (x)y + b (x), x ∈ I, y ∈ J, for some a, b ∈ BV (I, ?) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Odd‐angulated graphs and cancelling factors in box products

Under what conditions is it true that if there is a graph homomorphism G □ H → G □ T, then there is a graph homomorphism H→ T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2k + 1)‐angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)‐cycle. We call G strongly (2k + 1)‐angulated if every two vertices are connected by a sequence of (2k + 1)‐cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)‐angulated, H is any graph, S, T are graphs with odd girth at least 2k + 1, and ?: G□ H→S□T is a graph homomorphism, then either ? maps G□{h} to S□{t_h} for all h∈V(H) where t_h∈V(T) depends on h; or ? maps G□{h} to {s_h}□ T for all h∈V(H) where s_h∈V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:221‐238, 2008     

On the Dot Product Graph of a Commutative Ring

Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × … ×A (n times). The total dot product graph of R is the (undirected) graph TD(R) with vertices R* = R?{(0, 0,…, 0)}, and two distinct vertices x and y are adjacent if and only if x·y = 0 ∈ A (where x·y denote the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R)* = Z(R)?{(0, 0,…, 0)}. It follows that each edge (path) of the classical zero-divisor graph Γ(R) is an edge (path) of ZD(R). We observe that if n = 1, then TD(R) is a disconnected graph and ZD(R) is identical to the well-known zero-divisor graph of R in the sense of Beck–Anderson–Livingston, and hence it is connected. In this paper, we study both graphs TD(R) and ZD(R). For a commutative ring A and n ≥ 3, we show that TD(R) (ZD(R)) is connected with diameter two (at most three) and with girth three. Among other things, for n ≥ 2, we show that ZD(R) is identical to the zero-divisor graph of R if and only if either n = 2 and A is an integral domain or R is ring-isomorphic to ?₂ × ?₂ × ?₂.     

On the number of (r,r+1)‐ factors in an (r,r+1)‐factorization of a simple graph

For integers d≥0, s≥0, a (d, d+s)‐graph is a graph in which the degrees of all the vertices lie in the set {d, d+1, …, d+s}. For an integer r≥0, an (r, r+1)‐factor of a graph G is a spanning (r, r+1)‐subgraph of G. An (r, r+1)‐factorization of a graph G is the expression of G as the edge‐disjoint union of (r, r+1)‐factors. For integers r, s≥0, t≥1, let f(r, s, t) be the smallest integer such that, for each integer d≥f(r, s, t), each simple (d, d+s) ‐graph has an (r, r+1) ‐factorization with x (r, r+1) ‐factors for at least t different values of x. In this note we evaluate f(r, s, t). © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 257‐268, 2009     

Maximal L p regularity for parabolic difference equations

In this paper, we consider a family of finite difference operators {Ah }_{h >0} on discrete L _q ‐spaces L _q (?^N _h ). We show that the solution u _h to u ′_h (t) – A _h u _h(t) = f _h (t), t > 0, u _h (0) = 0 satisfies the estimate ‖A _h u _h ‖equation/tex2gif-inf-15.gif ≤ C ‖f _h ‖equation/tex2gif-inf-21.gif, where C is independent of h and f _h . In this case, the family {A _h }_{h >0} is said to have discrete maximal L _p regularity on the discrete L _q ‐space. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On low bound of degree sequences of spanning trees in K-edge-connected graphs

A graph G = (V, E) is k-edge-connected if for any subset E′ ⊆ E,|E′| < k, G − E′ is connected. A d_k-tree T of a connected graph G = (V, E) is a spanning tree satisfying that ∀v ∈ V, d_T(v) ≤ + α, where [·] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d_k-tree, and α = 1 for k = 2, α = 2 for k ≥ 3. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 87–95, 1998