On the distribution of imaginary parts of zeros of the Riemann zeta function,II

We continue our investigation of the distribution of the fractional parts of αγ, where α is a fixed non-zero real number and γ runs over the imaginary parts of the non-trivial zeros of the Riemann zeta function. We establish some connections to Montgomery’s pair correlation function and the distribution of primes in short intervals. We also discuss analogous results for a more general L-function. The first author is supported by National Science Foundation Grant DMS-0555367. The second author is partially supported by the National Science Foundation and the American Institute of Mathematics (AIM). The third author is supported by National Science Foundation Grant DMS-0456615.     

Existence of Z-cyclic 3PDTWh(<Emphasis Type="Italic">p</Emphasis>) for Prime <Emphasis Type="Italic">p</Emphasis> ≡ 1 (mod 4)

A directed triplewhist tournament on p players over Z _p is said to have the three-person property if no two games in the tournament have three common players. We briefly denote such a design as a 3PDTWh(p). In this paper, we investigate the existence of a Z-cyclic 3PDTWh(p) for any prime p ≡ 1 (mod 4) and show that such a design exists whenever p ≡ 5, 9, 13 (mod 16) and p ≥ 29. This result is obtained by applying Weil’s theorem. In addition, we also prove that a Z-cyclic 3PDTWh(p) exists whenever p ≡ 1 (mod 16) and p < 10, 000 except possibly for p = 257, 769. Gennian Ge’s Research was supported by National Natural Science Foundation of China under Grant No. 10471127, Zhejiang Provincial Natural Science Foundation of China under Grant No. R604001, and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.     

A Class of Inverse Dominant Problems under Weighted l ∞ Norm and an Improved Complexity Bound for Radzik’s Algorithm

In this paper, we first discuss a class of inverse dominant problems under weighted l_∞ norm, which is how to change the original weights of elements with bounds in a finite ground set so that a given set becomes a weakly dominant set with respect to a given collection of subsets under the new weights and the largest change of the weights is minimum. This model includes a large class of improvement problems in combinatorial optimization. We propose a Newton-type algorithm for the model. This algorithm can solve the model in strongly polynomial time if the subproblem involved is solvable in strongly polynomial time. In the second part of the paper, we improve the complexity bound for Radzik’s Newton-type method which is designed to solve linear fractional combinatorial optimization problems. As Radzik’s method is closely related to our algorithm, this bound also estimates the complexity of our algorithm. Supported by the Hong Kong Universities Grant Council (CERG CITYU 9040883 and 9041091). Xiaoguang Yang - The author is also grateful for the support by the National Key Research and Development Program of China (Grant No. 2002CB312004) and the National Natural Science Foundation of China (Grant No. 70425004).     

L p -dual Quermassintegral sums

In this paper, we first introduce a concept of L _p -dual Quermassintegral sum function of convex bodies and establish the polar projection Minkowski inequality and the polar projection Aleksandrov-Fenchel inequality for L _p -dual Quermassintegral sums. Moreover, by using Lutwak’s width-integral of index i, we establish the L _p -Brunn-Minkowski inequality for the polar mixed projection bodies. As applications, we prove some interrelated results. This work was partially supported by the National Natural Science Foundation of China (Grant No. 10271071), Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605065) and Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

Conic mixed-integer rounding cuts

A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve either second-order conic programming or linear programming relaxations of conic integer programs at the nodes of the branch-and-bound tree. Central to our approach is a reformulation of the second-order conic constraints with polyhedral second-order conic constraints in a higher dimensional space. In this representation the cuts we develop are linear, even though they are nonlinear in the original space of variables. This feature leads to a computationally efficient implementation of nonlinear cuts for conic mixed-integer programming. The reformulation also allows the use of polyhedral methods for conic integer programming. We report computational results on solving unstructured second-order conic mixed-integer problems as well as mean–variance capital budgeting problems and least-squares estimation problems with binary inputs. Our computational experiments show that conic mixed-integer rounding cuts are very effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs and, hence, improving their solvability. This research has been supported, in part, by Grant # DMI0700203 from the National Science Foundation.     

Kolmogorov＇s ε-Entropy of Bounded Sets in Discrete Spaces and Attractors of Dissipative Lattice Systems

We obtain an estimate of the upper bound for Kolmogorov＇s ε-entropy for the bounded sets with small ＂tail＂ in discrete spaces, then we present a sufficient condition for the existence of a global attractor for dissipative lattice systems in a reflexive Banach discrete space and establish an upper bound of Kolmogorov＇s ε-entropy of the global attractor for lattice systems.     

Sample-path optimality and variance-maximization for Markov decision processes

This paper studies both the average sample-path reward (ASPR) criterion and the limiting average variance criterion for denumerable discrete-time Markov decision processes. The rewards may have neither upper nor lower bounds. We give sufficient conditions on the system’s primitive data and under which we prove the existence of ASPR-optimal stationary policies and variance optimal policies. Our conditions are weaker than those in the previous literature. Moreover, our results are illustrated by a controlled queueing system. Research partially supported by the Natural Science Foundation of Guangdong Province (Grant No: 06025063) and the Natural Science Foundation of China (Grant No: 10626021).     

On the Rankin-Selberg problem: higher power moments of the Riesz mean error term

LetΔ_1(x;φ) be the error term of the first Riesz mean of the Rankin-Selberg problem. We study the higher power moments ofΔ_1(x;φ) and derive an asymptotic formula for the 3-rd, 4-th and 5-th power moments by using Ivic's large value arguments and other techniques.     

Approximation of analytic functions with prescribed boundary conditions by circle-packing maps

We use recent advances in circle-packing theory to develop a constructive method for the approximation of an analytic functionF: Ω →C by circle packing maps providing we have only been given ΩF’_dΩ, and the set of critical points ofF. This extends the earlier results of Carter and Rodin and of Colin de Verdière and Mathéus, for functionsF with no critical points. The author gratefully acknowledges support of the Tennessee Science Alliance and the National Science Foundation. Research at MSRI is supported in part by Grant No. DMS-9022140.     

A whitehead theorem for long towers of spaces

We show that one can construct the universalR-homology isomorphismK →E _RX of Bousfield [1] by a transfinite iteration of an elementary homology correction map. This correction map is essentially the same as the one used classically to define Adams spectral sequence. This yields a topological characterization of the class of local spaces as the smallests containingK(A, n)’s and closed under homotopy inverse limit. This research was partially supported by the National Science Foundation, Grant # MCS76-08795, and by the U.S.-Israel Bi-National Science Foundation Grant # 680.     

Smoothing Trust Region Methods for Nonlinear Complementarity Problems with P 0-Functions

By using the Fischer–Burmeister function to reformulate the nonlinear complementarity problem (NCP) as a system of semismooth equations and using Kanzow’s smooth approximation function to construct the smooth operator, we propose a smoothing trust region algorithm for solving the NCP with P ₀ functions. We prove that every accumulation point of the sequence generated by the algorithm is a solution of the NCP. Under a nonsingularity condition, local Q-superlinear/Q-quadratic convergence of the algorithm is established without the strict complementarity condition. This work was partially supported by the Research Grant Council of Hong Kong and the National Natural Science Foundation of China (Grant 10171030).     

Weak Morrey spaces and strong solutions to the Navier-Stokes equations

We consider the Cauchy problem of Navier-Stokes equations in weak Morrey spaces. We first define a class of weak Morrey type spaces Mp*,λ(Rn) on the basis of Lorentz space Lp,∞ = Lp*(Rn)(in particular, Mp*,0(Rn) = Lp,∞, if p ＞ 1), and study some fundamental properties of them; Second,bounded linear operators on weak Morrey spaces, and establish the bilinear estimate in weak Morrey spaces. Finally, by means of Kato's method and the contraction mapping principle, we prove that the Cauchy problem of Navier-Stokes equations in weak Morrey spaces Mp*,λ(Rn) (1＜p≤n) is time-global well-posed, provided that the initial data are sufficiently small. Moreover, we also obtain the existence and uniqueness of the self-similar solution for Navier-Stokes equations in these spaces, because the weak Morrey space Mp*,n-p(Rn) can admit the singular initial data with a self-similar structure. Hence this paper generalizes Kato's results.     

A generalization of Müller’s iteration method based on standard information

For finding a root of a function f, Müler’s method is a root-finding algorithm using three values of f in every step. The natural values available are values of f and values of its first number of derivatives, called standard information. Based on standard information, we construct an iteration method with maximal order of convergence. It is a natural generalization of Müller’s iteration method. This work was partially supported by National Natural Science Foundation of China (Grant No. 10471128), NSFC (Grant No. 10731060).     

Remarks on generators of analytic semigroups

This paper contains two new characterizations of generators of analytic semigroups of linear operators in a Banach space. These characterizations do not require use of complex numbers. One is used to give a new proof that strongly elliptic second order partial differential operators generate analytic semigroups inL ^p , 1<p<∞, while the sufficient condition in the other characterization is meaningful in the case of nonlinear operators. Sponsored by the United States Army under Contract No. DAAG29-75-C-0024 and the National Science Foundation under Grant No. MCS78-01245.     

The Fredholm index of a pair of commuting operators

This paper concerns Fredholm theory in several variables, and its applications to Hilbert spaces of analytic functions. One feature is the introduction of ideas from commutative algebra to operator theory. Specifically, we introduce a method to calculate the Fredholm index of a pair of commuting operators. To achieve this, we define and study the Hilbert space analogs of Samuel multiplicities in commutative algebra. Then the theory is applied to the symmetric Fock space. In particular, our results imply a satisfactory answer to Arveson’s program on developing a Fredholm theory for pure d-contractions when d = 2, including both the Fredholmness problem and the calculation of indices. We also show that Arveson’s curvature invariant is in fact always equal to the Samuel multiplicity for an arbitrary pure d-contraction with finite defect rank. It follows that the curvature is a similarity invariant. Received: October 2004 Revision: May 2005 Accepted: May 2005 Partially supported by National Science Foundation Grant DMS 0400509.     

<Emphasis Type="Italic">W</Emphasis><Superscript>1,<Emphasis Type="Italic">p</Emphasis></Superscript>(R<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)-boundedness for maximal functions

In this paper, we get W ^1,p (R ⁿ )-boundedness for tangential maximal function and nontangential maximal function, which improves J.Kinnunen, P.Lindqvist and Tananka’s results. Supported by the key Academic Discipline of Zhejiang Province of China under Grant No.2005 and the Zhejiang Provincial Natural Science Foundation of China.     

A Characterization of Generalized Monotone Normed Cones

Let C be a cone and consider a quasi-norm p defined on it. We study the structure of the couple （C, p） as a topological space in the case where the function p is also monotone. We characterize when the topology of a quasi-normed cone can be defined by means of a monotone norm. We also define and study the dual cone of a monotone normed cone and the monotone quotient of a general cone. We provide a decomposition theorem which allows us to write a cone as a direct sum of a monotone subcone that is isomorphic to the monotone quotient and other particular subcone.     

Invariance and efficiency of convex representations

We consider two notions for the representations of convex cones G-representation and lifted-G-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation. We first study the basic properties of these representations. We show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, we prove that lifted-G-representation is closed under duality when the representing cone is self-dual. We also prove that strict complementarity of a convex optimization problem in conic form is preserved under G-representations. Then we move to study efficiency measures for representations. We evaluate the representations of homogeneous convex cones based on the “smoothness” of the transformations mapping the central path of the representation to the central path of the represented optimization problem. Research of the first author was supported in part by a grant from the Faculty of Mathematics, University of Waterloo and by a Discovery Grant from NSERC. Research of the second author was supported in part by a Discovery Grant from NSERC and a PREA from Ontario, Canada.     

Diameter,width, closest line pair,and parametric searching

We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improved solutions for them. We obtain, for any fixed ε>0, anO(n ^1+ε) algorithm for computing the diameter of a point set in 3-space, anO(^8/5+ε) algorithm for computing the width of such a set, and onO(n ^8/5+ε) algorithm for computing the closest pair in a set ofn lines in space. All these algorithms are deterministic. Work by Bernard Chazelle was supported by NSF Grant CCR-90-02352. Work by Herbert Edelsbrunner was supported by NSF Grant CCR-89-21421. Work by Leonidas Guibas and Micha Sharir was supported by a grant from the U.S.-Israeli Binational Science Foundation. Work by Micha Sharir was also supported by ONR Grant N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.     

Uniqueness and stability in an inverse problem for a Poisson’s equation

Consider the Poisson's equation ψ" (x) ＝ -ev-ψ eψ-v-N(x) with the Dirichlet boundary data, and we mainly investigate the inverse problem of determining the unknown function N(x) from a parameter function family. Some uniqueness and stability results in the inverse problem are obtained.