Ergodic theory of amenable semigroup actions

In this paper, among other things, we state and prove the mean ergodic theorem for amenable semigroup algebras.     

Commutators of singular integrals on spaces of homogeneous type

In this work we prove some sharp weighted inequalities on spaces of homogeneous type for the higher order commutators of singular integrals introduced by R. Coifman, R. Rochberg and G. Weiss in Factorization theorems for Hardy spaces in several variables, Ann. Math. 103 (1976), 611–635. As a corollary, we obtain that these operators are bounded on L ^p (w) when w belongs to the Muckenhoupt’s class A _p , p > 1. In addition, as an important tool in order to get our main result, we prove a weighted Fefferman-Stein type inequality on spaces of homogeneous type, which we have not found previously in the literature.     

Symplectic Generating Functions and Moyal Products

We introduce an affine-invariant version of generating functions of symplectic transformations of affine symplectic spaces, together with a generalization for other symmetric symplectic spaces. The composition of these functions has a nice connection with the Moyal product.     

On error operators related to the arbitrary functions principle

The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the “arbitrary functions principle” (Poincaré, Hopf). We give extensions of this property to Rd and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics.     

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming

We discuss issues pertaining to the domination from above of the second-stage recourse function of a stochastic linear program and we present a scheme to majorize this function using a simpler sublinear function. This majorization is constructed using special geometrical attributes of the recourse function. The result is a proper, simplicial function with a simple characterization which is well-suited for calculations of its expectation as required in the computation of stochastic programs. Experiments indicate that the majorizing function is well-behaved and stable.     

Stochastic algorithms with armijo stepsizes for minimization of functions

Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex _i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex _i+1. For an appropriate optimality function , corresponding to an optimality condition, it is shown that, ifn(i) , then (x _i) 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied.     

Continuity properties of the normal cone to the level sets of a quasiconvex function

Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)^–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x _n)}, where {x _n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.     

Convergence of dynamical zeta functions

I study poles and zeros of zeta functions in one-dimensional maps. Numerical and analytical arguments are given to show that the first pole of one such zeta function is given by the first zero ofanother zeta function: this describes convergence of the calculations of the first zero, which is generally the physically interesting quantity. Some remarks on how these results should generalize to zeta functions of dynamical systems with pruned symbolic dynamics and in higher dimensions follow.     

On a point of order

A method of using algebraic curves to obtain estimates of critical points accurate enough to identify them as simple algebraic numbers (if that is what they are) is discussed and illustrated with an application to the (q-state Potts model on the triangular lattice for cases of pure two-site interactions and pure three-site interactions. In the latter case the critical point is conjectured to be . In a similar conjecture for the critical percolation probability on thedirected square lattice,q _c ^1/2 (q _c +3)=2(q _c +p _c =1).     

On concepts of directional differentiability

Various definitions of directional derivatives in topological vector spaces are compared. Directional derivatives in the sense of Gâteaux, Fréchet, and Hadamard are singled out from the general framework of -directional differentiability. It is pointed out that, in the case of finite-dimensional spaces and locally Lipschitz mappings, all these concepts of directional differentiability are equivalent. The chain rule for directional derivatives of a composite mapping is discussed.