Differential Equations with Infinitely Many Derivatives and the Borel Transform

Differential equations with infinitely many derivatives, sometimes also referred to as “nonlocal” differential equations, appear frequently in branches of modern physics such as string theory, gravitation and cosmology. We properly interpret and solve linear equations in this class with a special focus on a solution method based on the Borel transform. This method is a far-reaching generalization of previous studies of nonlocal equations via Laplace and Fourier transforms, see for instance (Barnaby and Kamran, J High Energy Phys 02:40, 2008; Górka et al., Class Quantum Gravity 29:065017, 2012; Górka et al., Ann Henri Poincaré 14:947–966, 2013). We reconsider “generalized” initial value problems within the present approach and we disprove various conjectures found in modern physics literature. We illustrate various analytic phenomena that can occur with concrete examples, and we also treat efficient implementations of the theory.     

Uniformly nonsquare Banach spaces have the fixed point property for nonexpansive mappings

It is shown that if the modulus Γ_X of nearly uniform smoothness of a reflexive Banach space satisfies , then every bounded closed convex subset of X has the fixed point property for nonexpansive mappings. In particular, uniformly nonsquare Banach spaces have this property since they are properly included in this class of spaces. This answers a long-standing question in the theory.     

Autocorrelation measures for the quadratic assignment problem

In this article we provide an exact expression for computing the autocorrelation coefficient ξ and the autocorrelation length ? of any arbitrary instance of the Quadratic Assignment Problem (QAP) in polynomial time using its elementary landscape decomposition. We also provide empirical evidence of the autocorrelation length conjecture in QAP and compute the parameters ξ and ? for the 137 instances of the QAPLIB. Our goal is to better characterize the difficulty of this important class of problems to ease the future definition of new optimization methods. Also, the advance that this represents helps to consolidate QAP as an interesting and now better understood problem.     

Interpolation in the unit ball ofC n

A necessary and sufficient condition is given for a discrete multiplicity variety in the unit ballB _n ofC ⁿ to be an interpolating variety for weighted spaces of holomorphic functions inB _n . Partially supported by NSF Grant DMS-9706376.     

The asymptotic behaviour of the heat equation in a twisted Dirichlet-Neumann waveguide

We consider the heat equation in a straight strip, subject to a combination of Dirichlet and Neumann boundary conditions. We show that a switch of the respective boundary conditions leads to an improvement of the decay rate of the heat semigroup of the order of t−1/2. The proof employs similarity variables that lead to a non-autonomous parabolic equation in a thin strip contracting to the real line, that can be analysed on weighted Sobolev spaces in which the operators under consideration have discrete spectra. A careful analysis of its asymptotic behaviour shows that an added Dirichlet boundary condition emerges asymptotically at the switching point, breaking the real line in two half-lines, which leads asymptotically to the 1/2 gain on the spectral lower bound, and the t−1/2 gain on the decay rate in the original physical variables.This result is an adaptation to the case of strips with twisted boundary conditions of previous results by the authors on geometrically twisted Dirichlet tubes.     

Numerical null controllability of a semi-linear heat equation via a least squares method

This Note deals with the computation of distributed null controls for a semi-linear 1D heat equation, in the sublinear and slightly superlinear cases. Under sharp growth assumptions, the existence of controls has been obtained in [E. Fernández-Cara, E. Zuazua, Null and approximate controllability for weakly blowing up semi-linear heat equation, Ann. Inst. Henri Poincaré Analyse non linéaire 17 (5) (2000) 583] via a fixed point reformulation; see also [V. Barbu, Exact controllability of the superlinear heat equation, Appl. Math. Optim. Optimization, Theory and Applications 42 (1) (2000) 73]. More precisely, Carleman estimates and Kakutani?s theorem together ensure the existence of fixed points for a corresponding linearized control mapping. In practice, the difficulty is to extract from the Picard iterates a convergent (sub)sequence. We introduce and analyze a least squares reformulation of the problem; we show that this strategy leads to an effective and constructive way to compute fixed points.     

Due-window assignment with identical jobs on parallel uniform machines

A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs.     

Automatic generation of linear programming problems for computer aided instruction

The paper presents a method for generating random linear programming problems with a previously selected type of solution. The user can choose a problem whose solution is unbounded, bounded for minima, maxima or both, unique or multiple, with given structure, at wish. Initially, the feasible solution of the LPP is generated as the sum of a linear space, a cone, and a polytope, depending on the desired properties of the solution. With the aim of obtaining a simple set of constraints, the generators of these three structures are selected as random vectors with integer simple components, the range of which can be given. Next, an objective function that satisfies the required conditions, i.e. leads to a solution of the desired type, is obtained. The generating algorithms have been implemented in Mathematica and some illustrative examples are given to clarify the generation process. With this tool, a LPP can be generated, according to the instructor requirements, where this is a human or an expert system. They can control student progress and generate a sequence of problems covering all possible cases, in steps of increasing difficulty. Combining this tool with another (also produced by the same authors) that solves the problems and explains the whole process, step by step, a computer aided module for learning LPP, which is completely autonomous, can be easily obtained.