Existence of positive solution for some class of nonlinear fractional differential equations

In this paper, we investigate the multiple and infinitely solvability of positive solutions for nonlinear fractional differential equation Du(t)=t^νf(u), 0<t<1, where D=t^−βδD_β^γ−δ,δ, β>0, γ?0, 0<δ<1, ν>−β(γ+1). Our main work is to deal with limit case of f(s)/s as s→0 or s→∞ and Φ(s)/s, Ψ(s)/s as s→0 or s→∞, where Φ(s), Ψ(s) are functions connected with function f. In J. Math. Appl. 252 (2000) 804-812, we consider the existence of a positive solution for the particular case of Eq. (1.1), i.e., the Riemann-Liouville type (β=1, γ=0) nonlinear fractional differential equation, using the super-lower solutions method. Here, we devote to the existence of positive solution and multi-positive solutions for Eq. (1.1) by means of the fixed point theorems for the cone.     

Upper bounds on the upper signed total domination number of graphs

Let G=(V,E) be a graph. A function f:V→{−1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. A signed total dominating function f is minimal if there does not exist a signed total dominating function g, f≠g, for which g(v)≤f(v) for every v∈V. The weight of a signed total dominating function is the sum of its function values over all vertices of G. The upper signed total domination number of G is the maximum weight of a minimal signed total dominating function on G. In this paper we present a sharp upper bound on the upper signed total domination number of an arbitrary graph. This result generalizes previous results for regular graphs and nearly regular graphs.     

Discriminant analysis for locally stationary processes

In this paper, we discuss discriminant analysis for locally stationary processes, which constitute a class of non-stationary processes. Consider the case where a locally stationary process {X_t,T} belongs to one of two categories described by two hypotheses π₁ and π₂. Here T is the length of the observed stretch. These hypotheses specify that {X_t,T} has time-varying spectral densities f(u,λ) and g(u,λ) under π₁ and π₂, respectively. Although Gaussianity of {X_t,T} is not assumed, we use a classification criterion D( f:g), which is an approximation of the Gaussian likelihood ratio for {X_t,T} between π₁ and π₂. Then it is shown that D( f:g) is consistent, i.e., the misclassification probabilities based on D( f:g) converge to zero as T→∞. Next, in the case when g(u,λ) is contiguous to f(u,λ), we evaluate the misclassification probabilities, and discuss non-Gaussian robustness of D( f:g). Because the spectra depend on time, the features of non-Gaussian robustness are different from those for stationary processes. It is also interesting to investigate the behavior of D( f:g) with respect to infinitesimal perturbations of the spectra. Introducing an influence function of D( f:g), we illuminate its infinitesimal behavior. Some numerical studies are given.     

Two problems on independent sets in graphs

Let i_t(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu have conjectured that for all bipartite G the sequence (i_t(G))_t≥0 (the independent set sequence of G) is unimodal. We provide evidence for this conjecture by showing that this is true for almost all equibipartite graphs. Specifically, we consider the random equibipartite graph G(n,n,p), and show that for any fixed p∈(0,1] its independent set sequence is almost surely unimodal, and moreover almost surely log-concave except perhaps for a vanishingly small initial segment of the sequence. We obtain similar results for .We also consider the problem of estimating i(G)=∑_t≥0i_t(G) for G in various families. We give a sharp upper bound on the number of independent sets in an n-vertex graph with minimum degree δ, for all fixed δ and sufficiently large n. Specifically, we show that the maximum is achieved uniquely by K_δ,n−δ, the complete bipartite graph with δ vertices in one partition class and n−δ in the other.We also present a weighted generalization: for all fixed x>0 and δ>0, as long as n=n(x,δ) is large enough, if G is a graph on n vertices with minimum degree δ then ∑_t≥0i_t(G)x^t≤∑_t≥0i_t(K_δ,n−δ)x^t with equality if and only if G=K_δ,n−δ.     

On Osgood theorem in Banach spaces

Let X be a real Banach space, ω : [0, +∞) → ? be an increasing continuous function such that ω(0) = 0 and ω(t + s) ≤ ω(t) + ω(s) for all t, s ∈ [0, +∞). According to the infinite dimensional analog of the Osgood theorem if ∫¹₀ (ω(t))^?1 dt = ∞, then for any (t₀, x₀) ∈ ?×X and any continuous map f : ?×X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all t ∈ ?, x, y ∈ X, the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has a unique solution in a neighborhood of t₀. We prove that if X has a complemented subspace with an unconditional Schauder basis and ∫¹₀ (ω(t))^?1 dt < ∞ then there exists a continuous map f : ? × X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all (t, x, y) ∈ ? × X × X and the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has no solutions in any interval of the real line.     

Ill-posed problems with unbounded operators

Let A be a linear, closed, densely defined unbounded operator in a Hilbert space. Assume that A is not boundedly invertible. If Eq. (1) Au=f is solvable, and ‖fδ−f‖?δ, then the following results are provided: Problem Fδ(u):=‖Au−fδ^‖2+α‖u^‖2 has a unique global minimizer uα,δ for any fδ, uα,δ=A^*−1(AA^*+αI)fδ. There is a function α=α(δ), limδ→0α(δ)=0 such that limδ→0‖uα(δ),δ−y‖=0, where y is the unique minimal-norm solution to (1). A priori and a posteriori choices of α(δ) are given. Dynamical Systems Method (DSM) is justified for Eq. (1).     

Coloring graphs from random lists of size 2

Let G=G(n) be a graph on n vertices with girth at least g and maximum degree bounded by some absolute constant Δ. Assign to each vertex v of G a list L(v) of colors by choosing each list independently and uniformly at random from all 2-subsets of a color set C of size σ(n). In this paper we determine, for each fixed g and growing n, the asymptotic probability of the existence of a proper coloring φ such that φ(v)∈L(v) for all v∈V(G). In particular, we show that if g is odd and σ(n)=ω(n^1/(2g−2)), then the probability that G has a proper coloring from such a random list assignment tends to 1 as n→∞. Furthermore, we show that this is best possible in the sense that for each fixed odd g and each n≥g, there is a graph H=H(n,g) with bounded maximum degree and girth g, such that if σ(n)=o(n^1/(2g−2)), then the probability that H has a proper coloring from such a random list assignment tends to 0 as n→∞. A corresponding result for graphs with bounded maximum degree and even girth is also given. Finally, by contrast, we show that for a complete graph on n vertices, the property of being colorable from random lists of size 2, where the lists are chosen uniformly at random from a color set of size σ(n), exhibits a sharp threshold at σ(n)=2n.     

Dimension,Graph and Hypergraph Coloring

There is a natural way to associate with a poset P a hypergraph H _P, called the hypergraph of incomparable pairs, so that the dimension of P is the chromatic number of H _P. The ordinary graph G _P of incomparable pairs determined by the edges in H _P of size 2 can have chromatic number substantially less than H _P. We give a new proof of the fact that the dimension of P is 2 if and only if G _P is bipartite. We also show that for each t 2, there exists a poset P _t for which the chromatic number of the graph of incomparable pairs of P _t is at most 3 t – 4, but the dimension of P _t is at least (3 / 2) ^{t – 1}. However, it is not known whether there is a function f: NN so that if P is a poset and the graph of incomparable pairs has chromatic number at most t, then the dimension of P is at most f(t).     

On a fractional partial differential equation with dominating linear part

It is proved that there is a (weak) solution of the equation u_t=a*u_xx+b*g(u_x)_x+f, on ℝ⁺ (where * denotes convolution over (−∞, t)) such that u_x is locally bounded. Emphasis is put on having the assumptions on the initial conditions as weak as possible. The kernels a and b are completely monotone and if a(t)=t^−α, b(t)=t^−β, and g(ξ)∼sign(ξ)∣ξ∣^γ for large ξ, then the main assumption is that α>(2γ+2)/(3γ+1)β+(2γ−2)/(3γ+1). © 1997 by B. G. Teubner Stuttgart–John Wiley & Sons Ltd.     

Norm-linear and norm-additive operators between uniform algebras

Let A⊂C(X) and B⊂C(Y) be uniform algebras with Choquet boundaries δA and δB. A map T:A→B is called norm-linear if ‖λTf+μTg‖=‖λf+μg‖; norm-additive, if ‖Tf+Tg‖=‖f+g‖, and norm-additive in modulus, if ‖|Tf|+|Tg|‖=‖|f|+|g|‖ for each λ,μ∈C and all algebra elements f and g. We show that for any norm-linear surjection T:A→B there exists a homeomorphism ψ:δA→δB such that |(Tf)(y)|=|f(ψ(y))| for every f∈A and y∈δB. Sufficient conditions for norm-additive and norm-linear surjections, not assumed a priori to be linear, or continuous, to be unital isometric algebra isomorphisms are given. We prove that any unital norm-linear surjection T for which T(i)=i, or which preserves the peripheral spectra of C-peaking functions of A, is a unital isometric algebra isomorphism. In particular, we show that if a linear operator between two uniform algebras, which is surjective and norm-preserving, is unital, or preserves the peripheral spectra of C-peaking functions, then it is automatically multiplicative and, in fact, an algebra isomorphism.     

Equitable colorings of Kronecker products of graphs

For a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→{1,2,…,k} such that f(x)≠f(y) whenever xy∈E(G) and ||f⁻¹(i)|−|f⁻¹(j)||≤1 for 1≤i<j≤k. The equitable chromatic number of a graph G, denoted by χ₌(G), is the minimum k such that G is equitably k-colorable. The equitable chromatic threshold of a graph G, denoted by , is the minimum t such that G is equitably k-colorable for k≥t. The current paper studies equitable chromatic numbers of Kronecker products of graphs. In particular, we give exact values or upper bounds on χ₌(G×H) and when G and H are complete graphs, bipartite graphs, paths or cycles.     

Concise proofs for adjacent vertex-distinguishing total colorings

Let G=(V,E) be a graph and f:(V∪E)→[k] be a proper total k-coloring of G. We say that f is an adjacent vertex- distinguishing total coloring if for any two adjacent vertices, the set of colors appearing on the vertex and incident edges are different. We call the smallest k for which such a coloring of G exists the adjacent vertex-distinguishing total chromatic number, and denote it by χ_at(G). Here we provide short proofs for an upper bound on the adjacent vertex-distinguishing total chromatic number of graphs of maximum degree three, and the exact values of χ_at(G) when G is a complete graph or a cycle.     

Dynamical systems method (DSM) for selfadjoint operators

Let A be a selfadjoint linear operator in a Hilbert space H. The DSM (dynamical systems method) for solving equation Av=f consists of solving the Cauchy problem , u(0)=u₀, where Φ is a suitable operator, and proving that (i) ∃u(t)∀t>0, (ii) ∃u(∞), and (iii) A(u(∞))=f. It is proved that if equation Av=f is solvable and u solves the problem , u(0)=u₀, where a>0 is a parameter and u₀ is arbitrary, then lima→0limt→∞u(t,a)=y, where y is the unique minimal-norm solution of the equation Av=f. Stable solution of the equation Av=f is constructed when the data are noisy, i.e., fδ is given in place of f, ‖fδ−f‖?δ. The case when a=a(t)>0, , a(t)↘0 as t→∞ is considered. It is proved that in this case limt→∞u(t)=y and if fδ is given in place of f, then limt→∞u(tδ)=y, where tδ is properly chosen.     

Parity vertex coloring of outerplane graphs

A proper vertex coloring of a 2-connected plane graph G is a parity vertex coloring if for each face f and each color c, the total number of vertices of color c incident with f is odd or zero. The minimum number of colors used in such a coloring of G is denoted by χ_p(G).In this paper we prove that χ_p(G)≤12 for every 2-connected outerplane graph G. We show that there is a 2-connected outerplane graph G such that χ_p(G)=10. If a 2-connected outerplane graph G is bipartite, then χ_p(G)≤8, moreover, this bound is best possible.     

Sparse <Emphasis Type="Italic">H</Emphasis>-Colourable Graphs of Bounded Maximum Degree

Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k¹³ such that G admits a surjective homomorphism c to F, and moreover, for any F-pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h=fc. As a consequence, we prove that if H is a projective graph of order k, then for any finite family of prescribed mappings from a set X to V(H) (with ||=t), there is a graph G of arbitrary large girth and of maximum degree at most 5k^26mt (where m=|X|) such that and up to an automorphism of H, there are exactly t homomorphisms from G to H, each of which is an extension of an f.Supported in part by the National Science Council under grant NSC89-2115-M-110-012Final version received: June 9, 2003     

An example concerning the zero set of the Jacobian

Let f∈W1,1(Ω,Rn) be a homeomorphism of finite distortion K. It is known that if K1/(n−1)∈L¹(Ω), then the Jacobian Jf of f is positive almost everywhere in Ω. We will show that this integrability assumption on K is sharp in any Orlicz-scale: if α is increasing function (satisfying minor technical assumptions) such that limt→∞α(t)=∞, then there exists f such that K1/(n−1)/α(K)∈L¹(Ω) and Jf vanishes in a set of positive measure.     

Roman and Total Domination

Abstract

A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number ^γt(G). A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u with f (u)=0 is adjacent to at least one vertex v of G for which f (v)=2. The minimum of f (V (G))=∑_{u ∈ V (G)} f (u) over all such functions is called the Roman domination number γR (G). We show that γt(G) ≤ γR (G) with equality if and only if ^γt(G)=2γ(G), where γ(G) is the domination number of G. Moreover, we characterize the extremal graphs for some graph families.     

Upper minus total domination in small-degree regular graphs

A function f:V(G)→{-1,0,1} defined on the vertices of a graph G is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF f is minimal if there does not exist an MTDF g:V(G)→{-1,0,1}, f≠g, for which g(v)?f(v) for every v∈V(G). The weight of an MTDF is the sum of its function values over all vertices. The minus total domination number of G is the minimum weight of an MTDF on G, while the upper minus domination number of G is the maximum weight of a minimal MTDF on G. In this paper we present upper bounds on the upper minus total domination number of a cubic graph and a 4-regular graph and characterize the regular graphs attaining these upper bounds.     

Constructions of bi-regular cages

Given three positive integers r,m and g, one interesting question is the following: What is the minimum number of vertices that a graph with prescribed degree set {r,m}, 2≤r<m, and girth g can have? Such a graph is called a bi-regular cage or an ({r,m};g)-cage, and its minimum order is denoted by n({r,m};g). In this paper we provide new upper bounds on n({r,m};g) for some related values of r and m. Moreover, if r−1 is a prime power, we construct the following bi-regular cages: ({r,k(r−1)};g)-cages for g∈{5,7,11} and k≥2 even; and ({r,kr};6)-cages for k≥2 any integer. The latter cages are of order n({r,kr};6)=2(kr²−kr+1). Then this result supports the conjecture that n({r,m};6)=2(rm−m+1) for any r<m, posed by Yuansheng and Liang [Y. Yuansheng, W. Liang, The minimum number of vertices with girth 6 and degree set D={r,m}, Discrete Math. 269 (2003) 249-258]. We finalize giving the exact value n({3,3k};8), for k≥2.     

Multiplier operators and extremal functions related to the dual dunkl-sonine operator

We study the dual Dunkl-Sonine operator ^tS_k,? on ?^d, and give expression of ^tS_k,?, using Dunkl multiplier operators on ?^d. Next, we study the extremal functions f^*_λ, λ >0 related to the Dunkl multiplier operators, and more precisely show that {f^*_λ} λ >0 converges uniformly to ^tS_k,?(f) as λ → 0+. Certain examples based on Dunkl-heat and Dunkl-Poisson kernels are provided to illustrate the results.