On vector variational-like inequalities and vector optimization problems with (<Emphasis Type="Italic">G</Emphasis>, <Emphasis Type="Italic">α</Emphasis>)-invexity

The aim of this paper is to study the relationship among Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and vector optimization problem involving (G, α)-invex functions. Furthermore, we establish equivalence among the solutions of weak formulations of Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and weak efficient solution of vector optimization problem under the assumption of (G, α)-invex functions. Examples are provided to elucidate our results.     

Unit Interval Orders of Open and Closed Intervals

A poset P = (X, ?) is a unit OC interval order if there exists a representation that assigns an open or closed real interval I(x) of unit length to each x ∈ P so that x ? y in P precisely when each point of I (x) is less than each point in I (y). In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. The algorithm takes a poset P as input and either produces a representation or returns a forbidden poset induced in P.     

Non-Monotonic Behavior of One-Signed Solutions of Quasilinear Differential Equations

We consider a class of the second-order quasilinear differential equations. By deriving relations between certain types of monotonic solutions of the quasilinear equation and corresponding reciprocal half-linear equation on a finite interval (a, b), we obtain criteria for all solutions of the main equation, which do not change sign in (a, b), to be non-monotonic in (a, b). This work is also extended to a perturbed half-linear equation as well as to the half-line \((a,\infty )\).     

Interval <Emphasis Type="Italic">k</Emphasis>-Graphs and Orders

An interval k-graph is the intersection graph of a family of intervals of the real line partitioned into k classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we study the cocomparability interval k-graphs; that is, the interval k-graphs whose complements have a transitive orientation and are therefore the incomparability graphs of strict partial orders. For brevity we call these orders interval k-orders. We characterize the kind of interval representations a cocomparability interval k-graph must have, and identify the structure that guarantees an order is an interval k-order. The case k =?2 is peculiar: cocomparability interval 2-graphs (equivalently proper- or unit-interval bigraphs, bipartite permutation graphs, and complements of proper circular-arc graphs to name a few) have been characterized in many ways, but we show that analogous characterizations do not hold if k >?2. We characterize the cocomparability interval 3-graphs via one forbidden subgraph and hence interval 3-orders via one forbidden suborder.     

Cauchy problem for the Korteweg-de Vries equation in the case of a nonsmooth unbounded initial function

In the strip П = (?1, 0) × ?, we establish the existence of solutions of the Cauchy problem for the Korteweg-de Vries equation u _t + u _xxx + uu _x = 0 with initial condition either 1) u(?1, x) = ?xθ(x), or 2) u(?1, x) = ?xθ(?x), where θ is the Heaviside function. The solutions constructed in this paper are infinitely smooth for t ∈ (?1, 0) and rapidly decreasing as x → +∞. For the case of the first initial condition, we also establish uniqueness in a certain class. Similar special solutions of the KdV equation arise in the study of the asymptotic behavior with respect to small dispersion of the solutions of certain model problems in a neighborhood of lines of weak discontinuity.     

Asymptotic expansions of periodic solutions of ordinary differential equations with large high-frequency terms

We consider the problem on the periodic solutions of a system of ordinary differential equations of arbitrary order n containing terms oscillating at a frequency ω ? 1 with coefficients of the order of ω ^n/2. For this problem, we construct the averaged (limit) problem and justify the averaging method as well as another efficient algorithm for constructing the complete asymptotics of the solution.     

An Optimal Algorithm for the <Emphasis Type="Italic">k</Emphasis>-Fixed-Endpoint Path Cover on Proper Interval Graphs

In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k vertices, a k-fixed-endpoint path cover of G with respect to T is a set of vertex-disjoint simple paths that covers the vertices of G, such that the vertices of T are all endpoints of these paths. The goal is to compute a k-fixed-endpoint path cover of G with minimum cardinality. We propose an optimal algorithm for this problem with runtime O(n), where n is the number of intervals in G. This algorithm is based on the Stair Normal Interval Representation (SNIR) matrix that characterizes proper interval graphs. In this characterization, every maximal clique of the graph is represented by one matrix element; the proposed algorithm uses this structural property, in order to determine directly the paths in an optimal solution.     

The optimal solution set of the interval linear programming problems

Several methods exist for solving the interval linear programming (ILP) problem. In most of these methods, we can only obtain the optimal value of the objective function of the ILP problem. In this paper we determine the optimal solution set of the ILP as the intersection of some regions, by the best and the worst case (BWC) methods, when the feasible solution components of the best problem are positive. First, we convert the ILP problem to the convex combination problem by coefficients 0 ≤ λ _j , μ _ij , μ _i  ≤ 1, for i = 1, 2, . . . , m and j = 1, 2, . . . , n. If for each i, j, μ _ij  = μ _i  = λ _j  = 0, then the best problem has been obtained (in case of minimization problem). We move from the best problem towards the worst problem by tiny variations of λ _j , μ _ij and μ _i from 0 to 1. Then we solve each of the obtained problems. All of the optimal solutions form a region that we call the optimal solution set of the ILP. Our aim is to determine this optimal solution set by the best and the worst problem constraints. We show that some theorems to validity of this optimal solution set.     

A fractional spectral method with applications to some singular problems

In this paper we propose and analyze fractional spectral methods for a class of integro-differential equations and fractional differential equations. The proposed methods make new use of the classical fractional polynomials, also known as Müntz polynomials. We first develop a kind of fractional Jacobi polynomials as the approximating space, and derive basic approximation results for some weighted projection operators defined in suitable weighted Sobolev spaces. We then construct efficient fractional spectral methods for some integro-differential equations which can achieve spectral accuracy for solutions with limited regularity. The main novelty of the proposed methods is that the exponential convergence can be attained for any solution u(x) with u(x ^1/λ ) being smooth, where λ is a real number between 0 and 1 and it is supposed that the problem is defined in the interval (0,1). This covers a large number of problems, including integro-differential equations with weakly singular kernels, fractional differential equations, and so on. A detailed convergence analysis is carried out, and several error estimates are established. Finally a series of numerical examples are provided to verify the efficiency of the methods.     

Equivalence of viscosity and weak solutions for the normalized <Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)-Laplacian

We show that viscosity solutions to the normalized p(x)-Laplace equation coincide with distributional weak solutions to the strong p(x)-Laplace equation when p is Lipschitz and \(\inf p>1\). This yields \(\smash {C^{1,\alpha }}\) regularity for the viscosity solutions of the normalized p(x)-Laplace equation. As an additional application, we prove a Radó-type removability theorem.     

Boundary-value problems for the Schröinger equation with rapidly oscillating and delta-liked potentials

This paper deals with boundary-value problems on the closed interval [a, b] for the Schrödinger equation with potential of the form q(x, μ ^?1 x) + ε ^?1 Q(ε ^?1 x), where q(x, ζ) is a 1-periodic (in ζ) function, Q(ξ) is a compactly supported function, 0 ∈ (a, b), and μ, ε are small positive parameters. The solutions of these boundary-value problemsup to O(ε +μ) are constructed by combining the homogenization method and the method of matching asymptotic expansions.     

The existence of semiclassical states for some <Emphasis Type="Italic">p</Emphasis>-Laplacian equation with critical exponent

In this paper, we study the existence of semiclassical states for some p-Laplacian equation. Under given conditions and minimax methods, we show that this problem has at least one positive solution provided that ε ≤ E; for any m ∈ ?, it has m pairs solutions if ε ≤ E _m , where E, E_m are sufficiently small positive numbers. Moreover, these solutions are closed to zero in W^1,p(? ^N ) as ε → 0.     

Allowable Interval Sequences and Separating Convex Sets in the Plane

In 2005, Goodman and Pollack introduced the concept of an allowable interval sequence, a combinatorial object which encodes properties of a family of pairwise disjoint convex sets in the plane. They, Dhandapani, and Holmsen used this concept to address Tverberg’s (1,k)-separation problem: How many pairwise disjoint compact convex sets in the plane are required to guarantee that one can be separated by a line from k others? (Denote this number by f _k .) A new proof was provided that f ₂=5, a result originally obtained by Tverberg himself, and the application of allowable interval sequences to the case of general k was left as an open problem. Hope and Katchalski, using other methods, proved in 1990 that 3k?1≤f _k ≤12(k?1). In this paper, we apply the method of allowable interval sequences to give an upper bound on f _k of under 7.2(k?1), shrinking the range given by Hope and Katchalski by more than half. For a family of translates we obtain a tighter upper bound of approximately 5.8(k?1).     

Locally Lipschitz vector optimization with inequality and equality constraints

The present paper studies the following constrained vector optimization problem: \(\mathop {\min }\limits_C f(x),g(x) \in - K,h(x) = 0\), where f: ? ⁿ → ? ^m , g: ? ⁿ → ? ^p are locally Lipschitz functions, h: ? ⁿ → ? ^q is C ¹ function, and C ? ? ^m and K ? ? ^p are closed convex cones. Two types of solutions are important for the consideration, namely w-minimizers (weakly efficient points) and i-minimizers (isolated minimizers of order 1). In terms of the Dini directional derivative first-order necessary conditions for a point x ⁰ to be a w-minimizer and first-order sufficient conditions for x ⁰ to be an i-minimizer are obtained. Their effectiveness is illustrated on an example. A comparison with some known results is done.     

Sequential and parallel domain decomposition methods for a singularly perturbed parabolic convection-diffusion equation

A boundary value problem for a singularly perturbed parabolic convection-diffusion equation is considered in a rectangular domain in x and t; the perturbation parameter ? multiplying the highest derivative takes arbitrary values in the half-open interval (0,1]. For the boundary value problem, we construct a scheme based on the method of lines in x passing through N ₀+1 points of the mesh with respect to t. To solve the problem on a set of intervals, we apply a domain decomposition method (on overlapping subdomains with the overlap width δ), which is a modification of the Schwarz method. For the continual schemes of the decomposition method, we study how sequential and parallel computations, the order of priority in which the subproblems are sequentially solved on the subdomains, and the value of the parameter ? (as well as the values of N ₀, δ) influence the convergence rate of the decomposition scheme (as N ₀ → ∞), and also computational costs for solving the scheme and time required for its solution (unless a prescribed tolerance is achieved). For convection-diffusion equations, in contrast to reaction-diffusion ones, the sequential scheme turns out to be more efficient than the parallel scheme.     

Meromorphic Solutions for a Class of Differential Equations and Their Applications

In this note, we study the admissible meromorphic solutions for algebraic differential equation fⁿf' + P_n?1(f) = R(z)e^α(z), where P_n?1(f) is a differential polynomial in f of degree ≤ n ? 1 with small function coefficients, R is a non-vanishing small function of f, and α is an entire function. We show that this equation does not possess any meromorphic solution f(z) satisfying N(r, f) = S(r, f) unless P_n?1(f) ≡ 0. Using this result, we generalize a well-known result by Hayman.     

A superconvergent local discontinuous Galerkin method for nonlinear two-point boundary-value problems

In this paper, we present and analyze a superconvergent and high order accurate local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u ^″ = f (t, u), which arise in a wide variety of engineering applications. We prove the L ² stability of the LDG scheme and optimal L ² error estimates for the solution and for the auxiliary variable that approximates the first-order derivative. The order of convergence is proved to be p +?1, when piecewise polynomials of degree at most p are used. Our numerical experiments demonstrate optimal rates of convergence. Moreover, we show that the derivatives of the LDG solutions are superconvergent with order p +?1 toward the derivatives of Gausss-Radau projections of the exact solutions. Finally, we prove that the LDG solutions are superconvergent with order p +?3/2 toward Gauss-Radau projections of the exact solutions. Our computational results indicate that the observed numerical superconvergence rate is p +?2. Our proofs are valid for arbitrary regular meshes using piecewise polynomials of degree p ≥?1 and for the periodic, Dirichlet, and mixed boundary conditions. All proofs are valid under the hypotheses of the existence and uniqueness theorem for BVPs. Several numerical results are presented to validate the theoretical results.     

The Lipschitzianity of convex vector and set-valued functions

It is well known that every scalar convex function is locally Lipschitz on the interior of its domain in finite dimensional spaces. The aim of this paper is to extend this result for both vector functions and set-valued mappings acting between infinite dimensional spaces with an order generated by a proper convex cone C. Under the additional assumption that the ordering cone C is normal, we prove that a locally C-bounded C-convex vector function is Lipschitz on the interior of its domain by two different ways. Moreover, we derive necessary conditions for Pareto minimal points of vector-valued optimization problems where the objective function is C-convex and C-bounded. Corresponding results are derived for set-valued optimization problems.     

Existence of Semilinear Differential Equations with Nonlocal Initial Conditions

In this paper we give the existence of mild solutions for semilinear Cauchy problems u′（t） = Au（t） ＋f（t, u（t））, t ∈ I, a.e. with nonlocal initial condition u（O） = g（u） ＋uo when the map g loses compactness in Banach spaces.     

An indefinite concave-convex equation under a Neumann boundary condition I

We investigate the problem (P _λ) ?Δu = λb(x)|u| ^q?2 u + a(x)|u| ^p?2 u in Ω, ?u/?n = 0 on ?Ω, where Ω is a bounded smooth domain in R ^N (N ≥ 2), 1 < q < 2 < p, λ ∈ R, and a, b ∈ \({C^\alpha }\left( {\overline \Omega } \right)\) with 0 < α < 1. Under certain indefinite type conditions on a and b, we prove the existence of two nontrivial nonnegative solutions for small |λ|. We then characterize the asymptotic profiles of these solutions as λ → 0, which in some cases implies the positivity and ordering of these solutions. In addition, this asymptotic analysis suggests the existence of a loop type component in the non-negative solutions set. We prove the existence of such a component in certain cases, via a bifurcation and a topological analysis of a regularized version of (P _λ).