Rate of convergence in a class of singular perturbations

Let V_?, W_?, W and X be Hilbert spaces (0 < ? ? 1) with V_? ? W_? ? W ? X algebraically and topologically, each space being dense in the one that follows it. For each t? [0, T] let a_?(t; u, v), b_?(t; u, v) and b(t; u, v) be continuous sesqui-linear forms on V_?, W_? and W, respectively, which satisfy certain ellipticity conditions. Consider the two equations a_?(t; u_?, v) + b_?(t; u_?, v) = 〈f_?, v〉 (v?V_?) and (u′, v)_x + b(t; u, v) = 〈f, v〉 (v?W). Estimates are obtained on the rate of convergence of u_? to u, assuming a_?(t; u, v) → (u, v)_x and b_?(t; u, v) → b(t; u, v) in an appropriate sense. These results are then applied to singular perturbation of a class of parabolic boundary value problems.     

The fractional chromatic number, the Hall ratio, and the lexicographic product

Let χ_f denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographic product of G and H be denoted GlexH. Main results: (i) ρ(GlexH)≤χ_f(G)ρ(H); (ii) if ρ(G)=χ_f(G) then ρ(GlexH)=ρ(G)ρ(H) for all H; (iii) χ_f−ρ is unbounded. In addition, the question of how big χ_f/ρ can be is discussed.     

Some representations of solutions of elliptic equations

The Dirichlet problem for the region of the plane inside closed smooth curve C for second-order elliptic equations is considered. It is shown that under certain circumstances the solution u can be written uniquely in the form u(P) = ∝_cF(P, Q) g(Q) ds_Q, where F(P, Q) is the fundamental solution of the elliptic equation, and g?L² if the boundary value function f is absolutely continuous with square integrable derivative (f?W); and u(P) = p(F(P, ·)) where p is a unique bounded linear functional on W if f?L². These representations are valid in the exterior of C also. As special cases with slight modifications, the exterior Dirichlet problems for the Helmholtz and Laplace equations are mentioned.It is shown also that if kernel F(P′, Q), with P′ and Q on C, has a complete set of eigenfunctions {ψ_k(P′)} then u(P) can be expanded in a series of their extensions {ψ_k(P)}, where ψ_k(P) = λ_k ∝_cF(P, Q) ψ_k(Q) ds_Q.     

An explicit expression for the cost of a class of Huffman trees

Let T_n denote a binary tree with n terminal nodes V={υ₁,…,υ_n} and let l_i denote the path length from the root to υ_i. Consider a set of nonnegative numbers W={w₁,…,w_n} and for a permutation π of {1,…,n} to {1,…,n}, associate the weight w_i to the node υ_π(i). The cost of T_n is defined as C(T_n∣W)=Min_π∑ⁿ_i=1w_il_π(i).A Huffman tree H_n is a binary tree which minimizes C(T_n∣W) over all possible T_n. In this note, we give an explicit expression for C(H_n∣W) when W assumes the form: w_i=k for i=1,…,n?m; w_i=x for i=n?m+1,…,n. This simplifies and generalizes earlier results in the literature.     

An improvement of Montel's criterion

Let F be a family of holomorphic functions in a domain D, and let a(z), b(z) be two holomorphic functions in D such that a(z)?b(z), and a(z)?a^′(z) or b(z)?b^′(z). In this paper, we prove that: if, for each f∈F, f(z)−a(z) and f(z)−b(z) have no common zeros, f^′(z)=a(z) whenever f(z)=a(z), and f^′(z)=b(z) whenever f(z)=b(z) in D, then F is normal in D. This result improves and generalizes the classical Montel's normality criterion, and the related results of Pang, Fang and the first author. Some examples are given to show the sharpness of our result.     

Commuting and centralizing generalized derivations on lie ideals in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, U the Utumi quotient ring of R, C the extended centroid of R, and L a noncentral Lie ideal of R. If F and G are generalized derivations of R and k ≥1 a fixed integer such that [F(x), x] _k x ? x[G(x), x] _k = 0 for any x ∈ L, then one of the following holds:

1. either there exists an a ∈ U and an α ∈ C such that F(x) = xa and G(x) = (a + α)x for all x ∈ R
2. or R satisfies the standard identity s ₄(x ₁, …, x ₄) and one of the following conclusions occurs

1. there exist a, b, c, q ∈ U, such that a ?b + c ?q ∈ C and F(x) = ax + xb, G(x) = cx + xq for all x ∈ R
2. there exist a, b, c ∈ U and a derivation d of U such that F(x) = ax+d(x) andG(x) = bx+xc?d(x) for all x ∈ R, with a + b ? c ∈ C.

     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

Oscillatory and asymptotic behavior of solutions of differential equations with deviating arguments

The oscillatory and asymptotic behavior of solutions of a class of nth order nonlinear differential equations, with deviating arguments, of the form (E, δ) L_nx(t) + δq(t) f(x[g₁(t)],…, x[g_m(t)]) = 0, where δ = ± 1 and L₀x(t) = x(t), L_kx(t) = a_k(t)(L_{k ? 1}x(t))^., $\text{k = 1, 2,…, n (}{}^{\mathrm{.}}\text{=}\text{d}\text{dt}\text{)}$, is examined. A classification of solutions of (E, δ) with respect to their behavior as t → ∞ and their oscillatory character is obtained. The comparisons of (E, 1) and (E, ?1) with first and second order equations of the form y^.(t) + c₁(t) f(y[g₁(t)],…, y[g_m(t)]) = 0 and (a_{n ? 1}(t)z^.(t))^. ? c₂(t) f(z[g₁(t)],…, z[g_m(t)]) = 0, respectively, are presented. The obtained results unify, extend and improve some of the results by Graef, Grammatikopoulos and Spikes, Philos and Staikos.     

The Galois representations associated to a Drinfeld module in special characteristic—III: Image of the group ring

Let K be a finitely generated field of transcendence degree 1 over a finite field, and set G_K?Gal(K^sep/K). Let φ be a Drinfeld A-module over K in special characteristic. Set E?End_K(φ) and let Z be its center. We show that for almost all primes p of A, the image of the group ring A_p[G_K] in End_A(T_p(φ)) is the commutant of E. Thus, for almost all p it is a full matrix ring over Z⊗_AA_p. In the special case E=A it follows that the representation of G_K on the p-torsion points φ[p] is absolutely irreducible for almost all p.     

An explicit model of default time with given survival probability

For a given filtered probability space (Ω,F,P), an F-adapted continuous increasing process Λ and a positive P-F local martingale N such that Λ₀=0 and N_te^−Λ_t≤1, we construct a probability measure Q^Z and a random time τ such that Q|_F∞=P|_F∞ and Q[τ>t|F_t]=Z_t. The probability Q^Z is linked with the well-known Cox model by an explicit density function. Various properties exist, which characterize Q^Z from others. Let G=(G_t)_t≥0 with G_t=F_t∨σ({τ≤s}:s≤t). We establish the (H^′)-property between the filtrations F and G, and we provide the enlargement of filtration formula.     

On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v_i and v_j in V(G) of G, recall that G+v_iv_j is the supergraph formed from G by adding an edge between vertices v_i and v_j. Denote the Harary index of G and G+v_iv_j by H(G) and H(G+v_iv_j), respectively. We obtain lower and upper bounds on H(G+v_iv_j)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.     

Covering shadows with a smaller volume

For n?2 a construction is given for convex bodies K and L in Rn such that the orthogonal projection Lu onto the subspace u^⊥ contains a translate of Ku for every direction u, while the volumes of K and L satisfy Vn(K)>Vn(L).A more general construction is then given for n-dimensional convex bodies K and L such that each orthogonal projection Lξ onto a k-dimensional subspace ξ contains a translate of Kξ, while the mth intrinsic volumes of K and L satisfy Vm(K)>Vm(L) for all m>k.For each k=1,…,n, we then define the collection Cn,k to be the closure (under the Hausdorff topology) of all Blaschke combinations of suitably defined cylinder sets (prisms).It is subsequently shown that, if L∈Cn,k, and if the orthogonal projection Lξ contains a translate of Kξ for every k-dimensional subspace ξ of Rn, then Vn(K)?Vn(L).The families Cn,k, called k-cylinder bodies of Rn, form a strictly increasing chain

Cn,1⊂Cn,2⊂?⊂Cn,n−1⊂Cn,n,     

Bitableau bases for Garsia-Haiman modules of hollow type

Garsia-Haiman modules C[Xn,Yn]/Iγ are quotient rings in the variables Xn={x₁,x₂,…,xn} and Yn={y₁,y₂,…,yn} that generalize the quotient ring C[Xn]/I, where I is the ideal generated by the elementary symmetric polynomials ej(Xn) for 1?j?n. A bitableau basis for the Garsia-Haiman modules of hollow type is constructed. Applications of this basis to representation theory and other related polynomial spaces are considered.     

A closure concept in factor-critical graphs

A graph G is called n-factor-critical if the removal of every set of n vertices results in a~graph with a~1-factor. We prove the following theorem: Let G be a~graph and let x be a~locally n-connected vertex. Let {u,v} be a~pair of vertices in V(G)−{x} such that uv∉E(G), x∈N_G(u)∩N_G(v), and N_G(x)⊂N_G(u)∪N_G(v)∪{u,v}. Then G is n-factor-critical if and only if G+uv is n-factor-critical.     

More on the generalized Macaulay theorem

Let k₁ ? k₂ ? … ? k_n be given positive integers and let F denote the set of vectors (l₁, …, l_n) with integer components satisfying 0 ? l_i ? k_i, i = 1, 2, …, n. If H is a subset of F, let (l)H denote the subset of H consisting of those vectors with component sum l, and let C((l)H) denote the smallest [(l)H] elements of (l)F. The generalized Macaulay theorem due to the author and B. Lindström [3] shows that |Gamma;((C)(l)(H)|, ? |Γ(C((l)H))|, where Γ((l)H) is the setof vectors in F obtainable by subtracting l from a single component of a vector in (l)H. A method is given for computing [Γ(C((l)H)] in this paper. It is analogous to the method for computing |Γ(C(l)H))| in the k₁ = … = k_n = 1 case which has been given independently by Katona [4] and Kruskal [5].     

[r,s,t]-Coloring of K n,n

Let G=(V(G),E(G)) be a simple graph. Given non-negative integers r,s, and t, an [r,s,t]-coloring of G is a mapping c from V(G)∪E(G) to the color set {0,1,…,k?1} such that |c(v _i )?c(v _j )|≥r for every two adjacent vertices v _i ,v _j , |c(e _i )?c(e _j )|≥s for every two adjacent edges e _i ,e _j , and |c(v _i )?c(e _j )|≥t for all pairs of incident vertices and edges, respectively. The [r,s,t]-chromatic number χ _r,s,t (G) of G is defined to be the minimum k such that G admits an [r,s,t]-coloring. We determine χ _r,s,t (K _n,n ) in all cases.     

Disjoint triangles and quadrilaterals in a graph

Let G be a simple graph of order n and s and k be two positive integers. Brandt et al. obtained the following result: If s?k, n?3s+4(k-s) and σ₂(G)?n+s, then G contains k disjoint cycles C₁,…,C_k satisfying |C_i|=3 for 1?i?s and |C_i|?4 for s<i?k. In the above result, the length of C_i is not specified for s<i?k. We get a result specifying the length of C_i for each s<i?k if n?3s+4(k-s)+3.     

Optimality conditions for fractional minmax programming

Let V ?H be real separable Hilbert spaces. The abstract wave equation u′' + A(t)u = g(u), where u(t) ?V, A(t) maps V to its dual $\text{V}{}^1$, and g is a nonlinear map from the ball S(R₀) = {u?V: ∥u∥ < R₀} into H, is considered. It is assumed that g is locally Lipschitz in S(R₀) and possibly singular at the boundary. Local existence and continuation theorems are established for the Cauchy problem u(0) = u₀?S(R₀), u′(0) = u₁?H. Global existence is shown for g(u) = εφ(u), where φ has a potential and ε is small. Global nonexistence is shown for g(u) = εφ(u), where φ satisfies an abstract convexity property and ε is large.