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.     

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.     

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.     

The Stokes operator in weighted Lq-spaces II: weighted resolvent estimates and maximal Lp-regularity

In this paper we establish a general weighted L ^q -theory of the Stokes operator in the whole space, the half space and a bounded domain for general Muckenhoupt weights . We show weighted L ^q -estimates for the Stokes resolvent system in bounded domains for general Muckenhoupt weights. These weighted resolvent estimates imply not only that the Stokes operator generates a bounded analytic semigroup but even yield the maximal L ^p -regularity of in the respective weighted L ^q -spaces for arbitrary Muckenhoupt weights . This conclusion is archived by combining a recent characterisation of maximal L ^p -regularity by -bounded families due to Weis [Operator-valued Fourier multiplier theorems and maximal L _p -regularity. Preprint (1999)] with the fact that for L ^q -spaces -boundedness is implied by weighted estimates.     

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.     

Quasilinearization and curvature of Aleksandrov spaces

We present a new distance characterization of Aleksandrov spaces of non-positive curvature. By introducing a quasilinearization for abstract metric spaces we draw an analogy between characterization of Aleksandrov spaces and inner product spaces; the quasi-inner product is defined by means of the quadrilateral cosine—a metric substitute for the angular measure between two directions at different points. Our main result states that a geodesically connected metric space is an Aleksandrov domain (also known as a CAT(0) space) if and only if the quadrilateral cosine does not exceed one for every two pairs of distinct points in . We also observe that a geodesically connected metric space is an domain if and only if, for every quadruple of points in , the quadrilateral inequality (known as Euler’s inequality in ) holds. As a corollary of our main result we give necessary and sufficient conditions for a semimetric space to be an domain. Our results provide a complete solution to the Curvature Problem posed by Gromov in the context of metric spaces of non-positive curvature.      

Certain invariants of extension algebras of C({\mathbb{T}}^{2})

In this paper, we compute certain invariants of extension algebras of the torus algebra by , where is the C*-algebra of compact operators on an infinite dimensional separable Hilbert space H. These extension algebras are also constructed up to isomorphism. Received: 5 July 2007, Revised: 14 February 2008     

On the Circumference of 2-Connected $$\mathcal{P}_{3}$$-Dominated Graphs

Let G be a connected graph. For at distance 2, we define , and , if then . G is quasi-claw-free if it satisfies , and G is P ₃-dominated() if it satisfies , for every pair (x, y) of vertices at distance 2. Certainly contains as a subclass. In this paper, we prove that the circumference of a 2-connected P ₃-dominated graph G on n vertices is at least min or , moreover if then G is hamiltonian or , where is a class of 2-connected nonhamiltonian graphs.     

The Extremal Truncated Moment Problem

For a degree 2n real d-dimensional multisequence to have a representing measure μ, it is necessary for the associated moment matrix to be positive semidefinite and for the algebraic variety associated to β, , to satisfy rank card as well as the following consistency condition: if a polynomial vanishes on , then . We prove that for the extremal case , positivity of and consistency are sufficient for the existence of a (unique, rank -atomic) representing measure. We also show that in the preceding result, consistency cannot always be replaced by recursiveness of . The first-named author’s research was partially supported by NSF Research Grants DMS-0099357 and DMS-0400741. The second-named author’s research was partially supported by NSF Research Grant DMS-0201430 and DMS-0457138.     

On $${\mathcal{F}}$$ -supplemented subgroups of finite groups

Let G be a finite group and a formation of finite groups. We say that a subgroup H of G is -supplemented in G if there exists a subgroup T of G such that G = TH and is contained in the -hypercenter of G/H _G . In this paper, we use -supplemented subgroups to study the structure of finite groups. A series of previously known results are unified and generalized. Research of the author is supported by a NNSF grant of China (Grant #10771180).     

Embedding FD(ω) into {\mathcal{P}_s} densely

Let be the lattice of degrees of non-empty subsets of 2 ^ω under Medvedev reducibility. Binns and Simpson proved that FD(ω), the free distributive lattice on countably many generators, is lattice-embeddable below any non-zero element in . Cenzer and Hinman proved that is dense, by adapting the Sacks Preservation and Sacks Coding Strategies used in the proof of the density of the c.e. Turing degrees. With a construction that is a modification of the one by Cenzer and Hinman, we improve on the result of Binns and Simpson by showing that for any , we can lattice embed FD(ω) into strictly between and . We also note that, in contrast to the infinite injury in the proof of the Sacks Density Theorem, in our proof all injury is finite, and that this is also true for the proof of Cenzer and Hinman, if a straightforward simplification is made. Thanks to my adviser Peter Cholak for his guidance in my research. I also wish to thank the anonymous referee for helpful comments and suggestions. My research was partially supported by NSF grants DMS-0245167 and RTG-0353748 and a Schmitt Fellowship at the University of Notre Dame.     

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems

A complete classification of the computational complexity of the fixed-point existence problem for Boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function classes and graph classes , an ()-system is a Boolean dynamical system such that all local transition functions lie in and the underlying graph lies in . Let be a class of Boolean functions which is closed under composition and let be a class of graphs which is closed under taking minors. The following dichotomy theorems are shown: (1) If contains the self-dual functions and contains the planar graphs, then the fixed-point existence problem for ()-systems with local transition function given by truth-tables is NP-complete; otherwise, it is decidable in polynomial time. (2) If contains the self-dual functions and contains the graphs having vertex covers of size one, then the fixed-point existence problem for ()-systems with local transition function given by formulas or circuits is NP-complete; otherwise, it is decidable in polynomial time.      

Three-dimensional sets with small sumset

We describe the structure of three dimensional sets of lattice points, having a small doubling property. Let be a finite subset of ℤ³ such that dim = 3. If and , then lies on three parallel lines. Moreover, for every three dimensional finite set that lies on three parallel lines, if , then is contained in three arithmetic progressions with the same common difference, having together no more than terms. These best possible results confirm a recent conjecture of Freiman and cannot be sharpened by reducing the quantity υ or by increasing the upper bounds for .     

Solutions of affine stochastic functional differential equations in the state space

We consider solutions of affine stochastic functional differential equations on . The drift of these equations is specified by a functional defined on a general function space which is only described axiomatically. The solutions are reformulated as stochastic processes in the space . By representing such a process in the bidual space of we establish that the transition functions of this process form a generalized Gaussian Mehler semigroup on . This way the process is characterized completely on since it is Markovian. Moreover we derive a sufficient and necessary condition on the underlying space such that the transition functions are even an Ornstein-Uhlenbeck semigroup. We exploit this result to associate a Cauchy problem in the function space to the stochastic functional differential equation.      

Semicrossed products of simple C*-algebras

Let and be C*-dynamical systems and assume that is a separable simple C*-algebra and that α and β are *-automorphisms. Then the semicrossed products and are isometrically isomorphic if and only if the dynamical systems and are outer conjugate. K. R. Davidson was partially supported by an NSERC grant. E. G. Katsoulis was partially supported by a summer grant from ECU     

C*-Algebras of Singular Integral Operators with Shifts Having the Same Nonempty Set of Fixed Points

The C*-subalgebra of generated by all multiplication operators by slowly oscillating and piecewise continuous functions, by the Cauchy singular integral operator and by the range of a unitary representation of an amenable group of diffeomorphisms with any nonempty set of common fixed points is studied. A symbol calculus for the C*-algebra and a Fredholm criterion for its elements are obtained. For the C*-algebra composed by all functional operators in , an invertibility criterion for its elements is also established. Both the C*-algebras and are investigated by using a generalization of the local-trajectory method for C*-algebras associated with C*-dynamical systems which is based on the notion of spectral measure. Submitted: April 30, 2007. Accepted: November 5, 2007.     

Negatively Correlated Random Variables and Mason’s Conjecture for Independent Sets in Matroids

Mason’s Conjecture asserts that for an m-element rank r matroid the sequence is logarithmically concave, in which I _k is the number of independent k-sets of . A related conjecture in probability theory implies these inequalities provided that the set of independent sets of satisfies a strong negative correlation property we call the Rayleigh condition. This condition is known to hold for the set of bases of a regular matroid. We show that if ω is a weight function on a set system that satisfies the Rayleigh condition then is a convex delta-matroid and ω is logarithmically submodular. Thus, the hypothesis of the probabilistic conjecture leads inevitably to matroid theory. We also show that two-sums of matroids preserve the Rayleigh condition in four distinct senses, and hence that the Potts model of an iterated two-sums of uniform matroids satisfies the Rayleigh condition. Numerous conjectures and auxiliary results are included. Research supported by the Natural Sciences and Engineering Research Council of Canada under operating grant OGP0105392.     

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.