The Cauchy problem for electromagnetic wave propagation in globally perturbed nonselfadjoint media

Let G be a subset of a locally convex separated topological vector space E with int(G) ≠ Ø, cl(G) convex and quasi-complete. Let f: cl(G) → E be a continuous condensing multifunction with compact and convex values and with a bounded range. It is shown that for each w? int(G), there exists a u = u(w) ??(cl(G)) such that p(f(u) ? u) = inf{p(x ? y): x?f(u), y? cl(G)}, where p is the Minkowski's functional of the set (cl(G) ? w). Several fixed point results are obtained as a consequence of this result.     

The Ornstein-Uhlenbeck semigroup in an infinite dimensional L2 setting

We study the number operator, N, of quantum field theory as a partial differential operator in infinitely many variables. Informally Nu(x) = ?Δu(x) + x · grad u(x). A large core for N is constructed which is invariant under e^?tN and on which this informal expression may be given a precise and natural meaning.     

Spanning trails containing given edges

A graph G is Eulerian-connected if for any u and v in V(G), G has a spanning (u,v)-trail. A graph G is edge-Eulerian-connected if for any e^′ and e^″ in E(G), G has a spanning (e^′,e^″)-trail. For an integer r?0, a graph is called r-Eulerian-connected if for any X⊆E(G) with |X|?r, and for any , G has a spanning (u,v)-trail T such that X⊆E(T). The r-edge-Eulerian-connectivity of a graph can be defined similarly. Let θ(r) be the minimum value of k such that every k-edge-connected graph is r-Eulerian-connected. Catlin proved that θ(0)=4. We shall show that θ(r)=4 for 0?r?2, and θ(r)=r+1 for r?3. Results on r-edge-Eulerian connectivity are also discussed.     

A characterization of block graphs

A block graph is a graph whose blocks are cliques. For each edge e=uv of a graph G, let N_e(u) denote the set of all vertices in G which are closer to u than v. In this paper we prove that a graph G is a block graph if and only if it satisfies two conditions: (a) The shortest path between any two vertices of G is unique; and (b) For each edge e=uv∈E(G), if x∈N_e(u) and y∈N_e(v), then, and only then, the shortest path between x and y contains the edge e. This confirms a conjecture of Dobrynin and Gutman [A.A. Dobrynin, I. Gutman, On a graph invariant related to the sum of all distances in a graph, Publ. Inst. Math., Beograd. 56 (1994) 18-22].     

A duality between locally compact groups and certain Banach algebras

We make precise the following statements: B(G), the Fourier-Stieltjes algebra of locally compact group G, is a dual of G and vice versa. Similarly, A(G), the Fourier algebra of G, is a dual of G and vice versa. We define an abstract Fourier (respectively, Fourier-Stieltjes) algebra; we define the dual group of such a Fourier (respectively, Fourier-Stieltjes) algebra; and we prove the analog of the Pontriagin duality theorem in this context. The key idea in the proof is the characterization of translations of B(G) as precisely those isometric automorphisms Φ of B(G) which satisfy ∥ p ? e^iθΦp ∥² + ∥ p + e^iθΦp ∥² = 4 for all θ ∈ $\text{R}$ and all pure positive definite functions p with norm one. One particularly interesting technical result appears, namely, given x₁, x₂?G, neither of which is the identity e of G, then there exists a continuous, irreducible unitary representation π of G (which may be chosen from the reduced dual of G) such that π(x₁) ≠ π(e) and π(x₂) ≠ π(e). We also note that the group of isometric automorphisms of B(G) (or A(G)) contains as a (“large”) ^.closed, normal subgroup the topological version of Burnside's “holomorph of G.”     

Spectral properties of the neutron transport equation

The general equation describing the steady-state flow through a porous column is λu ? D_xA(D_x?(u) + G(u)) = f, where λ is a nonnegative constant. In this paper existence, uniqueness and comparison results for solutions to the Dirichlet and mixed boundary value problems associated with this equation are proven. The existence of a weak solution to the evolution problems associated with the equation u_t = D_x(D_x?(u) + G(u)) are deduced.     

Boundedness in Nonlinear Asymmetric Oscillations

In this paper, the boundedness of all solutions of the nonlinear equation (?_p(x′))′+(p-1)[α?_p(x⁺)−β?_p(x⁻)]+f(x)+g(x)=e(t) is discussed, where e(t)∈C⁷ is 2π_p-periodic, f,g are bounded C⁶ functions, ?_p(u)=∣u∣^p−2u, p?2,α,β are positive constants, x⁺=max{x,0},x⁻=max{−x,0}.     

Every graph is (2,3)-choosable

A total weighting of a graph G is a mapping ? that assigns to each element z ∈ V (G)∪E(G) a weight ?(z). A total weighting ? is proper if for any two adjacent vertices u and v, ∑ _e∈E(u) ?(e)+?(u)≠∑ _e∈E(v) ?(e)+?(v). This paper proves that if each edge e is given a set L(e) of 3 permissible weights, and each vertex v is given a set L(v) of 2 permissible weights, then G has a proper total weighting ? with ?(z) ∈ L(z) for each element z ∈ V (G)∪E(G).     

The eccentric connectivity index of nanotubes and nanotori

Let G be a molecular graph. The eccentric connectivity index ξ^c(G) is defined as ξ^c(G)=∑_u∈V(G)deg_G(u)ε_G(u), where deg_G(u) denotes the degree of vertex u and ε_G(u) is the largest distance between u and any other vertex v of G. In this paper exact formulas for the eccentric connectivity index of TUC₄C₈(S) nanotube and TC₄C₈(S) nanotorus are given.     

An application of the maximum principle to describe the layer behavior of large solutions and related problems

This work is devoted to the analysis of the asymptotic behavior of positive solutions to some problems of variable exponent reaction-diffusion equations, when the boundary condition goes to infinity (large solutions). Specifically, we deal with the equations ??u = u ^p(x), ??u = ?m(x)u?+?a(x)u ^p(x) where a(x)??? a ₀ >?0, p(x)??? 1 in ??, and ??u = e ^p(x) where p(x)??? 0 in ??. In the first two cases p is allowed to take the value 1 in a whole subdomain ${\Omega_c\subset \Omega}$ , while in the last case p can vanish in a whole subdomain ${\Omega_c\subset \Omega}$ . Special emphasis is put in the layer behavior of solutions on the interphase ?? _i :?= ??? _c ???. A similar study of the development of singularities in the solutions of several logistic equations is also performed. For example, we consider ???u = ?? m(x)u?a(x) u ^p(x) in ??, u = 0 on ???, being a(x) and p(x) as in the first problem. Positive solutions are shown to exist only when the parameter ?? lies in certain intervals: bifurcation from zero and from infinity arises when ?? approaches the boundary of those intervals. Such bifurcations together with the associated limit profiles are analyzed in detail. For the study of the layer behavior of solutions the introduction of a suitable variant of the well-known maximum principle is crucial.     

On solutions to the Degasperis-Procesi equation

In this paper we consider a new integrable equation (the Degasperis-Procesi equation) derived recently by Degasperis and Procesi (1999) [3]. Analogous to the Camassa-Holm equation, this new equation admits blow-up phenomenon and infinite propagation speed. First, we give a proof for the blow-up criterion established by Zhou (2004) in [12]. Then, infinite propagation speed for the Degasperis-Procesi equation is proved in the following sense: the corresponding solution u(x,t) with compactly supported initial datum u₀(x) does not have compact x-support any longer in its lifespan. Moreover, we show that for any fixed time t>0 in its lifespan, the corresponding solution u(x,t) behaves as: u(x,t)=L(t)e−x for x?1, and u(x,t)=l(t)ex for x?−1, with a strictly increasing function L(t)>0 and a strictly decreasing function l(t)<0 respectively.     

The number of positive integers ≤x and free of prime factors >y

The number defined by the title is denoted by Ψ(x, y). Let $\text{u =}\text{log}\text{x}\text{log}\text{y}$ and let ?(u) be the function determined by ?(u) = 1, 0 ≤ u ≤ 1, u?′(u) = ? ?(u ? 1), u > 1. We prove the following:Theorem. For x sufficiently large and log y ≥ (log log x)², Ψ(x,y) ? x?(u) while for 1 + log log x ≤ log y ≤ (log log x)², and ε > 0, $\text{Ψ(x, y) ?}{}_{\mathrm{\epsilon }}\text{x?(u)}\text{exp}\text{(?u e}\text{xp}\text{(?(}\text{log}\text{y)}{}^{\mathrm{<mtext>(</mtext><mtext>3</mtext><mtext>5</mtext><mtext>\; ?\; \epsilon )</mtext>}}\text{))}$.The proof uses a weighted lower approximation to Ψ(x, y), a reinterpretation of this sum in probability terminology, and ultimately large-deviation methods plus the Berry-Esseen theorem.     

The Hosoya polynomial decomposition for catacondensed benzenoid graphs

For a graph G with the vertex set V(G), we denote by d(u,v) the distance between vertices u and v in G, by d(u) the degree of vertex u. The Hosoya polynomial of G is H(G)=∑_{u,v}⊆V(G)x^d(u,v). The partial Hosoya polynomials of G are for positive integer numbers m and n. It is shown that H(G₁)−H(G₂)=x²(x+1)²(H₃₃(G₁)−H₃₃(G₂)),H₂₂(G₁)−H₂₂(G₂)=(x²+x−1)²(H₃₃(G₁)−H₃₃(G₂)) and H₂₃(G₁)−H₂₃(G₂)=2(x²+x−1)(H₃₃(G₁)−H₃₃(G₂)) for arbitrary catacondensed benzenoid graphs G₁ and G₂ with equal number of hexagons. As an application, we give an affine relationship between H(G) with two other distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bulletin de l’Académie Serbe des Sciences et des Arts (Cl. Math. Natur.) 131 (2005) 1-7].     

On nonlinear diffusion equations with x-dependent convection and absorption

For the 1+1-dimensional nonlinear diffusion equations with x-dependent convection and source terms u_t=(D(u)u_x)_x+Q(x,u)u_x+P(x,u), we obtain conditions under which the equations admit the second-order generalized conditional symmetries η(x,u)=u_xx+H(u)u_x²+G(x,u)u_x+F(x,u) and the first-order sign-invariants J(x,u)=u_t−A(u)u_x²−B(x,u)u_x−C(x,u) on the solutions u(x,t). Several different generalized conditional symmetries and first-order sign-invariants for equations in which the diffusion term offers different possibilities (power-law, exponential, Mullin, Fujita) are presented. Exact solutions to the resulting equations corresponding to the generalized conditional symmetries and the first-order sign-invariants are constructed.     

Control problems governed by Sobolev partial differential equations

Let G be a bounded subset of Rⁿ with a smooth boundary and Q = G × (0, T]. We consider a control problem governed by the Sobolev initial-value problem My_t(u) + Ly(u) = u in L²(Q), y(·, 0; u) = 0 in L₂(G), where M = M(x) and L = L(x) are symmetric uniformly strongly elliptic operators of orders 2m and 2l, respectively. The problem is to find the control u₀ of L²(Q)-norm at most b that steers to within a prescribed tolerance ? of a given function Z in L²(G) and that minimizes a certain energy functional. Our main results establish regularity properties of u₀. We also give results concerning the existence and uniqueness of the optimal control, the controllability of Sobolev initial-value problems, and properties of the Lagrange multipliers associated with the problem constraints.     

Weak solution of (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0))u′(0) = ku(0), r(L, u(L))u′ (L) = hu(L) and k, h are suitable elements of [0, ∞]

We consider weak solutions to the nonlinear boundary value problem (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0)) u′(0) = ku(0), r(L, u(L)) u′(L) = hu(L) and k, h are suitable elements of [0, ∞]. In addition to studying some new boundary conditions, we also relax the constraints on r(x, u) and (Fu)(x). r(x, u) > 0 may have a countable set of jump discontinuities in u and r(x, u)^?1?L_q((0, L) × (0, p)). F is an operator from a suitable set of functions to a subset of L_p(0, L) which have nonnegative values. F includes, among others, examples of the form (Fu)(x) = (1 ? H(x ? x₀)) u(x₀), (Fu)(x) = ∫_x^Lf(y, u(y)) dy where f(y, u) may have a countable set of jump discontinuities in u or F may be chosen so that (Fu)′(x) = ? g(x, u(x)) u′(x) ? q(x) u(x) ? f(x, u(x)) where q is a distributional derivative of an L₂(0, L) function.     

Diameter and connectivity of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v,u,x,y) of vertices such that both (v,u,x) and (u,x,y) are paths of length two. The 3-arc graph of a given graph G, X(G), is defined to have vertices the arcs of G. Two arcs uv,xy are adjacent in X(G) if and only if (v,u,x,y) is a 3-arc of G. This notion was introduced in recent studies of arc-transitive graphs. In this paper we study diameter and connectivity of 3-arc graphs. In particular, we obtain sharp bounds for the diameter and connectivity of X(G) in terms of the corresponding invariant of G.     

Bessel Property of the System of Root Functions of a Second-Order Singular Operator on an Interval

For the system of root functions of an operator defined by the differential operation ?u″ + p(x)u′ + q(x)u, x ∈ G = (0, 1), with complex-valued singular coefficients, sufficient conditions for the Bessel property in the space L₂(G) are obtained and a theorem on the unconditional basis property is proved. It is assumed that the functions p(x) and q(x) locally belong to the spaces L₂ and W₂^?1, respectively, and may have singularities at the endpoints of G such that q(x) = q_R(x) +q′S(x) and the functions q_S(x), p(x), q ₂ ^S (x)w(x), p²(x)w(x), and q_R(x)w(x) are integrable on the whole interval G, where w(x) = x(1 ? x).     

Diameter-essential edges in a graph

The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity among the vertices of G. The contraction of edge e=uv in G consists of removing e and identifying u and v as a single new vertex w, where w is adjacent to any vertex that at least one of u or v were adjacent to. The graph resulting from contracting edge e is denoted G/e. An edge e is diameter-essential if diam(G/e)<diam(G). Let c(G) denote the number of diameter-essential edges in graph G. In this paper, we study existence and extremal problems for c(G); determine bounds on c(G) in terms of diameter and order; and obtain characterizations of graphs achieving extreme values of c(G).