LOCAL WELL-POSEDNESS AND ILL-POSEDNESS ON THE EQUATION OF TYPE □u = u^k（δu）^α

This paper undertakes a systematic treatment of the low regularity local wellposedness and ill-posedness theory in H^s and H^s for semilinear wave equations with polynomial nonlinearity in u and δu. This ill-posed result concerns the focusing type equations with nonlinearity on u and δtu.     

Bell’s Theorem,Many Worlds and Backwards-Time Physics: Not Just a Matter of Interpretation

The classic “Bell’s Theorem” of Clauser, Holt, Shimony and Horne tells us that we must give up at least one of: (1) objective reality (aka “hidden variables”); (2) locality; or (3) time-forwards macroscopic statistics (aka “causality”). The orthodox Copenhagen version of physics gives up the first. The many-worlds theory of Everett and Wheeler gives up the second. The backwards-time theory of physics (BTP) gives up the third. Contrary to conventional wisdom, empirical evidence strongly favors Everett-Wheeler over orthodox Copenhagen. BTP allows two major variations—a many-worlds version and a neoclassical version based on Partial Differential Equations (PDE), in the spirit of Einstein. Section 2 of this paper discusses the origins of quantum measurement according to BTP, focusing on the issue of how we represent condensed matter objects like polarizers in a model “Bell’s Theorem” experiment. The backwards time telegraph (BTT) is not ruled out in BTP, but is highly speculative for now, as will be discussed. The views herein are not anyone’s official views, but this does constitute work produced on government time.     

On existence and local attractivity of solutions of a quadratic Volterra integral equation of fractional order

In the paper we study the existence of solutions of a nonlinear quadratic Volterra integral equation of fractional order. This equation is considered in the Banach space of real functions defined, continuous and bounded on an unbounded interval. Moreover, we show that solutions of this integral equation are locally attractive.     

Constant memory routing in quasi-planar and quasi-polyhedral graphs

We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three-dimensional space. In two dimensions we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In the former case such graphs are geometrically embedded in R² and have an underlying backbone that is planar with convex faces; however within each face arbitrary edges (with arbitrary crossings) are allowed. In the latter case, these graphs are geometrically embedded in R³ and consist of a backbone of convex polyhedra and arbitrary edges within each polyhedron. In both cases we provide a routing algorithm that guarantees delivery. Our algorithms need only “remember” the source and destination nodes and one (respectively, two) reference nodes used to store information about the underlying face (respectively, polyhedron) currently being traversed. The existence of the backbone is used only in proofs of correctness of the routing algorithm; the particular choice is irrelevant and does not affect the behaviour of the algorithm.     

Brownian Chen series and Atiyah-Singer theorem

The purpose of this work is to give a new and short proof of the Atiyah-Singer local index theorem for the Dirac operator on the spin bundle. This proof is obtained by using heat semigroups approximations based on the truncation of Brownian Chen series.     

Complexity of local search for the p-median problem

We study the complexity of finding local minima for the p-median problem. The relationship between Swap local optima, 0–1 local saddle points, and classical Karush–Kuhn–Tucker conditions is presented. It is shown that the local search problems with some neighborhoods are tight PLS-complete. Moreover, the standard local descent algorithm takes exponential number of iterations in the worst case regardless of the tie-breaking and pivoting rules used. To illustrate this property, we present a family of instances where some local minima may be hard to find. Computational results with different pivoting rules for random and Euclidean test instances are discussed. These empirical results show that the standard local descent algorithm is polynomial in average for some pivoting rules.     

Necessary and Sufficient Conditions for the Boundedness of the Riesz Potential in Local Morrey-type Spaces

The problem of the boundedness of the Riesz potential I _α , 0 < α < n, in local Morrey-type spaces is reduced to the boundedness of the Hardy operator in weighted L _p -spaces on the cone of non-negative non-increasing functions. This allows obtaining sufficient conditions for the boundedness in local Morrey-type spaces for all admissible values of the parameters. Moreover, for a certain range of the parameters, these sufficient conditions coincide with the necessary ones. V. Guliyev’s research was partially supported by the grant of the Azerbaijan-U. S. Bilateral Grants Program II (project ANSF Award / AZM1-3110-BA-08) and the Turkish Scientific and Technological Research Council (TUBITAK, programme 2221, no. 220.01-619-4889).     

Two local search approaches for solving real-life car sequencing problems

The NP-hard problem of car sequencing appears as the heart of the logistic process of many car manufacturers. The subject of the ROADEF’2005 challenge addressed a car sequencing problem proposed by the car manufacturer RENAULT, more complex than the academic problem generally addressed in the literature. This paper describes two local search approaches for this problem. In the first part, a new approach by very large-scale neighborhood search is presented. This approach, designed during the qualification stage preceding the final, is based on an original integer linear programming formulation. The second part is dedicated to the approach which enabled us to win the ROADEF’2005 challenge. Inspired by the latest works on the subject, this one is based on very fast explorations of small neighborhoods. Our contribution here is mainly algorithmic, in particular by showing how much exploiting invariants speeds up the neighborhood evaluation and contributes to the diversification of the search. Finally, the two approaches are compared and discussed through an extensive computational study on RENAULT’s benchmarks. The main conclusion drawn at this point is that sophisticated metaheuristics are useless to solve car sequencing problems. More generally, our victory on ROADEF’2005 challenge demonstrates that algorithmic aspects, sometimes neglected, remain the key ingredients for designing and engineering high-performance local search heuristics.     

Embedding with a Lipschitz function

We investigate a new notion of embedding of subsets of {?1,1}ⁿ in a given normed space, in a way which preserves the structure of the given set as a class of functions on {1, …, n}. This notion is an extension of the margin parameter often used in Nonparametric Statistics. Our main result is that even when considering “small” subsets of {?1, 1}ⁿ, the vast majority of such sets do not embed in a better way than the entire cube in any normed space that satisfies a minor structural assumption. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

Smoothing of bump functions

Let X be a separable Banach space with a Schauder basis, admitting a continuous bump which depends locally on finitely many coordinates. Then X admits also a C^∞-smooth bump which depends locally on finitely many coordinates.