Arnold’s web and diffusion in the Stark-Quadratic-Zeeman problem

The Arnold web and the Arnold diffusion arise when an integrable Hamiltonian system is slightly perturbed: the first concerns the peculiar topology characterizing the set of the resonance lines in phase space, the latter the extremaly slow motion (if any) along these lines. While Arnold has proved the possibility of diffusion, it is still unknown if the phenomenon is generic in realistic physical systems. The system we consider is the Hydrogen atom (or Kepler problem) subject to the combined action of a constant electric and magnetic field, which is known as Stark-Zeeman problem. We describe the results of numerical experiments: the Arnold web is clearly highlighted and, looking at the behaviour of the KAM frequencies on orbits of 10⁸ revolutions, evidence for the diffusion existence is reached.      

Complexity of computing median linear orders and variants

Given a finite set X and a collection Π of linear orders defined on X, computing a median linear order (Condorcet-Kemenyʼs problem) consists in determining a linear order minimizing the remoteness from Π. This remoteness is based on the symmetric distance, and measures the number of disagreements between O and Π. In the context of voting theory, X can be considered as a set of candidates and the linear orders of Π as the preferences of voters, while a linear order minimizing the remoteness from Π can be adopted as the collective ranking of the candidates with respect to the votersʼ opinions. This paper studies the complexity of this problem and of several variants of it: computing a median order, computing a winner according to this method, checking that a given candidate is a winner and so on. We try to locate these problems inside the polynomial hierarchy.     

Extension of Isometries Between the Unit Spheres of Normed Space E and C（Ω）

In this paper, we study the extension of isometries between the unit spheres of normed space E and C（Ω）. We obtain that any surjective isometry between the unit spheres of normed space E and C（Ω） can be extended to be a linear isometry on the whole space E and give an affirmative answer to the corresponding Tingley＇s problem （where Ω be a compact metric space）.     

The Central Limit Problem for Random Vectors with Symmetries

Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are coordinatewise symmetric, uniform in a regular simplex, or spherically symmetric. Our proofs are based on Stein’s method of exchangeable pairs; as far as we know, this approach has not previously been used in convex geometry. The spherically symmetric case is treated by a variation of Stein’s method which is adapted for continuous symmetries. This work was done while at Stanford University.     

An algebraic foundation for factoring linear boundary problems

Motivated by boundary problems for linear differential equations, we define an abstract boundary problem as a pair consisting of a surjective linear map (“differential operator”) and an orthogonally closed subspace of the dual space (“boundary conditions”). Defining the composition of boundary problems corresponding to their Green’s operators in reverse order, we characterize and construct all factorizations of a boundary problem from a given factorization of the defining operator. For the case of ordinary differential equations, the main results can be made algorithmic. We conclude with a factorization of a boundary problem for the wave equation. This work was supported by the Austrian Science Fund (FWF) under the SFB grant F1322.     

Ordering in mechanical geometry theorem proving

Ordering in mechanical geometry theorem proving is studied from geometric viewpoint and some new ideas are proposed. For Thebault’s theorem which is the most difficult theorem that has ever been proved by Wu’s method, a very simple proof using Wu’s method under a linear order is discovered. Project supported by the National Natural Science Foundation of China.     

Problem of quality for a certain linear differential game with critical properties

A solution to the pursuit problem for one linear differential game, critical in the sense that it lies on the boundary of solvability of the approach and evasion problems, is given. The result thus obtained is used to answer two question connected with Pontryagin’s methods. Translated fromMatematicheskie Zametki, Vol. 67, No. 4, pp. 484–488, April, 2000.     

The Cauchy problem for operators with injective symbol in the Lebesgue space <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> in a domain

Let D be a bounded domain in ? ⁿ (n ≥ 2) with infinitely smooth boundary ?D. We give some necessary and sufficient conditions for the Cauchy problem to be solvable in the Lebesgue space L ²(D) in D for an arbitrary differential operator A having an injective principal symbol. Furthermore, using bases with double orthogonality, we construct Carleman’s formula that restores a (vector-)function in L ²(D) from the Cauchy data given on a relatively open connected set Γ ? ?D and the values Au in D whenever the data belong to L ²(Γ) and L ²(D) respectively.     

Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure

In this paper we consider a two-person zero-sum discounted stochastic game with ARAT structure and formulate the problem of computing a pair of pure optimal stationary strategies and the corresponding value vector of such a game as a vertical linear complementarity problem. We show that Cottle-Dantzig’s algorithm (a generalization of Lemke’s algorithm) can solve this problem under a mild assumption. Received July 8, 1998 / Revised version received April 16, 1999? Published online September 15, 1999     

Existence of Exact Penalty for Constrained Optimization Problems in Metric Spaces

In this paper we use the penalty approach in order to study constrained minimization problems in a complete metric space with locally Lipschitzian mixed constraints. A penalty function is said to have the exact penalty property if there is a penalty coefficient for which a solution of an unconstrained penalized problem is a solution of the corresponding constrained problem. In this paper we establish sufficient conditions for the exact penalty property.      

Blocking Visibility for Points in General Position

For a finite set P in the plane, let b(P) be the smallest possible size of a set Q, Q∩P=∅, such that every segment with both endpoints in P contains at least one point of Q. We raise the problem of estimating b(n), the minimum of b(P) over all n-point sets P with no three points collinear. We review results providing bounds on b(n) and mention some additional observations.     

Representation for the Green’s function of the Dirichlet problem for polyharmonic equations in a ball

We explicitly construct the Green’s function for the Dirichlet problem for polyharmonic equations in a ball in a space of arbitrary dimension. The formulas for the Green’s function are of interest in their own right. In particular, the explicit representations for a solution to the Dirichlet problem for the biharmonic equation are important in elasticity.     

Integrability of det△↓u and Evolutionary Wente＇s Problem Associated to Heat Operator

In this note, the authors resolve an evolutionary Wente's problem associated to heat equation, where the special integrability of det▽u for u ∈ H1(R2,R2) is used.     

A Survey of the Coupon Collector’s Problem with Random Sample Sizes

This paper surveys the coupon collector’s waiting time problem with random sample sizes and equally likely balls. Consider an urn containing m red balls. For each draw, a random number of balls are removed from the urn. The group of removed balls is painted white and returned to the urn. Several approaches to addressing this problem are discussed, including a Markov chain approach to compute the distribution and expected value of the number of draws required for the urn to contain j white balls given that it currently contains i white balls. As a special case, E[N], the expected number of draws until all the balls are white given that all are currently red is also obtained.      

On alternating analogues of Tornheim’s double series II

In this paper, we evaluate the alternating analogues of Tornheim’s double series. This is an answer to the problem posed by Subbarao-Sitaramachandrarao, and can be regarded as an alternating analogue of the evaluation formula for Tornheim’s double series, given by Huard, Williams and Z. Nan-Yue. We also evaluate partial Tornheim’s double series.      

Dual multiplicative algorithms for an entropy-linear programming problem

A multiplicative-barrier generalization of the Cauchy gradient descent method is proposed and studied. The technique is used to search for dual variables in the entropy maximization problem with affine constraints, which arises, for example, in the simulation of equilibria in macroscopic systems. For this class of problems, the dual variables can be used to effectively determine the primal ones. The global convergence of the iterative algorithms proposed is proved.     

Exact penalty property for a class of inequality-constrained minimization problems

We use the penalty approach in order to study constrained minimization problems. A penalty function is said to have the exact penalty property if there is a penalty coefficient for which a solution of an unconstrained penalized problem is a solution of the corresponding constrained problem. In this paper we establish the exact penalty property for a large class of inequality-constrained minimization problems.     

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Interest in linear programming has been intensified recently by Karmarkar’s publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review classical barrier-function methods for nonlinear programming based on applying a logarithmic transformation to inequality constraints. For the special case of linear programming, the transformed problem can be solved by a “projected Newton barrier” method. This method is shown to be equivalent to Karmarkar’s projective method for a particular choice of the barrier parameter. We then present details of a specific barrier algorithm and its practical implementation. Numerical results are given for several non-trivial test problems, and the implications for future developments in linear programming are discussed. The research of the Stanford authors was supported by the U.S. Department of Energy Contract DE-AA03-76SF00326, PA No. DE-AS03-76ER72018; National Science Foundation Grants DCR-8413211 and ECS-8312142; the Office of Naval Research Contract N00014-85-K-0343; and the U.S. Army Research Office Contract DAAG29-84-K-0156. The research of J.A. Tomlin was supported by Ketron, Inc. and the Office of Naval Research Contract N00014-85-C-0338.     

On hypothesis K for biquadrates

It is proved that the number of ways of expressing a large positive integern as the sum of four biquadrates is

The Gleason’s problem for some polyharmonic and hyperbolic harmonic function spaces

Let Ω ⊆ ℝⁿ be a bounded convex domain with C ² boundary. For 0 < p, q ⩽ ∞ and a normal weight φ, the mixed norm space H _k ^p,q,φ (Ω) consists of all polyharmonic functions f of order k for which the mixed norm ∥ · ∥_p,q,φ < ∞. In this paper, we prove that the Gleason’s problem (Ω, a, H _k ^p,q,φ ) is always solvable for any reference point a ∈ Ω. Also, the Gleason’s problem for the polyharmonic φ-Bloch (little φ-Bloch) space is solvable. The parallel results for the hyperbolic harmonic mixed norm space are obtained.