Controllability and extremality in nonconvex differential inclusions

LetF:[0, T]×R ⁿ 2 ^{R n} be a set-valued map with compact values; let :R ⁿ R ^m be a locally Lipschitzian map,z(t) a given trajectory, andR the reachable set atT of the differential inclusion . We prove sufficient conditions for (z(T))intR and establish necessary conditions in maximum principle form for (z(T))(R). As a consequence of these results, we show that every boundary trajectory is simultaneously a Pontryagin extremal, Lagrangian extremal, and relaxed Lagrangian extremal.The author is grateful to an anonymous referee for his valuable remarks and comments which have helped to improve the paper.The paper was written while the author was visiting the laboratory of Prof. S. Suzuki, Department of Mechanical Engineering, Sophia University, Tokyo, Japan.     

Variational-Like Inequalities with Generalized Monotone Mappings in Banach Spaces

In this paper, we introduce two classes of variational-like inequalities with generalized monotone mappings in Banach spaces. Using the KKM technique, we obtain the existence of solutions for variational-like inequalities with relaxed – monotone mappings in reflexive Banach spaces. We present also the solvability of variational-like inequalities with relaxed – semimonotone mappings in arbitrary Banach spaces by means of the Kakutani-Fan-Glicksberg fixed-point theorem. The results presented in this paper extend and improve the corresponding results of Refs. 1–6.     

A large deviation principle for (r,p)-capacities on the Wiener space

Summary We formulate and prove a large deviation principle for the (r, p)-capacity on an abstract Wiener space. As an application, we obtain a sharpening of Strassen's law of the iterated logarithm in terms of the capacity.     

Iterative Schemes for Solving Mixed Variational-Like Inequalities

In the present paper, we introduce the concept of -cocoercivity of a map and develop some iterative schemes for finding the approximate solutions of mixed variational-like inequalities. We use the concept of -cocoercivity to prove the convergence of the approximate solutions to the exact solution of mixed variational-like inequalities.     

Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems

A class of constrained multiobjective fractional programming problems is considered from a viewpoint of the generalized convexity. Some basic concepts about the generalized convexity of functions, including a unified formulation of generalized convexity, are presented. Based upon the concept of the generalized convexity, efficiency conditions and duality for a class of multiobjective fractional programming problems are obtained. For three types of duals of the multiobjective fractional programming problem, the corresponding duality theorems are also established.     

The η-Invariant of Twisted Dirac Operators of S3/Γ

The aim of this paper is to compute the and ~-invariants for the Dirac operator of the quotient of the sphere S ³ by a finite subgroup, twisted by a representation of its fundamental group.     

Prime Rings with Involution Equipped with Some New Product

Let R be a ring with involution *. We consider R as a ring equipped with a new product r s = rs + sr^*. The relationship between (ordinary) ideals of R and right ideals of R with respect to the product is studied.AMS Subject Classification (2000): 16W10, 16D25     

Multiplicative Products of Dedekind η-Functions and Group Representations

In this paper, we findall metacyclic groups (a,b:a^m=e,b^s=e,b^-1ab=a^r), where m=10,14,15,20,21,22, such that the cusp forms associated with all elements of these groups by an exact representation are multiplicative-products. We also consider the correspondence between multiplicative -products and elements of finite order in SL(5,C) by the adjoint representation.     

Start‐up class models in multiple‐class queues with N‐policy

In this paper, we consider multipleclass queueing systems with Npolicy in which the idle server starts service as soon as the number of customers in the startup class reaches threshold N. We consider the cases of FCFS and nonpreemptive priority. We obtain the Laplace–Stieltjes transform of the waiting times of each class of customers. We also show some results for the general behavior of such systems.     

(φ,ξ,η,λ)‐Structures of Parabolic Type

We consider (,,,)structures of parabolic type on hypersurfaces of dual spaces and study the rank of the affinor . We consider almost contact metric structures of parabolic type of the first kind on hypersurfaces of 4dimensional dual metric space. We study the properties of these structures and give examples of normal, integrable, and Sasakian parabolic structures.     

A Population Dynamics Model with Parental Care

A model for an agestructured unlimited population dynamics with parental care of offspring is presented (migration of individuals is not taken into account). The model consists of six partial integrodifferential equations for single males, single females, pairs with offspring under parental care, pairs without offspring under parental care, and offspring of the male and female sex. A class of separable solutions is constructed.     

A Special Basis of the Space of Meromorphic Sections on Riemann Surfaces

A special choice of basis for meromorphic sections of line bundles, in which all poles lie at the punctures, allows the decomposition of field operators (which are sections of bundles) into modes analogous to the standard decomposition on the sphere. Many of the calculational techniques used on the sphere can be reproduced for higher genus surfaces in this basis.Using this technique, in this paper, we compute a basis of K (the space of meromorphic sections on a Riemann surface, holomorphic away from two fixed points). This basis consists of the sections which have the expected zero or pole order at the two points.AMS Subject Classification (1991): 14H55     

A Numerical Comparison of Some Modified Controlled Random Search Algorithms

In this paper we propose a new version of the Controlled Random Search(CRS) algorithm of Price. The new algorithmhas been tested on thirteen global optimization test problems. Numericalexperiments indicate that the resulting algorithm performs considerablybetter than the earlier versions of the CRS algorithms. The algorithm,therefore, could offer a reasonable alternative to many currently availablestochastic algorithms, especially for problems requiring direct searchtype methods. Also a classification of the CRS algorithms is made based onglobal technique – local technique and the relative performance ofclasses is numerically explored.     

A Characterization of Markov Property for Semigroups with Invariant Measure

The positivity of the carré du champ operator is a direct consequence of the positivity of the associated Markov semigroup. We show in this note that the reciprocal implication holds in invariant measure, under minimal hypotheses of continuity and stability.     

Piecewise Constant Roughly Convex Functions

This paper investigates some kinds of roughly convex functions, namely functions having one of the following properties: -convexity (in the sense of Klötzler and Hartwig), -convexity and midpoint -convexity (in the sense of Hu, Klee, and Larman), -convexity and midpoint -convexity (in the sense of Phu). Some weaker but equivalent conditions for these kinds of roughly convex functions are stated. In particular, piecewise constant functions satisfying f(x) = f([x]) are considered, where [x] denotes the integer part of the real number x. These functions appear in numerical calculation, when an original function g is replaced by f(x):=g([x]) because of discretization. In the present paper, we answer the question of when and in what sense such a function f is roughly convex.     

Finite Coverings by Cones and an Application in Multi-Objective Programming

This paper considers analogues of statements concerning compactness and finite coverings, in which the roles of spheres are replaced by cones. Furthermore, one of the finite covering results provides an application in Multi-Objective Programming; infinite sets of alternatives are reduced to finite sets.     

On θ-Principal Extension and H-Closedness

A type of extensions called the -extention of topological spaces and their -equivalence and -trace systems are introduced, which ultimately characterize H-closed -extensions of a Hausdorff topological space. Also, the notion of -principal extensions is defined. A typical -principal extension consisting of certain grills on a Hausdorff space is constructed, and finally, some characterizations of H-closedness of a Hausdorff space are obtained.AMS Subject Classification (2000) 54D30 54D99