An infinite combinatorial statement with a poset parameter

We introduce an extension, indexed by a partially ordered set P and cardinal numbers κ,λ, denoted by (κ,<λ)⇝P, of the classical relation (κ,n,λ)→ρ in infinite combinatorics. By definition, (κ,n,λ)→ρ holds if every map F: [κ] ⁿ →[κ]^<λ has a ρ-element free set. For example, Kuratowski’s Free Set Theorem states that (κ,n,λ)→n+1 holds iff κ ≥ λ ⁺ⁿ , where λ ⁺ⁿ denotes the n-th cardinal successor of an infinite cardinal λ. By using the (κ,<λ)⇝P framework, we present a self-contained proof of the first author’s result that (λ ⁺ⁿ ,n,λ)→n+2, for each infinite cardinal λ and each positive integer n, which solves a problem stated in the 1985 monograph of Erdős, Hajnal, Máté, and Rado. Furthermore, by using an order-dimension estimate established in 1971 by Hajnal and Spencer, we prove the relation $(\lambda ^{ + (n - 1)} ,r,\lambda ) \to 2^{\left\lfloor {\tfrac{1} {2}(1 - 2^{ - r} )^{ - n/r} } \right\rfloor } $(\lambda ^{ + (n - 1)} ,r,\lambda ) \to 2^{\left\lfloor {\tfrac{1} {2}(1 - 2^{ - r} )^{ - n/r} } \right\rfloor } , for every infinite cardinal λ and all positive integers n and r with 2≤r<n. For example, (ℵ₂₁₀,4,ℵ₀)→32,768. Other order-dimension estimates yield relations such as (ℵ₁₀₉,4,ℵ₀) → 257 (using an estimate by Füredi and Kahn) and (ℵ₇,4,ℵ₀)→10 (using an exact estimate by Dushnik).     

Discretization of Compact Riemannian Manifolds Applied to the Spectrum of Laplacian

For κ ⩾ 0 and r₀ > 0 let ℳ(n, κ, r₀) be the set of all connected, compact n-dimensional Riemannian manifolds (Mⁿ, g) with Ricci (M, g) ⩾ −(n−1) κ g and Inj (M) ⩾ r₀. We study the relation between the kth eigenvalue λ_k(M) of the Laplacian associated to (Mⁿ,g), Δ = −div(grad), and the kth eigenvalue λ_k(X) of a combinatorial Laplacian associated to a discretization X of M. We show that there exist constants c, C > 0 (depending only on n, κ and r₀) such that for all M ∈ ℳ(n, κ, r₀) and X a discretization of for all k < |X|. Then, we obtain the same kind of result for two compact manifolds M and N ∈ ℳ(n, κ, r₀) such that the Gromov–Hausdorff distance between M and N is smaller than some η > 0. We show that there exist constants c, C > 0 depending on η, n, κ and r₀ such that for all . Mathematics Subject Classification (2000): 58J50, 53C20 Supported by Swiss National Science Foundation, grant No. 20-101 469     

Antichains in partially ordered sets of singular cofinality

In their paper from 1981, Milner and Sauer conjectured that for any poset , if , then P must contain an antichain of size κ. We prove that for λ > cf(λ) = κ, if there exists a cardinal μ < λ such that cov(λ, μ, κ, 2) = λ, then any poset of cofinality λ contains λ ^κ antichains of size κ. The hypothesis of our theorem is very weak and is a consequence of many well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown.      

On a superatomic Boolean algebra which is not generated by a well-founded sublattice

Let b denote the unboundedness number of ω^ω. That is, b is the smallest cardinality of a subset such that for everyg∈ω^ω there isf ∈ F such that {n: g(n) ≤ f(n)}is infinite. A Boolean algebraB is wellgenerated, if it has a well-founded sublatticeL such thatL generatesB. We show that it is consistent with ZFC that , and there is a Boolean algebraB such thatB is not well-generated, andB is superatomic with cardinal sequence 〈ℵ₀, ℵ₁, ℵ₁, 1〉. This result is motivated by the fact that if the cardinal sequence of a Boolean algebraB is 〈ℵ₀, ℵ₀, λ, 1〉, andB is not well-generated, then λ≥b.     

On optimal condition numbers for Markov chains

Let T and be arbitrary nonnegative, irreducible, stochastic matrices corresponding to two ergodic Markov chains on n states. A function κ is called a condition number for Markov chains with respect to the (α, β)–norm pair if . Here π and are the stationary distribution vectors of the two chains, respectively. Various condition numbers, particularly with respect to the (1, ∞) and (∞, ∞)-norm pairs have been suggested in the literature. They were ranked according to their size by Cho and Meyer in a paper from 2001. In this paper we first of all show that what we call the generalized ergodicity coefficient , where e is the n-vector of all 1’s and A ^# is the group generalized inverse of A = I − T, is the smallest condition number of Markov chains with respect to the (p, ∞)-norm pair. We use this result to identify the smallest condition number of Markov chains among the (∞, ∞) and (1, ∞)-norm pairs. These are, respectively, κ ₃ and κ ₆ in the Cho–Meyer list of 8 condition numbers. Kirkland has studied κ ₃(T). He has shown that and he has characterized transition matrices for which equality holds. We prove here again that 2κ ₃(T) ≤ κ(6) which appears in the Cho–Meyer paper and we characterize the transition matrices T for which . There is actually only one such matrix: T = (J _n  − I)/(n − 1), where J _n is the n × n matrix of all 1’s. This research was supported in part by NSERC under Grant OGP0138251 and NSA Grant No. 06G–232.     

Instances of the Conjecture of Chang

We consider various forms of the Conjecture of Chang. Part A constitutes an introduction. Donder and Koepke have shown that if ρ is a cardinal such that ρ ≧ ω₁, and (ρ⁺⁺,ρ⁺↠(ρ⁺, ρ), then 0⁺ exists. We obtain the same conclusion in Part B starting from some other forms of the transfer hypothesis. As typical corollaries, we get: Theorem A.Assume that there exists cardinals λ, κ, such that λ ≧ K ⁺ ≧ω₂ and (λ⁺, λ)↠(K ⁺,K. Then 0⁺ exists. Theorem B.Assume that there exists a singularcardinal κ such that(K ⁺,K↠(ω₁, ω₀. Then 0⁺ exists. Theorem C.Assume that (λ ⁺⁺, λ). Then 0⁺ exists (also ifK=ω ₀. Remark. Here, as in the paper of Donder and Koepke, “O⁺ exists” is a matter of saying that the hypothesis is strictly stronger than “L(μ) exists”. Of course, the same proof could give a few more sharps overL(μ), but the interest is in expecting more cardinals, coming from a larger core model. Theorem D.Assume that (λ ⁺⁺, λ)↠(K ⁺, K) and thatK≧ω ₁. Then 0⁺ exists. Remark 2. Theorem B is, as is well-known, false if the hypothesis “κ is singular” is removed, even if we assume thatK≧ω ₂, or that κ is inaccessible. We shall recall this in due place. Comments. Theorem B and Remark 2 suggest we seek the consistency of the hypothesis of the form:K ⁺, K↠(ω_n +1, ω_n), for κ singular andn≧0. 0266 0152 V 3 The consistency of several statements of this sort—a prototype of which is (N _ω+1,N _ω)↠(ω₁, ω₀) —have been established, starting with an hypothesis slightly stronger than: “there exists a huge cardinal”, but much weaker than: “there exists a 2-huge cardinal”. These results will be published in a joint paper by M. Magidor, S. Shelah, and the author of the present paper.     

Upper Triangular Operator Matrices, SVEP and Browder, Weyl Theorems

A Banach space operator T ∈ B(χ) is polaroid if points λ ∈ iso σ(T) are poles of the resolvent of T. Let denote, respectively, the approximate point, the Weyl, the Weyl essential approximate, the upper semi–Fredholm and lower semi–Fredholm spectrum of T. For A, B and C ∈ B(χ), let M _C denote the operator matrix . If A is polaroid on , M ₀ satisfies Weyl’s theorem, and A and B satisfy either of the hypotheses (i) A has SVEP at points and B has SVEP at points , or, (ii) both A and A* have SVEP at points , or, (iii) A^* has SVEP at points and B ^* has SVEP at points , then . Here the hypothesis that λ ∈ π₀(M _C ) are poles of the resolvent of A can not be replaced by the hypothesis are poles of the resolvent of A. For an operator , let . We prove that if A* and B* have SVEP, A is polaroid on π ^a ₀(M _C) and B is polaroid on π ^a ₀(B), then .      

An oscillatory bifurcation from infinity, and from zero

The problem (where B is a unit ball in R ⁿ )

Transcendence of reciprocal sums of binary recurrences

Let {R _n } _n≥0 be a binary linear recurrence defined by R _n+2 = A R _n+1 + B R _n (n ≥ 0), where A, B, R ₀, R ₁ are integers and Δ = A ² + 4B > 0. We give necessary and sufficient conditions for the transcendence of the numbers

Absolute continuity of the distribution of some Markov geometric series

Let (∈n)≥0 be the Markov chain of two states with respect to the probability measure of the maximal entropy on the subshift space ∑A defined by Fibonacci incident matrix A.We consider the measure μλ of the probability distribution of the random series ∑∞n=0 εnλn (0 ＜λ＜ 1).It is proved that μλ is singular if λ∈ (0,√5-1/2) and that μλ is absolutely continuous for almost all λ∈ (√5-1/2,0.739).     

On the influence of parameters determining anisotropic spaces of smooth functions on characteristics of the embedding theorems

An anisotropic Sobolev and Nikol'skii-Besov space on a domain G is determined by its integro-differential (shortly, ID) parameters. On the other hand, the geometry of G is characterized by the set Λ(G) of all vectors λ=(λ₁,..., λ_n) such that G satisfies the λ-horn condition. We study the dependence of the totality of possible embeddings upon the set Λ(G) and theID-parameters of the space. We consider only embeddings with q≥pⁱ, where pⁱ are the integral parameters of the space and q is the integral embedding parameter. For a given space, we introduce its initial matrix A₀ determined by theID-parameters. A₀ turns out to be a Z-matrix. On the basis of a natural classification of Z-matrices, a classification of anisotropic spaces is introduced. This classification allows one to restate the existence of an embedding with q≥pⁱ in terms of certain specific properties of A₀. Let A₀ be a nondegenerate M-matrix. Any vector λ∈Λ(G) gives rise to a certain set of admissible values of the embedding parameters. We call λ optimal if this set is the largest possible. It turns out that the optimal vector λ _G ^* is determined by Λ(G) and A₀, and may be found by a linear optimization procedure. The following cases are possible: a) , b) , c) λ _G ^* does not exist. In case a) the set of admissible values of the embedding parameters is the biggest, while in case c) no embeddings with q≥pⁱ exist. In case b) the so-called saturation phenomenon occurs, i.e., certain variations of some differential parameters of the space do not change the set of admissible values of the embedding parameters. The latter fact has some applications to the problem of extension of all functions belonging to the given space from G to Eⁿ. Bibliography: 20 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 201, 1992, pp. 22–94. Translated by A. A. Mekler.     

Invariant measures for the linear stochastic Cauchy problem and R-boundedness of the resolvent

We study the asymptotic behaviour of solutions of the stochastic abstract Cauchy problem $$ \left\{ {\begin{array}{*{20}l} {dU\left( t \right) = AU\left( t \right)dt + BdW_H \left( t \right),\quad t \geqslant 0,} \hfill\ {U\left( 0 \right) = 0,} \hfill\ \end{array}} \right. $$ where A is the generator of a C₀-semigroup on a Banach space E, W_H is a cylindrical Brownian motion over a separable Hilbert space H, and $$ B \in \user1{\mathscr L}\left( {H,E} \right) $$ is a bounded operator. Assuming the existence of a solution U, we prove that a unique invariant measure exists if the resolvent R(λ, A) is R-bounded in the right half-plane {Reλ > 0}, and that conversely the existence of an invariant measure implies the R-boundedness of R(λ, A)B in every half-plane properly contained in {Re λ > 0}. We study various abscissae related to the above problem and show, among other things, that the abscissa of R-boundedness of the resolvent of A coincides with the abscissa corresponding to the existence of invariant measures for all γ -radonifying operators B provided the latter abscissa is finite. For Hilbert spaces E this result reduces to the Gearhart-Herbst-Prüss theorem. Dedicated to Giuseppe Da Prato on the occasion of his 70th birthday     

An interlacing theorem for matrices whose graph is a given tree

Let A and B be (n×n)-matrices. For an index set S ⊂ {1, …, n}, denote by A(S) the principal submatrix that lies in the rows and columns indexed by S. Denote by S′ the complement of S and define η(A, B) = det A(S) det B(S′), where the summation is over all subsets of {1, …, n} and, by convention, det A(∅) = det B(∅) = 1. C. R. Johnson conjectured that if A and B are Hermitian and A is positive semidefinite, then the polynomial η(λA,-B) has only real roots. G. Rublein and R. B. Bapat proved that this is true for n ⩽ 3. Bapat also proved this result for any n with the condition that both A and B are tridiagonal. In this paper, we generalize some little-known results concerning the characteristic polynomials and adjacency matrices of trees to matrices whose graph is a given tree and prove the conjecture for any n under the additional assumption that both A and B are matrices whose graph is a tree. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 3, pp. 245–254, 2004.     

Multiplicity of Positive Solutions for a Class of Inhomogeneous Neumann Problems Involving the p(x)-Laplacian

We study the existence and multiplicity of positive solutions for the inhomogeneous Neumann boundary value problems involving the p(x)-Laplacian of the form

Splitting recursively enumerable subalgebras in recursive Boolean algebras

A Boolean algebraB= is recursive ifB is a recursive subset of ω and the operations Λ, v and ┌ are partial recursive. A subalgebraC ofB is recursive an (r.e.) ifC is a recursive (r.e.) subset of B. Given an r.e. subalgebraA, we sayA can be split into two r.e. subalgebrasA ₁ andA ₂ if (A ₁ ∪A ₂)^*=A andA ₁ ∩A ₂={0, 1}. In this paper we show that any nonrecursive r.e. subalgebra ofB can be split into two nonrecursive r.e. subalgebras ofB. This is a natural analogue of the Friedberg's splitting theorem in ω recursion theory.     

Generating Uniform Random Vectors in Z p k : The General Case

We consider the rate of convergence of the Markov chain X _n+1=A X _n +B _n (mod p), where A is an integer matrix with nonzero eigenvalues, and {B _n } _n is a sequence of independent and identically distributed integer vectors, with support not parallel to a proper subspace of Q ^k invariant under A. If for all eigenvalues λ _i of A, then n=O((ln p)²) steps are sufficient and n=O(ln p) steps are necessary to have X _n sampling from a nearly uniform distribution. Conversely, if A has the eigenvalues λ _i that are roots of positive integer numbers, |λ ₁|=1 and |λ _i |>1 for all , then O(p ²) steps are necessary and sufficient.      

Norm conditions for uniform algebra isomorphisms

In recent years much work has been done analyzing maps, not assumed to be linear, between uniform algebras that preserve the norm, spectrum, or subsets of the spectra of algebra elements, and it is shown that such maps must be linear and/or multiplicative. Letting A and B be uniform algebras on compact Hausdorff spaces X and Y, respectively, it is shown here that if λ ∈ ℂ / {0} and T: A → B is a surjective map, not assumed to be linear, satisfying

A continuous extension of the de la Vallée Poussin means

Among the many interesting results of their 1958 paper, G. Pólya and I. J. Schoenberg studied the de la Vallée Poussin means of analytic functions. These are polynomial approximations of a given analytic function on the unit disk obtained by taking Hadamard products of the functionf with certain polynomialsV _n (z), wheren is the degree of the polynomial. The polynomial approximationsV _n *f converge locally uniformly tof asn→∞. In this paper, we define a subordination chainV _λ (z),γ>0, |z|<1, of convex mappings of the disk that for integer values is the same as the previously definedV _n (z). Iff is a conformal mapping of the diskD onto a convex domain, thenV _λ *f→f locally uniformly as λ→∞, and in fact when λ₂ > λ₁. We also consider Hadamard products of theV _λ with complex-valued harmonic mappings of the disk. This work was supported by the Volkswagen Stiftung (RiP-program at Oberwolfach). S. R. received partial support also from INTAS (Project 99-00089) and the German-Israeli Foundation (grant G-643-117.6/1999).     

On the ingham divisor problem

The main result of this paper is the following theorem. Suppose thatτ(n) = ∑ _d|n l and the arithmetical functionF satisfies the following conditions:

Central polynomials and matrix invariants

LetK be a field, charK=0 andM _n (K) the algebra ofn×n matrices overK. If λ=(λ₁,…,λ _m ) andμ=(μ ₁,…,μ _m ) are partitions ofn ² let wherex ₁,…,x _n ²,y ₁,…,y _n ² are noncommuting indeterminates andS _n ² is the symmetric group of degreen ². The polynomialsF ^{λ, μ} , when evaluated inM _n (K), take central values and we study the problem of classifying those partitions λ,μ for whichF ^{λ, μ} is a central polynomial (not a polynomial identity) forM _n (K). We give a formula that allows us to evaluateF ^{λ, μ} inM(K) in general and we prove that if λ andμ are not both derived in a suitable way from the partition δ=(1, 3,…, 2n−3, 2n−1), thenF ^{λ, μ} is a polynomial identity forM _n (K). As an application, we exhibit a new class of central polynomials forM _n (K). In memory of Shimshon Amitsur Research supported by a grant from MURST of Italy.