首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ 0k) (respectively, ??( Π 0k), ??( Δ 11)) of dictionaries V ? 2* whose ω ‐powers are Σ 0k‐sets (respectively, Π 0k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ 02) and ??( Δ 11), showing that the set ??( Δ 11) is “more complex” than the set ??( Σ 02). As an application we improve the lower bound on the complexity of ??( Δ 11) given by Lecomte, showing that ??( Δ 11) is in Σ 1 2(22*)\ Π 02. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π 0k+1) (respectively, ??( Σ 0k +1)) is “more complex” than the set of dictionaries ??( Π 0k) (respectively, ??( Σ 0k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

2.
We study large values of the remainder term EK (x) in the asymptotic formula for the number of irreducible integers in an algebraic number field K. We show that EK (x) = Ω± (√(x)(log x)) for certain positive constant BK, improving in that way the previously best known estimate EK (x) = Ω± (x(1/2)‐ε) for every ε > 0, due to A. Perelli and the present author. Assuming that no entire L‐function from the Selberg class vanishes on the vertical line σ = 1, we show that EK (x) = Ω± (√(x)(log log x)D (K)‐1(log x)‐1), supporting a conjecture raised recently by the author. In particular, it follows that the last omega estimate is a consequence of the Selberg Orthonormality Conjecture (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

3.
We show that (ℚω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

4.
There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ωω‐bounding property. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

5.
In this paper, we consider the semilinear elliptic problem where Ω??N (N?3) is a bounded smooth domain such that 0∈Ω, σ>0 is a real parameter, and f(x) is some given function in L(Ω) such that f(x)?0, f(x)?0 in Ω. Some existence results of multiple solutions have been obtained by implicit function theorem, monotone iteration method and Mountain Pass Lemma. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   

6.
It is shown that the square of a nonconstant harmonic function u that either vanishes continuously on an open subset V contained in the boundary of a Dini domain or whose normal derivative vanishes on an open subset V in the boundary of a C1,1 domain in ℝd satisfies the doubling property with respect to balls centered at points QV. Under any of the above conditions, the module of the gradient of u is a B2(dσ)-weight when restricted to V, and the Hausdorff dimension of the set of points {QV : ∇u(Q) = 0} is less than or equal to d−2. These results are generalized to solutions to elliptic operators with Lipschitz second-order coefficients and bounded coefficients in the lower-order terms. © 1997 John Wiley & Sons, Inc.  相似文献   

7.
In the paper we prove the existence and uniqueness of solutions of the overdetermined elliptic system where b, ω are given functions, in a domain Ω C R3 with corners π/n, n = 2, 3, … The proof is divided on two steps, we construct a solution for the Laplace equation in a dihedral angle π/n, using the method of reflection and we get an estimate in the norms of the Sobolev spaces in some neighbourhood of the edge. In the dihedral angle system (A) reduces to the Dirichlet and Neumann problems for the Laplace equation. In the next step we prove the existence of solutions in the Sobolev spaces Wpl(Ω) using the existence of generalized solutions of (A).  相似文献   

8.
We prove the following theorem: Let φ(x) be a formula in the language of the theory PA? of discretely ordered commutative rings with unit of the form ?yφ′(x,y) with φ′ and let ∈ Δ0 and let fφ: ? → ? such that fφ(x) = y iff φ′(x,y) & (?z < y) φ′(x,z). If I ∏ ∈(?x ≥ 0), φ then there exists a natural number K such that I ∏ ? ?y?x(x > y ? ?φ(x) < xK). Here I ∏1? denotes the theory PA? plus the scheme of induction for formulas φ(x) of the form ?yφ′(x,y) (with φ′) with φ′ ∈ Δ0.  相似文献   

9.
We show that for every Borel-measurable mapping Δ: [ω]ω → there exists A [ω]ω and there exists a continuous mapping Γ: [A]ω → [A]ω with Γ(X) X such that for all X, Y [A]ω it follows that Δ(X) = Δ(Y) if Γ(X) = Γ(Y). In a sense, this is generalization of the Erdös-Rado canonization theorem  相似文献   

10.
We classify all {δ (p3 + 1), δ; 3, p3}‐minihypers, , for a prime number p0 ≥ 7, with excess e ≤ p3. Such a minihyper is a sum of lines and of possibly one projected subgeometry PG(5, p), or a sum of lines and a minihyper which is a projected subgeometry PG(5, p) minus one line. When p is a square, also (possibly projected) Baer subgeometries PG(3, p3/2) can occur. © 2004 Wiley Periodicals, Inc.  相似文献   

11.
This paper deals with the solutions of the differential equation u?+λ2zu+(α?1)λ2u=0, in which λ is a complex parameter of large absolute value and α is an arbitrary constant, real or complex. After a discussion of the structure of the solutions of the differential equation, an integral representation of the solution is given, from which the series solutions and their asymptotic representations are derived. A third independent solution is needed for the special case when α?1 is a positive integer, and two derivations for this are given. Finally, a comparison is made with the results obtained by R. E. Langer.  相似文献   

12.
It is shown that a Banach space E has type p if and only for some (all) d ≥ 1 the Besov space B(1/p – 1/2)d p,p (?d ; E) embeds into the space γ (L2(?d ), E) of γ ‐radonifying operators L2(?d ) → E. A similar result characterizing cotype q is obtained. These results may be viewed as E ‐valued extensions of the classical Sobolev embedding theorems. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

13.
The category of Scott‐domains gives a computability theory for possibly uncountable topological spaces, via representations. In particular, every separable Banach‐space is representable over a separable domain. A large class of topological spaces, including all Banach‐spaces, is representable by domains, and in domain theory, there is a well‐understood notion of parametrizations over a domain. We explore the link with parameter‐dependent collections of spaces in e. g. functional analysis through a case study of ?p ‐spaces. We show that a well‐known domain representation of ?p as a metric space can be made uniform in the sense of parametrizations of domains. The uniform representations admit lifting of continuous functions and are effective in p. Dependent type constructions apply, and through the study of the sum and product spaces, we clarify the notions of uniformity and uniform computability. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

14.
We prove that the Kleene schemes for primitive recursion relative to the μ‐operator, relativized to some nondeterministic objects, have the same power to express total functionals when interpreted over the partial continuous functionals and over the Kleene‐Kreisel continuous functionals. Relating the former interpretation to Niggl's ℳ︁ω we prove Nigg's conjecture that ℳ︁ω is strictly weaker than Plotkin's PCF + PA.  相似文献   

15.
We show that for each n ≥ 1, if T2n does not prove the weak pigeonhole principle for Σbn functions, then the collection scheme B Σ1 is not finitely axiomatizable over T2n. The same result holds with Sn2 in place of T 2n (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

16.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007  相似文献   

17.
We study S‐asymptotically ω‐periodic mild solutions of the semilinear Volterra equation u′(t)=(a* Au)(t)+f(t, u(t)), considered in a Banach space X, where A is the generator of an (exponentially) stable resolvent family. In particular, we extend the recent results for semilinear fractional integro‐differential equations considered in (Appl. Math. Lett. 2009; 22:865–870) and for semilinear Cauchy problems of first order given in (J. Math. Anal. Appl. 2008; 343(2): 1119–1130). Applications to integral equations arising in viscoelasticity theory are shown. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

18.
A complete solution in integers of the well-known diophantine equation y2 = x3 + 1 is given by using elementary arguments based on the Pell-Fermat equation X2 − 3Y2 = 1.  相似文献   

19.
Let G be a connected graph and let eb(G) and λ(G) denote the number of end‐blocks and the maximum number of disjoint 3‐vertex paths Λ in G. We prove the following theorems on claw‐free graphs: (t1) if G is claw‐free and eb(G) ≤ 2 (and in particular, G is 2‐connected) then λ(G) = ⌊| V(G)|/3⌋; (t2) if G is claw‐free and eb(G) ≥ 2 then λ(G) ≥ ⌊(| V(G) | − eb(G) + 2)/3 ⌋; and (t3) if G is claw‐free and Δ*‐free then λ(G) = ⌊| V(G) |/3⌋ (here Δ* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ‐factor: Let n and p be integers, 1 ≤ pn − 2, G a 2‐connected graph, and |V(G)| = 3n. Suppose that GS has a Λ‐factor for every SV(G) such that |S| = 3p and both V(G) − S and S induce connected subgraphs in G. Then G has a Λ‐factor. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 175–197, 2001  相似文献   

20.
We will prove that some so‐called union theorems (see [2]) are equivalent in ZF0 to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω1 (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号