Existence results without convexity conditions for general problems of optimal control with singular components

This note presents a new, quick approach to existence results without convexity conditions for optimal control problems with singular components in the sense of E. J. McShane (SIAM J. Control5 (1967), 438–485). Starting from the resolvent kernel representation of the solutions of a linear integral equation, a version of Fatou's lemma in several dimensions is shown to lead directly to a compactness result for the attainable set and an existence result for a Mayer problem. These results subsume those of L. W. Neustadt (J. Math. Anal. Appl.7 (1963), 110–117), C. Olech (J. Differential Equations2 (1966), 74–101), M. Q. Jacobs (“Mathematical Theory of Control,” pp. 46–53, Academic Press, 1967), L. Cesari (SIAM J. Control12 (1974), 319–331) and T. S. Angell (J. Optim. Theory Appl.19 (1976), 63–79).     

Homogenization of a Ginzburg–Landau functional

We consider a nonlinear homogenization problem for a Ginzburg–Landau functional with a (positive or negative) surface energy term describing a nematic liquid crystal with inclusions. Assuming that sizes and distances between inclusions are of the same order ?, we obtain a limiting functional as $?\to 0$. We generalize the method of mesocharacteristics to show that a corresponding homogenized problem for arbitrary, periodic or non-periodic geometries is described by an anisotropic Ginzburg–Landau functional. We give computational formulas for material characteristics of an effective medium. To cite this article: L. Berlyand et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

An exact homology sequences approach to the controllability of systems

Some results are given on the homology groups of the abstract simplicial complex associated to a multivariable control system, as an extension of the central result of J. Casti (J. Math. Anal. Appl.68 (1979), 347–370) to the multivariable case. The method used is “polyhedral dynamics” as termed by J. Casti, who introduced it. A given control system is mapped into a simplicial complex and then its homological structure is studied. These results, obtained in the multivariable case by the use of the Mayer-Vietoris homology sequence and of the relative homology sequence, present topological invariants for control systems thus creating the possibility of a new topological classification of multivariable systems. An example is given to clarify the approach.     

Maharam's problem

We solve Maharam's problem [D. Maharam, An algebraic characterization of measure algebras, Ann. Math. 48 (1947) 154–167. [3]], also known as the Control Measure Problem. We construct a non-zero exhaustive submeasure on the algebra of clopen sets of the Cantor set that is not absolutely continuous with respect to a measure. To cite this article: M. Talagrand, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Economic inefficiency measurement of input spending when decision-making units face different input prices

In a recent paper, Kaoru Tone (J Opl Res Soc (2002) 2: 429–444) showed that when the Farrell measure of cost efficiency is estimated for two firms that have different input prices, a firm with higher costs can be deemed more efficient than a firm with lower costs. As an alternative approach, Tone proposed a radial cost efficiency measure that is estimated using levels of spending on each input, rather than input quantities. Thus, firms with higher costs are less efficient than firms with lower costs. In this paper, we extend Tone's approach by allowing for non-radial changes in spending. Our approach builds on earlier work by Luenberger (J Math Econ (1992) 21: 461–481) and Chambers et al (J Econ Theo (1996) 70: 407–419) who use directional distance functions to measure inefficiency. We provide an example and illustration of our approach using Japanese bank data.     

Gδ-embeddings in Hilbert space

It is shown that a separable Banach space X has the point of weak to norm continuity property (resp. the Radon-Nikodym property) if and only if there exists a compact G_δ-embedding (resp. an H^δ-embedding) from X into l₂. This solves several questions of J. Bourgain and H. P. Rosenthal (J. Funct. Anal.52 (1983)). It is also shown that every non-relatively compact sequence in a Banach space with property (PC) has a difference subsequence which is a boundedly complete basic sequence. This solves a question of Pelczynski and extends some results of W. B. Johnson and H. P. Rosenthal (Studia Math.43 (1972), 77–92). Various related questions asked in the above Bourgain-Rosenthal reference and by G. A. Edgar and R. F. Wheeler (Pac. J. Math.115 (1984)) and N. Ghoussoub and H. P. Rosenthal (Math. Ann.264 (1983), 321–332) are also settled.     

On orthogonal groups over the integers of a non-dyadic local field

Let L be a lattice in a quadratic space over a non-dyadic local field. We shall answer the question: What are the lattices whose unit groups coincide with that of L? If the residue class field has more than three elements the question is easy. In this case such a lattice must be $\text{a}$L or $\text{a}$L^# with a fractional ideal $\text{a}$ and the dual lattice L^# by Satz 2 of A. Kallmann, M. Kneser, and U. Stuhler (J. Reine Angew. Math.258 (1978), 51–54) or Theorem 5.2 of C. R. Riehm (Amer. J. Math.89 (1967), 549–577). But it is not easy in the case of the residue class field of three elements.     

Stability and forced oscillations

In this paper we derive a differential-difference equation for a circuit involving a lossless transmission line and we give conditions for global asymptotic stability of an equilibrium point, existence and stability of forced oscillations. Some of such problems have been investigated for an equation obtained by R. K. Brayton [Quart. J. Appl. Math.24 (1967), 289–301; O. Lopes, SIAM J. Appl. Math., to appear; M. Slemrod, J. Math. Anal. Appl.36 (1971), 22–40] but, for ours (which governs the same physical problem), better results can be proved. By using suitable Liapunov functionals, we reduce the problem of stability and uniform ultimate boundedness to a scalar ordinary differential inequality.     

Strong convergence theorems for strictly asymptotically pseudocontractive mappings in Hilbert spaces

The purpose of this paper is by using CSQ method to study the strong convergence problem of iterative sequences for a pair of strictly asymptotically pseudocontractive mappings to approximate a common fixed point in a Hilbert space. Under suitable conditions some strong convergence theorems are proved. The results presented in the paper are new which extend and improve some recent results of Acedo and Xu [Iterative methods for strict pseudo-contractions in Hilbert spaces. Nonlinear Anal., 67(7), 2258??271 (2007)], Kim and Xu [Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups. Nonlinear Anal., 64, 1140??152 (2006)], Martinez-Yanes and Xu [Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal., 64, 2400??411 (2006)], Nakajo and Takahashi [Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl., 279, 372??79 (2003)], Marino and Xu [Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. J. Math. Anal. Appl., 329(1), 336??46 (2007)], Osilike et al. [Demiclosedness principle and convergence theorems for k-strictly asymptotically pseudocontractive maps. J. Math. Anal. Appl., 326, 1334??345 (2007)], Liu [Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nonlinear Anal., 26(11), 1835??842 (1996)], Osilike et al. [Fixed points of demi-contractive mappings in arbitrary Banach spaces. Panamer Math. J., 12 (2), 77??8 (2002)], Gu [The new composite implicit iteration process with errors for common fixed points of a finite family of strictly pseudocontractive mappings. J. Math. Anal. Appl., 329, 766??76 (2007)].     

On the homotopy type of (<Emphasis Type="Italic">n</Emphasis>-1)-connected (3<Emphasis Type="Italic">n</Emphasis>+1)-dimensional free chain Lie algebra

Let R be a subring ring of Q. We reserve the symbol p for the least prime which is not a unit in R; if R ?Q, then p=∞. Denote by DGL _n ^np , n≥1, the category of (n-1)-connected np-dimensional differential graded free Lie algebras over R. In [1] D. Anick has shown that there is a reasonable concept of homotopy in the category DGL _n ^np . In this work we intend to answer the following two questions: Given an object (L(V), ?) in DGL _n ³ⁿ⁺² and denote by S(L(V), ?) the class of objects homotopy equivalent to (L(V), ?). How we can characterize a free dgl to belong to S(L(V), ?)? Fix an object (L(V), ?) in DGL _n ³ⁿ⁺² . How many homotopy equivalence classes of objects (L(W), δ) in DGL _n ³ⁿ⁺² such that H _* (W, d′)?H _* (V, d) are there? Note that DGL _n ³ⁿ⁺² is a subcategory of DGL _n ^np when p>3. Our tool to address this problem is the exact sequence of Whitehead associated with a free dgl.     

Searching for a Best Least Absolute Deviations Solution of an Overdetermined System of Linear Equations Motivated by Searching for a Best Least Absolute Deviations Hyperplane on the Basis of Given Data

We consider the problem of searching for a best LAD-solution of an overdetermined system of linear equations Xa=z, X∈?^m×n, m≥n, \(\mathbf{a}\in \mathbb{R}^{n}, \mathbf {z}\in\mathbb{R}^{m}\). This problem is equivalent to the problem of determining a best LAD-hyperplane x?a ^T x, x∈? ⁿ on the basis of given data \((\mathbf{x}_{i},z_{i}), \mathbf{x}_{i}= (x_{1}^{(i)},\ldots,x_{n}^{(i)})^{T}\in \mathbb{R}^{n}, z_{i}\in\mathbb{R}, i=1,\ldots,m\), whereby the minimizing functional is of the form

$F(\mathbf{a})=\|\mathbf{z}-\mathbf{Xa}\|_1=\sum_{i=1}^m|z_i-\mathbf {a}^T\mathbf{x}_i|.$

An iterative procedure is constructed as a sequence of weighted median problems, which gives the solution in finitely many steps. A criterion of optimality follows from the fact that the minimizing functional F is convex, and therefore the point a ^?∈? ⁿ is the point of a global minimum of the functional F if and only if 0∈?F(a ^?).

Motivation for the construction of the algorithm was found in a geometrically visible algorithm for determining a best LAD-plane (x,y)?αx+βy, passing through the origin of the coordinate system, on the basis of the data (x _i ,y _i ,z _i ),i=1,…,m.     

Proof of an entropy conjecture for Bloch coherent spin states and its generalizations

Wehrl used Glauber coherent states to define a map from quantum density matrices to classical phase space densities and conjectured that for Glauber coherent states the mininimum classical entropy would occur for density matrices equal to projectors onto coherent states. This was proved by Lieb in 1978 who also extended the conjecture to Bloch SU(2) spin-coherent states for every angular momentum J. This conjecture is proved here. We also recall our 1991 extension of the Wehrl map to a quantum channel from J to ${K=J+\frac{1}{2}, J+1, ... ,}$ with ${K=\infty}$ corresponding to the Wehrl map to classical densities. These channels were later recognized as the optimal quantum cloning channels. For each J and ${J < K \leqslant \infty}$ we show that the minimal output entropy for the channels occurs for a J coherent state. We also show that coherent states both Glauber and Bloch minimize any concave functional, not just entropy.     

A class of infinite dimensional linear programming problems

We study the infinite dimensional linear programming problem. The previous work done on this subject defined the dual problem in a small space and derived duality results for such pairs of problems. But because of that and of the strong requirements on the functions involved, those theorems do not actually hold in many applications. With our formulation, we define the dual problem in a larger space and obtain new duality results under, generally, mild assumptions. Furthermore, the solutions turn out to be extreme points of the unbounded, but w¹-locally compact, feasibility set. For this purpose, we did not try a constructive proof of our duality results, but instead we examine the problem from a more abstract point of view and derive results using general ideas from the theory of convex analysis in normed spaces [R. T. Rockafellar, “Conjugate Duality and Optimization,” SIAM, Philadelphia, Penn., 1973, and R. Holmes, “Geometric Functional Analysis,” Springer-Verlag, New York, 1975]. Our work extends previous results in this area, which appeared in [N. Levinson, J. Math. Anal. Appl.16 (1965) 73–83, and W. Tundall, SIAM J. Appl. Math.13 (1965), 644–666].     

Fractional derivatives of the H-function of several variables

In the present paper we derive a number of key formulas involving fractional derivatives for the H-function of several variables, which was introduced and studied in a series of papers by 11., 12., 13., 14., 15., 9., 261–277].We make use of the generalized Leibniz rule for fractional derivatives in order to obtain one of the aforementioned results, which involves a product of two multivariable H-functions. Each of these results is shown to apply to yield interesting new results for certain multivariable hypergeometric functions and, in addition, several known results due, for example, to J. L. Lavoie, T. J. Osler and R. Tremblay [SIAM Rev.18 (1976), 240–268], 4., 5., 371–382] and R. K. Raina and C. L. Koul [Jñānābha7 (1977), 97–105].     

Régularité dans une équation de Schrödinger avec potentiel singulier à distance finie et à l'infini

In this Note we study the Schrödinger equation i?_tu+Δu+V₀u+V₁u=0 on $\text{R}{}^3\text{×(0,T)}$ with initial condition $\text{u}{}_0\text{∈{v∈H}{}^2\text{(}\text{R}{}^3\text{)}$, where V₀ is a coulombian potential, singular at finite distance and V₁ is an electric potential, possibly unbounded. Both of them may depend on space and time variables. We prove that this problem is well-posed and that the regularity of the initial data is conserved for the solution. The detailed proof will be given elsewhere (Baudouin et al., in press). To cite this article: L. Baudouin et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Generation and Enumeration of Some Classes of Interval Orders

In this paper we consider the class of interval orders, recently considered by several authors from both an algebraic and an enumerative point of view. According to Fishburn’s Theorem (Fishburn J Math Psychol 7:144–149, 1970), these objects can be characterized as posets avoiding the poset 2?+?2. We provide a recursive method for the unique generation of interval orders of size n?+?1 from those of size n, extending the technique presented by El-Zahar (1989) and then re-obtain the enumeration of this class, as done in Bousquet-Melou et al. (2010). As a consequence we provide a method for the enumeration of several subclasses of interval orders, namely AV(2?+?2, N), AV(2?+?2, 3?+?1), AV(2?+?2, N, 3?+?1). In particular, we prove that the first two classes are enumerated by the sequence of Catalan numbers, and we establish a bijection between the two classes, based on the cardinalities of the principal ideals of the posets.     

Infinitely Many Critical Points of Non-Differentiable Functions and Applications to a Neumann-Type Problem Involving the p-Laplacian

For a family of functionals in a Banach space, which are possibly non-smooth and depend also on a positive real parameter, the existence of a sequence of critical points (according to Motreanu and Panagiotopoulos (“Minimax Theorems and Qualitative Properties of the Solutions of Hemivariational Inequalities,” Nonconvex Optimization Applications, Vol. 29, Kluwer, Dordrecht, 1998, Chap. 3)) is established by mainly adapting a new technique due to Ricceri (2000, J. Comput. Appl. Math.113, 401-410). Two applications are then presented. Both of them treat the Neumann problem for an elliptic variational-hemivariational inequality with p-Laplacian.     

Optimal selection of thek best of a sequence withk stops

We first consider the situation in which the decision-maker is allowed to have five choices with purpose to choose exactly the five absolute best candidates fromN applicants. The optimal stopping rule and the maximum probability of making the right five-choice are given for largeN εN, the maximum asymptotic value of the probability of the best choice being lim _N→∝ P (win) ≈ 0.104305. Then, we study the general problem of selecting thek best of a sequence withk stops, constructing first a rough solution for this problem. Using this suboptimal solution, we find an approximation for the optimal probability valuesP _k of the form $$P_k \approx \frac{1}{{(e - 1)k + 1}}$$ for any k εN.