A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Skew Schubert polynomials

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron and Sottile in terms of certain increasing labeled chains in Bruhat order of the symmetric group. These skew Schubert polynomials expand in the basis of Schubert polynomials with nonnegative integer coefficients that are precisely the structure constants of the cohomology of the complex flag variety with respect to its basis of Schubert classes. We rederive the construction of Bergeron and Sottile in a purely combinatorial way, relating it to the construction of Schubert polynomials in terms of rc-graphs.

     

Minimal, rigid foliations by curves on ℂℙ n

We prove the existence of minimal and rigid singular holomorphic foliations by curves on the projective space ℂℙ ⁿ for every dimension n≥2 and every degree d≥2. Precisely, we construct a foliation ℱ which is induced by a homogeneous vector field of degree d, has a finite singular set and all the regular leaves are dense in the whole of ℂℙ ⁿ . Moreover, ℱ satisfies many additional properties expected from chaotic dynamics and is rigid in the following sense: if ℱ is conjugate to another holomorphic foliation by a homeomorphism sufficiently close to the identity, then these foliations are also conjugate by a projective transformation. Finally, all these properties are persistent for small perturbations of ℱ.?This is done by considering pseudo-groups generated on the unit ball 𝔹 ⁿ ⊆ℂ ⁿ by small perturbations of elements in Diff(ℂ ⁿ ,0). Under open conditions on the generators, we prove the existence of many pseudo-flows in their closure (for the C ⁰-topology) acting transitively on the ball. Dynamical features as minimality, ergodicity, positive entropy and rigidity may easily be derived from this approach. Finally, some of these pseudo-groups are realized in the transverse dynamics of polynomial vector fields in ℂℙ ⁿ . Received March 7, 2002 / final version received November 26, 2002?Published online February 7, 2003 Most of this work has been carried out during a visit of the first author to IMPA/RJ and a visit of the second author to the University of Lille 1. We would like to thank these institutes for hospitality and express our gratitude to CNPq-Brazil and CNRS-France for the financial support which made these visits possible. We are also indebted to Paulo Sad, Marcel Nicolau and the referee whose comments helped us to improve on the preliminary version. Finally, the second author has partially conducted this research for the Clay Mathematics Institute.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

The finite section method for Moore-Penrose inversion of Toeplitz operators

It is shown that for certain classes of infinite block Toeplitz matricesT(a)=[a _j-k ] ₀ the Moore-Penrose inverses of the finite sectionT _n (a)=[a _j-k ] ₀ ^n–1 converge to the Moore-Penrose inverse ofT(a). Furthermore the convergence for modified finite section methods and the finite section method for Wiener-Hopf integral and related operators are studied.     

The class reconstruction number of maximal planar graphs

The reconstruction numberrn(G) of a graphG was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphsG _i =G – v _i in the deck ofG which do not all appear in the deck of any other graph. For any graph theoretic propertyP, Harary defined theP-reconstruction number of a graph G P as the smallest number of theG _i in the deck ofG, which do not all appear in the deck of any other graph inP We now study the maximal planar graph reconstruction numberrn(G), proving that its value is either 1 or 2 and characterizing those with value 1.