On cardinal sequences of scattered spaces

It was proved by Dow and Simon that there are 2^ω₁ (as many as possible) pairwise nonhomeomorphic compact, T₂, scattered spaces of height ω₁ and width ω. In this paper, we prove that if is an ordinal withω₁ < ω₂ and θ = κ_ξ: ξ < is a sequence of cardinals such that either κ_ξ = ω or κ_ξ = ω₁ for every ξ < , then there are 2^ω₁ pairwise nonhomeomorphic compact, T₂, scattered spaces whose cardinal sequence is θ.     

Uniqueness theorems for 3D inverse problems with incomplete data

In Ramm, Phys. Lett. 99A, (1983), 258-260, it is proved that a compactly supported inhomogeneity in the velocity profile is uniquely determined by the values of the acoustic pressure collected for all positions of the source and receiver on the surface of the earth ( on the whole plane P) at low frequencies. Here it is proved that the data collected on ω₁ x ω₂ suffice for the uniqueness theorem to hold, where ω₁ and ω₂ are arbitrary open sets on the plane P. This result holds also for the data collected on ω₁ × ω₂ at a fixed frequency.     

A note on geometric ergodicity of autoregressive conditional heteroscedasticity (ARCH) model

For the pth-order linear ARCH model,

, where ₀ > 0, _i 0, I = 1, 2, …, p, {_t} is an i.i.d. normal white noise with E_t = 0, E_t² = 1, and _t is independent of {X_s, s < t}, Engle (1982) obtained the necessary and sufficient condition for the second-order stationarity, that is, ₁ + ₂ + ··· + _p < 1. In this note, we assume that _t has the probability density function p(t) which is positive and lower-semicontinuous over the real line, but not necessarily Gaussian, then the geometric ergodicity of the ARCH(p) process is proved under E_t² = 1. When _t has only the first-order absolute moment, a sufficient condition for the geometric ergodicity is also given.     

Vibration of a stamp partially adhering to an elastic medium : PMM, vol. 42, no. 6, 1978, pp. 1085–1092

There is examined the problem of vibration of a stamp of arbitrary planform occupying a space Ω and vibrating harmonically in an elastic medium with plane boundaries. It is assumed that the elastic medium is a packet of layers with parallel boundaries, at rest in the stiff or elastic half-space. Contact of three kinds is realized under the stamp: rigid adhesion in the domain Ω₁, friction-free contact in domain Ω₂, there are no tangential contact stresses, and “film” contact without normal force in domain Ω₃ (there are no normal contact stresses, only tangential stresses are present.). It is assumed that the boundaries of all the domains have twice continuously differentiable curvature and Ω = Ω₁ Ω₂ Ω₃.

The problem under consideration assumes the presence of a static load pressing the stamp to the layer and hindering the formation of a separation zone. Moreover, a dynamic load, harmonic in time, acts on the stamp causing dynamical stresses which are of the greatest interest since the solution of the static problem is obtained as a particular case of the dynamic problem for ω = 0 (ω is the frequency of vibration). The general solution is constructed in the form of a sum of static and dynamic solutions.

A uniqueness theorem is established for the integral equation of the problem mentioned and for the case of axisymmetric vibration of a circular stamp partially coupled rigidly to the layer, partially making friction-free contact, the problem is reduced to an effectively solvable system of integral equations of the second kind, which reduce easily to a Fredholm system.

These results are an extension of the method elucidated in [1], where by the approach in [1] must be altered qualitatively to obtain them.     

Forcing closed unbounded subsets of ω2

It is shown that there is no satisfactory first-order characterization of those subsets of ω₂ that have closed unbounded subsets in ω₁,ω₂ and GCH preserving outer models. These “anticharacterization” results generalize to subsets of successors of uncountable regular cardinals. Similar results are proved for trees of height and cardinality κ⁺ and for partitions of [κ⁺]², when κ is an infinite cardinal.     

Sticks and clubs

We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side by-side product of partial orderings which we call pseudo-product. Using such products, we give several generic extensions where some of these principles hold together with ¬CH and Martin's axiom for countable p.o.-sets. An iterative version of the pseudo-product is used under an inaccessible cardinal to show the consistency of the club principle for every stationary subset of limits of ω₁ together with ¬CH and Martin's axiom for countable p.o.-sets.     

Distributional chaos for triangular maps

In this paper we exhibit a triangular map F of the square with the following properties: (i) F is of type 2^∞ but has positive topological entropy; we recall that similar example was given by Kolyada in 1992, but our argument is much simpler. (ii) F is distributionally chaotic in the wider sense, but not distributionally chaotic in the sense introduced by Schweizer and Smítal [Trans. Amer. Math. Soc. 344 (1994) 737]. In other words, there are lower and upper distribution functions Φ_xy and Φ_xy^* generated by F such that Φ_xy^*≡1 and Φ_xy(0₊)<1, and no distribution functions Φ_uv, and Φ_uv^* such that Φ_uv^*≡1 and Φ_uv(t)=0 whenever 0<t<ε, for some ε>0. We also show that the two notions of distributional chaos used in the paper, for continuous maps of a compact metric space, are invariants of topological conjugacy.     

混合幂次为2和3的整数变量非线性型的整数部分

证明了:假设λ_1,…,λ_6是正实数,λ_1/λ_2是无理数,Dirichlet L函数满足黎曼猜想,x_1,…,x_6是正整数,那么,λ_1x_1~2+λ_2x_2~2+λ_3x_3~3+λ_4x_4~3+λ_5x_2~3+λ_3x_3~3的整数部分可表示无穷多素数.     

On the weak Freese-Nation property of complete Boolean algebras

The following results are proved:

(a) In a model obtained by adding ₂ Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact cardinal, the existence of a c.c.c. complete Boolean algebra without the weak Freese-Nation property is consistent with GCH. (c) If a weak form of □_μ and cof([μ]^₀,)=μ⁺ hold for each μ>cf(μ)=ω, then the weak Freese-Nation property of is equivalent to the weak Freese-Nation property of any of or for uncountable κ. (d) Modulo the consistency of (_ω+1,_ω)(₁,₀), it is consistent with GCH that does not have the weak Freese-Nation property and hence the assertion in (c) does not hold, and also that adding _ω Cohen reals destroys the weak Freese-Nation property of .

These results solve all of the problems except Problem 1 in S. Fuchino, L. Soukup, Fundament. Math. 154 (1997) 159–176, and some other problems posed by Geschke.     

Changing cofinalities and collapsing cardinals in models of set theory

If a˜cardinal κ₁, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ₀ and its new cofinality, ρ, is less than κ₀, then, under some additional assumptions, each cardinal λ>κ₁ less than cc(P(κ₁)/[κ₁]^<κ₁) is collapsed to κ₀ as well. If in addition N=M[f], where f : ρ→κ₁ is an unbounded mapping, then N is a˜|λ|=κ₀-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.     

Strong equality of domination parameters in trees

We study the concept of strong equality of domination parameters. Let P₁ and P₂ be properties of vertex subsets of a graph, and assume that every subset of V(G) with property P₂ also has property P₁. Let ψ₁(G) and ψ₂(G), respectively, denote the minimum cardinalities of sets with properties P₁ and P₂, respectively. Then ψ₁(G)ψ₂(G). If ψ₁(G)=ψ₂(G) and every ψ₁(G)-set is also a ψ₂(G)-set, then we say ψ₁(G) strongly equals ψ₂(G), written ψ₁(G)≡ψ₂(G). We provide a constructive characterization of the trees T such that γ(T)≡i(T), where γ(T) and i(T) are the domination and independent domination numbers, respectively. A constructive characterization of the trees T for which γ(T)=γ_t(T), where γ_t(T) denotes the total domination number of T, is also presented.     

Remarks on navier-stokes equations with measures as data

We show the existence of a solution to the Navier-Stokes equation taking the vorticity ω as the unknown: ω_t + Aω + Bω = μ, ω(0) = ω₀. Here, ω₀ and μ are bounded Radon measures. This study is motivated by a numerical approximation which will be given in a forthcoming work [1].     

素变量混合幂丢番图逼近

设λ_1,λ_2,λ_3,λ_4为不全为负的非零实数,λ_1/λ_2是无理数和代数数.■是具有良好间隔的序列,δ>0.本文证明了:对于任意ε>0及v∈■,v≤X,使得不等式|λ_1p_1~2+λ_2p_2~2+λ_3p_3~3+λ_4p_4~3-v|相似文献   

Ordinal notations and well-orderings in bounded arithmetic

This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T₂¹ and S₂² can prove the well-foundedness on bounded domains of the ordinal notations below ₀ and Γ₀. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below ₀ and Γ₀ without increasing the class PLS.     

Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix

Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, λ₁. We consider the power method, i.e. that of choosing a vector v₀ and setting v_k = A^kv₀; then the Rayleigh quotients R_k = (Av_k, v_k)/(v_k, v_k) usually converge to λ₁ as k → ∞ (here (u, v) denotes their inner product). In this paper we give two methods for determining how close R_k is to λ₁. They are both based on a bound on λ₁ − R_k involving the difference of two consecutive Rayleigh quotients and a quantity ω_k. While we do not know how to directly calculate ω_k, we can given an algorithm for giving a good upper bound on it, at least with high probability. This leads to an upper bound for λ₁ − R_k which is proportional to (λ₂/λ₁)^2k, which holds with a prescribed probability (the prescribed probability being an arbitrary δ > 0, with the upper bound depending on δ).     

Partition numbers

We continue [21] and study partition numbers of partial orderings which are related to (ω)/fin. In particular, we investigate P_f, be the suborder of ((ω)/fin)^ω containing only filtered elements, the Mathias partial order M, and (ω), (ω)^ω the lattice of (infinite) partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for P_f. We show that the partition number of (ω) is C. We also show that consistently the distributivity number of (ω)^ω is smaller than the distributivity number of (ω)/fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size ₁ does not imply that a Polish space can be partitioned into ₁ many closed sets.     

幂次为2,3,4,5的素变量非线性型的整数部分

考虑了一个混合幂次为2,3,4,5的素变量非线性型的整数部分表示无穷多素数的问题.运用Davenport-Heilbronn方法证明了:如果λ_1,λ_2,λ_3,λ_4是正实数,至少有一个λ_i/λ_j(1≤ij≤4)是无理数,那么存在无穷多素数p_1,p_2,p_3,p_4,p,使得[λ_1p_1~2+λ_2p_2~3+λ_3p_3~4+λ_4p_4~5]=p.     

Cyclic coloring of plane graphs

Let G be a plane graph, and let χ_k(G) be the minimum number of colors to color the vertices of G so that every two of them which lie in the boundary of the same face of the size at most k, receive different colors. In 1966, Ore and Plummer proved that χ_k(G)2k for any k3. It is also known that χ₃(G)4 (Appel and Haken, 1976) and χ₄(G)6 (Borodin, 1984). The result in the present paper is: χ₅(G)9, χ₆(G)11, χ₇(G)12, and χ_k(G)2k − 3 if k8.     

Sometimes slow growing is fast growing

The slow growing hierarchy is commonly defined as follows: G₀(x) = 0, G_x−1(x) := G_x(x) + 1 and G_λ(x) := G_λ[x](x) where λ<₀ is a limit and ·[·]:₀∩ Lim × ω → ₀ is a given assignment of fundamental sequences for the limits below ₀. The first obvious question which is encountered when one looks at this definition is: How does this hierarchy depend on the choice of the underlying system of fundamental sequences? Of course, it is well known and easy to prove that for the standard assignment of fundamental sequence the hierarchy (G_x)_x<0 is slow growing, i.e. each G_x is majorized by a Kalmar elementary recursive function.

It is shown in this paper that the slow growing hierarchy (G_x)_x<0 — when it is defined with respect to the norm-based assignment of fundamental sequences which is defined in the article by Cichon (1992, pp. 173–193) — is actually fast growing, i.e. each PA-provably recursive function is eventually dominated by G_x for some <₀. The exact classification of this hierarchy, i.e. the problem whether it is slow or fast growing, has been unsolved since 1992. The somewhat unexpected result of this paper shows that the slow growing hierarchy is extremely sensitive with respect to the choice of the underlying system of fundamental sequences.

The paper is essentially self-contained. Only little knowledge about ordinals less than ₀ — like the existence of Cantor normal forms, etc. and the beginnings of subrecursive hierarchy theory as presented, for example, in the 1984 textbook of Rose — is assumed.