Nonlocal superconductivity

The research of D. Brandon was partially supported by the National Science Foundation through grant # DMS-9296011 and by the Army Research Office and the National Science Foundation through the Center for Nonlinear Analysis.     

Computability by means of effectively definable schemes and definability via enumerations

Research partially supported by the Committee for Science at the Council of Ministers, Contract #247, 1987     

Vertical decomposition of arrangements of hyperplanes in four dimensions

We show that, for any collection ℋ ofn hyperplanes in ℜ⁴, the combinatorial complexity of thevertical decomposition of the arrangementA(ℋ) of ℋ isO(n ⁴ logn). The proof relies on properties of superimposed convex subdivisions of 3-space, and we also derive some other results concerning them. Work on this paper by Leonidas Guibas and Micha Sharir has been supported by a grant from the U.S.-Israeli Binational Science Foundation. Work by Leonidas Guibas was also supported by National Science Foundation Grant CCR-9215219. Work by Micha Sharir was also supported by National Science Foundation Grant CCR-91-22103, and by grants from the G.I.F.—the German Isreali Foundation for Scientific Research and Development, and the Fund for Basic Research administered by the Israeli Academy of Sciences. Work by Jiří Matouŝek was done while he was visiting Tel Aviv University, and its was partially supported by a Humboldt Research Fellowship. Work on this paper by Dan Halperin was carried out while he was at Tel Aviv University.     

Perturbation of operators and applications to frame theory

A celebrated classical result states that an operator U on a Banach space is invertible if it is close enough to the identity operator I in the sense that ‖I−U‖<1. Here we show that U actually is invertible under a much weaker condition. As an application we prove new theorems concerning stability offrames (and frame-like decompositions) under perturbation in both Hilbert spaces and Banach spaces. The first named author is partially supported by grants from the U.S. National Science Foundation (grant no. NSF DMS-9201357), the Danish Natural Science Research Council (Grant no. 9401598), and grants from the University of Missouri System Research Board, and the MU Research Council. The second named author thanks the University of Missouri for its hospitality during a visit, where the first draft of the paper was written.     

Superrigidity,ratner’s theorem,and fundamental groups

We discuss the implications of superrigidity and Ratner’s theorem on invariant measures on homogeneous spaces for understanding the fundamental group of manifolds with an action of a semisimple Lie group. Research partially supported by the National Science Foundation and the Israel-U.S. Binational Science Foundation.     

Local Linear Convergence for Alternating and Averaged Nonconvex Projections

The idea of a finite collection of closed sets having “linearly regular intersection” at a point is crucial in variational analysis. This central theoretical condition also has striking algorithmic consequences: in the case of two sets, one of which satisfies a further regularity condition (convexity or smoothness, for example), we prove that von Neumann’s method of “alternating projections” converges locally to a point in the intersection, at a linear rate associated with a modulus of regularity. As a consequence, in the case of several arbitrary closed sets having linearly regular intersection at some point, the method of “averaged projections” converges locally at a linear rate to a point in the intersection. Inexact versions of both algorithms also converge linearly. Research of A.S. Lewis supported in part by National Science Foundation Grant DMS-0504032. Research of D.R. Luke supported in part by National Science Foundation Grant DMS-0712796.     

Euler factor of a certain dirichlet series attached to siegel eisenstein Series

We give an explicit form of a “good” Euler factor of a certain Dirichlet series attached to the Siegel-Eisenstein series. The author was partially supported by Grant-in-Aid for Scientific Research, the Ministry of Education, Science, Sports and Culture, Japan.     

On the number of views of polyhedral terrains

We show that the number of topologically different orthographic views of a polyhedral terrain withn edges isO(n ^5+ɛ ), and that the number of topologically different perspective views of such a terrain isO(n ^8+ɛ ), for any ɛ>0. Both bounds are almost tight in the worst case. The proofs are simple consequences of the recent almost-tight bounds of [11] on the complexity of lower envelopes in higher dimensions. Pankaj Agarwal has been supported by National Science Foundation Grant CCR-91-06514. Micha Sharir has been supported by National Science Foundation Grant CCR-91-22103, and by grants from the U.S.—Israeli Binational Science Foundation, the G.I.F.—the German Israeli Foundation for Scientific Research and Development- and the Fund for Basic Research administered by the Israeli Academy of Sciences.     

Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints

In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints introduced by Birbil et al. (Math Oper Res 31:739–760, 2006). Firstly, by means of a Monte Carlo method, we obtain a nonsmooth discrete approximation of the original problem. Then, we propose a smoothing method together with a penalty technique to get a standard nonlinear programming problem. Some convergence results are established. Moreover, since quasi-Monte Carlo methods are generally faster than Monte Carlo methods, we discuss a quasi-Monte Carlo sampling approach as well. Furthermore, we give an example in economics to illustrate the model and show some numerical results with this example. The first author’s work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science and SRF for ROCS, SEM. The second author’s work was supported in part by the United Kingdom Engineering and Physical Sciences Research Council grant. The third author’s work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science.     

Minkowski’s Second Theorem over a Simple Algebra

We generalize the notion of successive minima, Minkowski’s second theorem and Siegel’s lemma to a free module over a simple algebra whose center is a global field. The author was partly supported by the Grant-in-Aid for Scientific Research (C), Japan Society for the Promotion of Science.     

On critical orientations in the kedem-sharir motion planning algorithm

We discuss a technical problem arising in the motion planning algorithm of Kedem and Sharir [KS], and propose a way to overcome it without increasing the asymptotic complexity of the algorithm The first author was supported by the Eshkol Grant 04601-90 from the Israeli Ministry of Science and Technology. The second author was partly supported by the Fund for Basic Research administered by the Israeli Academy of Sciences, by National Science Foundation Grants CCR-91-22103 and CCR-93-11127, and by grants from the U.S.-Israeli Binational Science Foundation, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development. The third author was partly supported by the Interdisciplinary Program at Tel-Aviv University. The third author’s current address is: Department of Computer Science, MIT, Boston, MA, USA.     

Fast matrix multiplication is stable

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of Bini and Lotti [Numer. Math. 36:63–72, 1980]. As a consequence of our analysis, we show that the exponent of matrix multiplication (the optimal running time) can be achieved by numerically stable algorithms. We also show that new group-theoretic algorithms proposed in Cohn and Umans [Foundations of Computer Science, 44th Annual IEEE Symposium, pp. 438–449, 2003] and Cohn et al. [Foundations of Computer Science, 46th Annual IEEE Symposium, pp. 379–388, 2005] are all included in the class of algorithms to which our analysis applies, and are therefore numerically stable. We perform detailed error analysis for three specific fast group-theoretic algorithms. J. Demmel acknowledges support of NSF under grants CCF-0444486, ACI-00090127, CNS-0325873 and of DOE under grant DE-FC02-01ER25478. I. Dumitriu acknowledges support of the Miller Institute for Basic Research in Science. R. Kleinberg is supported by an NSF Mathematical Sciences Postdoctoral Research Fellowship     

Asymptotic Behavior of Solutions to a Class of Systems of Delay Differential Equations

The authors investigate the asymptotic behavior of solutions to a class of systems of delay differential equations. It is shown that every bounded solution of such a class of systems tends to a constant vector as t→∞. Our results improve and extend some corresponding ones already known.     

Some matrix equations over a finite field

Summary Explicit formulas are found for the number of solutions over a finite field of several matrix equations, for example:X′A+A′X=B. Conditons for solvability are also given. The research for thispaper was supported by National Science Foundation Research Grant G-2990.     

An application of the mellin-barnes type of integral to the mean square ofl-functions

The mean square of all DirichletL-functions (modq), in the form (2.1) given below, will be investigated. We establish full asymptotic expansions for (2.1) (see Theorems 1 and 2) by introducing the Mellin-Barnes type of integral formula (3.4) for the infinite double sum (3.2). Our treatment of (2.1) becomes, by virtue of (3.4), considerably simpler than the existing methods. Further improvments (Theorems A and B) are also given. Research supported by Grant-in-Aid for Scientific Research (No. 07740035), Ministry of Education, Science, Sports, and Culture, Japan. Department of Mathematics and Computer Science, Kagoshima University, Korimoto, Kagoshima 890–0065, Japan. Published in Lietuvos Matematikos Rinkinys, Vol. 38, No. 1, pp. 98–112, January–March, 1998.     

BIMATCHING DESIGNS

A collection of k-matchings of bipartite graph Kn1n with the property that every pair of independent edges lies in exactly λ of the k-matchings is called a BIMATCH(n, k, λ)-design. Existences and constructions for various BIMATCH (n, k, λ)-designs are given.     

From the Hele-Shaw Experiment to Integrable Systems: A Historical Overview

This paper is a historical overview of the development of the topic now commonly known as Laplacian Growth, from the original Hele-Shaw experiment to the modern treatment based on integrable systems. Supported by the grant of the Norwegian Research Council #177355/V30, and by the European Science Foundation Research Networking Programme HCAA.     

Some results for a finite family of uniformly L-Lipschitzian mappings in Banach spaces

The purpose of this paper is to prove a strong convergence theorem for a finite family of uniformly L-Lipschitzian mappings in Banach spaces. The results presented in the paper improve and extend some recent results in Chang [1], Cho et al. [2] Ofoedu [5], Schu [7] and Zeng [8, 9]. The present studies were supported by “the Natural Science Foundation of China (No. 10771141),” the Natural Science Foundation of Zhejiang Province (Y605191), the Natural Science Foundation of Heilongjiang Province (A0211), the Scientific Research Foundation from Zhejiang Province Education Committee (20051897).     

Quadrature formulae with multiple nodes and a maximal trigonometric degree of exactness

In this paper we consider interpolatory quadrature formulae with multiple nodes, which have the maximal trigonometric degree of exactness. Our approach is based on a procedure given by Ghizzeti and Ossicini (Quadrature formulae, Academie-Verlag, Berlin, 1970). We introduce and consider the so-called σ-orthogonal trigonometric polynomials of semi-integer degree and give a numerical method for their construction. Also, some numerical examples are included. The authors were supported in part by the Serbian Ministry of Science and Technological Development (Project: Orthogonal Systems and Applications, grant number #144004) and the Swiss National Science Foundation (SCOPES Joint Research Project No. IB7320-111079 “New Methods for Quadrature”).     

NEW EXACT TRAVELLING WAVE SOLUTIONS TO THREE NONLINEAR EVOLUTION EQUATIONS

Based on the computerized symbolic computation, some new exact travelling wave solutions to three nonlinear evolution equations are explicitly obtained by replacing the tanhξ in tanh-function method with the solutions of a new auxiliary ordinary differential equation.