Berezin transform on¶compact Hermitian symmetric spaces

Let X=G ^* be a compact Hermitian symmetric space. We study the Berezin transform on L ²(X) and calculate its spectrum under the decomposition of L ²(X) into the irreducible representations of G ^*. As applications we find the expansion of powers of the canonical polynomial (Bergman reproducing kernel for the canonical line bundle) in terms of the spherical polynomials on X, and we find the irreducible decomposition of tensor products of Bergman spaces on X. Received: 10 September 1996 / Revised version: 10 September 1997     

Poincaré’s inequalities and Talagrand’s concentration phenomenon for the exponential distribution

Summary. We present a simple proof, based on modified logarithmic Sobolev inequalities, of Talagrand’s concentration inequality for the exponential distribution. We actually observe that every measure satisfying a Poincaré inequality shares the same concentration phenomenon. We also discuss exponential integrability under Poincaré inequalities and its consequence to sharp diameter upper bounds on spectral gaps. Received: 10 June 1996 / In revised form: 9 August 1996     

To the spectral theory of Krein systems

We consider the Krein systems. For the set of Stummel class coefficients, we establish the criterion in terms of these coefficients for the system to satisfy the Szegö-type estimate on the spectral measure.     

Joint extension of two theorems of Kotzig on 3-polytopes

The weight of an edge in a graph is the sum of the degrees of its end-vertices. It is proved that in each 3-polytope there exists either an edge of weight at most 13 for which both incident faces are triangles, or an edge of weight at most 10 which is incident with a triangle, or else an edge of weight at most 8. All the bounds 13, 10, and 8 are sharp and attained independently of each other.     

Enumeration of three-dimensional convex polygons

A self-avoiding polygon (SAP) on a graph is an elementary cycle. Counting SAPs on the hypercubic lattice ℤ ^d withd≥2, is a well-known unsolved problem, which is studied both for its combinatorial and probabilistic interest and its connections with statistical mechanics. Of course, polygons on ℤ ^d are defined up to a translation, and the relevant statistic is their perimeter. A SAP on ℤ ^d is said to beconvex if its perimeter is “minimal”, that is, is exactly twice the sum of the side lengths of the smallest hyper-rectangle containing it. In 1984, Delest and Viennot enumerated convex SAPs on the square lattice [6], but no result was available in a higher dimension. We present an elementar approach to enumerate convex SAPs in any dimension. We first obtain a new proof of Delest and Viennot's result, which explains combinatorially the form of the generating function. We then compute the generating function for convex SAPs on the cubic lattice. In a dimension larger than 3, the details of the calculations become very cumbersome. However, our method suggests that the generating function for convex SAPs on ℤ ^d is always a quotient ofdifferentiably finite power series.     

Polyèdre de Newton et distributionf + s . II

Sans résumé

---