Strong electric field eigenvalue asymptotics for the Schrödinger operator with electromagnetic potential

We consider the Schrödinger operator with electric potential V, which decays at infinity, and magnetic potential A. We study the asymptotic behaviour for large values of the electric field coupling constant of the eigenvalues situated under the essential-spectrum lower bound. We concentrate on the cases of rapidly decaying V (e.g. V L ^m/2( ^m ) for m 3) and arbitrary A, or slowly decaying V (i.e. V(x |x|^– , (0,2), as |x| ) and magnetic potentials A corresponding to constant magnetic fields B = curl A.Partially supported by the Ministry of Culture, Science and Education under Grant No. 52.     

SDiff(2) Toda equation — Hierarchy,Tau function,and symmetries

A continuum limit of the Toda lattice field theory, called the SDiff(2) Toda equation, is shown to have a Lax formalism and an infinite hierarchy of higher flows. The Lax formalism is very similar to the case of the self-dual vacuum Einstein equation and its hyper-Kähler version, however now based upon a symplectic structure on a cylinderS ¹×R. An analogue of the Toda lattice tau function is introduced. The existence of hidden SDiff(2) symmetries are derived from a Riemann-Hilbert problem in the SDiff(2) group. Symmetries of the tau function turn out to have commutator anomalies, hence give a representation of a central extension of the SDiff(2) algebra.     

Representations of lie groups and multidimensional special functions

This work is devoted to the construction and investigation of two new classes of special functions, related to representations of groups of motions in the spaces of constant curvature as well as the unitary group of large ranks. These are special functions with matrix indices and some types of orthogonal polynomials in several continuous and discrete variables. The functions introduced generalize a number of classical scalar special functions in one variable.     

Small transversals in hypergraphs

For each positive integerk, we consider the setA _k of all ordered pairs [a, b] such that in everyk-graph withn vertices andm edges some set of at mostam+bn vertices meets all the edges. We show that eachA _k withk2 has infinitely many extreme points and conjecture that, for every positive , it has only finitely many extreme points [a, b] witha. With the extreme points ordered by the first coordinate, we identify the last two extreme points of everyA _k , identify the last three extreme points ofA ₃, and describeA ₂ completely. A by-product of our arguments is a new algorithmic proof of Turán's theorem.     

Dirichlet norms,capacities and generalized isoperimetric inequalities for Markov operators

We define the notion of p-capacity for a reversible Markov operator on a general measure space and prove that uniform estimates for the ratio of capacity and measure are equivalent to certain imbedding theorems for the Orlicz and Dirichlet norms. As a corollary we get results on connections between embedding theorems and isoperimetric properties for general Markov operators and, particularly, a generalization of the Kesten theorem on the spectral radius of random walks on amenable groups for the case of arbitrary graphs with non-finitely supported transition probabilities.     

Partially finite convex programming,Part I: Quasi relative interiors and duality theory

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.     

Convex hull of powers of a complex number,trinomial equations and the Farey sequence

The color of a complex number is defined as the number of vertices of the convex hull of powers of that number. This induces a coloring of the unit disk. The structure of the set of points where the color changes is investigated here. It is observed that there is a connection between this fractal set and some family of trinomial equations. Three algorithms for coloring the unit disk are described, the last one (related to the Farey sequence) arising out of a conjecture. This conjecture is formulated and proved in this presentation.     

A non-linear version of Hunt-Lion's theorem from the point of view of T-accretivity

In the classical topological context, Dellacherie [10] has given a non-linear version of Hunt's theorem characterizing the proper kernels verifying the complete maximum principle as those closing a submarkovian resolvent. In this paper we study the relation between this non-linear version of Hunt's theorem and T-accretivity.     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008     

Oscillations of certain second order nonlinear differential equations

A second order nonlinear differential equation