Non-free isometric immersions of Riemannian manifolds

Let (V, g) be a Riemannian manifold and let be the isometric immersion operator which, to a map , associates the induced metric on V, where denotes the Euclidean scalar product in . By Nash–Gromov implicit function theorem is infinitesimally invertible over the space of free maps. In this paper we study non-free isometric immersions . We show that the operator (where denotes the space of C ^∞- smooth quadratic forms on ) is infinitesimally invertible over a non-empty open subset of and therefore is an open map in the respective fine topologies.      

Chains and antichains in partial orderings

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is or , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two sets. Our main result is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering has the feature that for every , there is an infinite chain or antichain that is relative to , then we have uniform dichotomy: either for all copies of , there is an infinite chain that is relative to , or for all copies of , there is an infinite antichain that is relative to .     

Uniform central limit theorems for kernel density estimators

Let be the classical kernel density estimator based on a kernel K and n independent random vectors X _i each distributed according to an absolutely continuous law on . It is shown that the processes , , converge in law in the Banach space , for many interesting classes of functions or sets, some -Donsker, some just -pregaussian. The conditions allow for the classical bandwidths h _n that simultaneously ensure optimal rates of convergence of the kernel density estimator in mean integrated squared error, thus showing that, subject to some natural conditions, kernel density estimators are ‘plug-in’ estimators in the sense of Bickel and Ritov (Ann Statist 31:1033–1053, 2003). Some new results on the uniform central limit theorem for smoothed empirical processes, needed in the proofs, are also included.      

Parameterized partition relations on the real numbers

We consider several kinds of partition relations on the set of real numbers and its powers, as well as their parameterizations with the set of all infinite sets of natural numbers, and show that they hold in some models of set theory. The proofs use generic absoluteness, that is, absoluteness under the required forcing extensions. We show that Solovay models are absolute under those forcing extensions, which yields, for instance, that in these models for every well ordered partition of there is a sequence of perfect sets whose product lies in one piece of the partition. Moreover, for every finite partition of there is and a sequence of perfect sets such that the product lies in one piece of the partition, where is the set of all infinite subsets of X. The proofs yield the same results for Borel partitions in ZFC, and for more complex partitions in any model satisfying a certain degree of generic absoluteness. This work was supported by the research projects MTM 2005-01025 of the Spanish Ministry of Science and Education and 2005SGR-00738 of the Generalitat de Catalunya. A substantial part of the work was carried out while the second-named author was ICREA Visiting Professor at the Centre de Recerca Matemàtica in Bellaterra (Barcelona), and also during the first-named author’s stays at the Instituto Venezolano de Investigaciones Científicas and the California Institute of Technology. The authors gratefully acknowledge the support provided by these institutions.     

Categoricity of computable infinitary theories

Computable structures of Scott rank are an important boundary case for structural complexity. While every countable structure is determined, up to isomorphism, by a sentence of , this sentence may not be computable. We give examples, in several familiar classes of structures, of computable structures with Scott rank whose computable infinitary theories are each -categorical. General conditions are given, covering many known methods for constructing computable structures with Scott rank , which guarantee that the resulting structure is a model of an -categorical computable infinitary theory. Work on this paper began at the Workshop on Model Theory and Computable Structure Theory at University of Florida Gainesville, in February, 2007. The authors are grateful to the organizers of this workshop. They are also grateful for financial support from National Science Foundation grants DMS DMS 05-32644, DMS 05-5484. The second author is also grateful for the support of grants RFBR 08-01-00336 and NSc-335.2008.1.     

Degrees of difficulty of generalized r.e. separating classes

Important examples of classes of functions are the classes of sets (elements of ^ω 2) which separate a given pair of disjoint r.e. sets: . A wider class consists of the classes of functions f ∈ ^ω k which in a generalized sense separate a k-tuple of r.e. sets (not necessarily pairwise disjoint) for each k ∈ ω: . We study the structure of the Medvedev degrees of such classes and show that the set of degrees realized depends strongly on both k and the extent to which the r.e. sets intersect. Let denote the Medvedev degrees of those such that no m + 1 sets among A ₀,...,A _k-1 have a nonempty intersection. It is shown that each is an upper semi-lattice but not a lattice. The degree of the set of k-ary diagonally nonrecursive functions is the greatest element of . If 2 ≤ l < k, then 0 _M is the only degree in which is below a member of . Each is densely ordered and has the splitting property and the same holds for the lattice it generates. The elements of are exactly the joins of elements of for . Supported by National Science Foundation grants DMS 0554841, 0532644 and 0652732.     

Potential continuity of colorings

We say that a coloring is continuous if it is continuous with respect to some second countable topology on κ. A coloring c is potentially continuous if it is continuous in some -preserving extension of the set-theoretic universe. Given an arbitrary coloring , we define a forcing notion that forces c to be continuous. However, this forcing might collapse cardinals. It turns out that is c.c.c. if and only if c is potentially continuous. This gives a combinatorial characterization of potential continuity. On the other hand, we show that adding Cohen reals to any model of set theory introduces a coloring which is potentially continuous but not continuous. has no uncountable c-homogeneous subset in the Cohen extension, but such a set can be introduced by forcing. The potential continuity of c can be destroyed by some c.c.c. forcing. The research for this paper was supported by G.I.F. Research Grant No. I-802-195.6/2003. The author would like to thank Uri Abraham for very fruitful discussions on the subject of this article.     

Semilinear subelliptic problems with critical growth on Carnot groups

We prove existence and multiplicity of solutions for the semilinear subelliptic problem with critical growth in Ω, u = 0 on ∂Ω, where is a sublaplacian on a Carnot group , 2* = 2Q/(Q − 2) is the critical Sobolev exponent for and Ω is a bounded domain of .     

Threshold θ ≥ 2 contact processes on homogeneous trees

We study the threshold θ ≥ 2 contact process on a homogeneous tree of degree κ = b + 1, with infection parameter λ ≥ 0 and started from a product measure with density p. The corresponding mean-field model displays a discontinuous transition at a critical point and for it survives iff , where this critical density satisfies , . For large b, we show that the process on has a qualitatively similar behavior when λ is small, including the behavior at and close to the critical point . In contrast, for large λ the behavior of the process on is qualitatively distinct from that of the mean-field model in that the critical density has . We also show that , where 1 < Φ₂ < Φ₃ < ..., , and . The work of L.R.F. was partially supported by the Brazilian CNPq through grants 307978/2004-4 and 475833/2003-1, and by FAPESP through grant 04/07276-2. The work of R.H.S. was partially supported by the American N.S.F. through grant DMS-0300672.     

Effectively closed sets and enumerations

An effectively closed set, or class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of classes are shown to be mutually reducible via a computable permutation. Computable injective numberings are given for the family of classes and for the subclasses of decidable and of homogeneous classes. However no computable numberings exist for small or thin classes. No computable numbering of trees exists that includes all computable trees without dead ends. Research partially supported by National Science Foundation grants DMS 0554841, 0532644 and 0652732.     

A Slow Transient Diffusion in a Drifted Stable Potential

We consider a diffusion process X in a random potential of the form , where is a positive drift and is a strictly stable process of index with positive jumps. Then the diffusion is transient and converges in law towards an exponential distribution. This behaviour contrasts with the case where is a drifted Brownian motion and provides an example of a transient diffusion in a random potential which is as “slow” as in the recurrent setting.      

Anisotropic version of a theorem of H. Hopf

Given a positive function F on S ² which satisfies a convexity condition, we define a function for surfaces in which is a generalization of the usual mean curvature function. We prove that an immersed topological sphere in with = constant is the Wulff shape, up to translations and homotheties.      

Projective curves of degree=codimension+2

In this article we study nondegenerate projective curves of degree d which are not arithmetically Cohen-Macaulay. Note that for a rational normal curve and a point . Our main result is about the relation between the geometric properties of X and the position of P with respect to . We show that the graded Betti numbers of X are uniquely determined by the rank of P with respect to . In particular, X satisfies property N _2,p if and only if . Therefore property N _2,p of X is controlled by and conversely can be read off from the minimal free resolution of X. This result provides a non-linearly normal example for which the converse to Theorem 1.1 in (Eisenbud et al., Compositio Math 141:1460–1478, 2005) holds. Also our result implies that for nondegenerate projective curves of degree d which are not arithmetically Cohen–Macaulay, there are exactly distinct Betti tables.     

A note on morphic cohomology and algebraic cycles

We give examples of smooth projective complex varieties of dimension d ≥ 4 and primes ℓ such that the morphic cohomology group is infinite, and is not finitely generated as a rational vector space. In particular, for these examples the semi-topological K-group has infinite dimension.     

Totally geodesic shadow boundary submanifolds and a characterization for {\mathbb{S}}^n

We prove that the sphere is the only compact immersed hypersurface in Euclidean space each of whose shadow boundaries is a totally geodesic submanifold. Furthermore, we give conditions for the shadow boundary of a submanifold of to be regular. Received: 25 January 2007     

Quasiperiodic Group Factorizations

If is any ring or semi-ring (e.g., ) and G is a finite abelian group, two elements a, b of the group (semi-)ring are said to form a factorization of G if ab = rΣ _g∈G g for some . A factorization is called quasiperiodic if there is some element g ∈ G of order m > 1 such that either a or b – say b – can be written as a sum b ₀ + ... + b _m−1 of m elements of such that ab _h = g ^h ab ₀ for h = 0, ... , m − 1. Hajós [5] conjectured that all factorizations are quasiperiodic when and r = 1 but Sands [15] found a counterexample for the group . Here we show however that all factorizations of abelian groups are quasiperiodic when and that all factorizations of cyclic groups or of groups of the type are quasiperiodic when . We also give some new examples of non-quasiperiodic factorizations with for the smaller groups and . Received: May 12, 2006. Revised: October 3, 2007.     

Cyclicity of bicyclic operators and completeness of translates

We study cyclicity of operators on a separable Banach space which admit a bicyclic vector such that the norms of its images under the iterates of the operator satisfy certain growth conditions. A simple consequence of our main result is that a bicyclic unitary operator on a Banach space with separable dual is cyclic. Our results also imply that if is the shift operator acting on the weighted space of sequences , if the weight ω satisfies some regularity conditions and ω(n) = 1 for nonnegative n, then S is cyclic if . On the other hand one can see that S is not cyclic if the series diverges. We show that the question of Herrero whether either S or S* is cyclic on admits a positive answer when the series is convergent. We also prove completeness results for translates in certain Banach spaces of functions on .     

Partitions of large Rado graphs

Let κ be a cardinal which is measurable after generically adding many Cohen subsets to κ and let be the κ-Rado graph. We prove, for 2 ≤ m < ω, that there is a finite value such that the set [κ] ^m can be partitioned into classes such that for any coloring of any of the classes C _i in fewer than κ colors, there is a copy of in such that is monochromatic. It follows that , that is, for any coloring of with fewer than κ colors there is a copy of such that has at most colors. On the other hand, we show that there are colorings of such that if is any copy of then for all , and hence . We characterize as the cardinality of a certain finite set of types and obtain an upper and a lower bound on its value. In particular, and for m > 2 we have where r _m is the corresponding number of types for the countable Rado graph. Research of M. Džamonja and J. A. Larson were partially supported by Engineering and Physical Sciences Research Council and research of W. J. Mitchell was partly supported by grant number DMS 0400954 from the United States National Science Foundation.     

On commuting polynomial automorphisms of {\mathbb{C}}^{k} , k ≥ 3

We characterize the polynomial automorphisms of ${\mathbb{C}}^3We characterize the polynomial automorphisms of , which commute with a regular automorphism. We use their meromorphic extension to and consider their dynamics on the hyperplane at infinity. We conjecture the additional hypothesis under which the same characterization is true in all dimensions. We give a partial answer to a question of S. Smale that in our context can be formulated as follows: can any polynomial automorphism of be the uniform limit on compact sets of polynomial automorphisms with trivial centralizer (i.e. )? Partially supported by Progetto MURST di Rilevante Interesse Nazionale Proprietà geometriche delle varietà reali e complesse. Supported by Istituto Nazionale Alta Matematica, “F. Severi”, Roma and G.N.S.A.G.A., Roma.     

Complete surfaces of constant curvature in H<Superscript>2</Superscript> × R and S<Superscript>2</Superscript> × R

We study isometric immersions of surfaces of constant curvature into the homogeneous spaces and . In particular, we prove that there exists a unique isometric immersion from the standard 2-sphere of constant curvature c > 0 into and a unique one into when c > 1, up to isometries of the ambient space. Moreover, we show that the hyperbolic plane of constant curvature c < −1 cannot be isometrically immersed into or . J.A. Aledo was partially supported by Ministerio de Education y Ciencia Grant No. MTM2004-02746 and Junta de Comunidades de Castilla-La Mancha, grant no. PAI-05-034. J.M. Espinar and J.A. Gálvez were partially supported by Ministerio de Education y Ciencia grant no. MTM2004-02746 and Junta de Andalucía Grant No. FQM325.