首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
This article deals with the LORENTZ-MARCINKIEWICZ operator ideal ?? generated by an additive s-function and the LORENTZ-MARCINKIEWICZ sequence space λq(φ). We give eigenvalue distributions for operators belonging to ?? (E, E) and we show the interpolation properties of ??-ideals. Furthermore, we study certain SCHAUDER bases in ?? (H, K), H and K Hilbert spaces.  相似文献   

2.
Let ex2(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)Let ex2(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)$. We improve the previously best known lower and upper bounds of 0.25682 and 3/10?ε, respectively, by showing that This implies the following new upper bound for the Turán density of K In order to establish these results we use a combination of the properties of computer‐generated extremal 3‐graphs for small n and an argument based on “super‐saturation”. Our computer results determine the exact values of ex(n, K) for n≤19 and ex2(n, K) for n≤17, as well as the sets of extremal 3‐graphs for those n. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 105–114, 2010  相似文献   

3.
This paper presents a new method - which does not rely on the cut-elimination theorem - for characterizing the provably total functions of certain intuitionistic subsystems of arithmetic. The new method hinges on a realizability argument within an infinitary language. We illustrate the method for the intuitionistic counterpart of Buss's theory S, and we briefly sketch it for the other levels of bounded arithmetic and for the theory IΣ1.  相似文献   

4.
Let ?? be a collection of generalized quantifiers. We give a convenient characterization for the cases where the logic ??(??) has quantifier elimination for an arbitrary class of structures. The results provide a method to prove zero‐one and convergence laws for such logics with arbitrary sequences of probability measures of finite structures. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 1–36, 2001  相似文献   

5.
Bollobás and Thomason showed that every 22k‐connected graph is k‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a K minor is 3‐linked. Further, we show that a 7‐connected graph with a K minor is (2,5)‐linked. Finally, we show that a graph of order n and size at least 7n?29 contains a K minor. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 75–91, 2005  相似文献   

6.
7.
We prove a completeness theorem for Kf, an extension of K by the operator ?f that means “there exists a finite number of accessible worlds such that … is true, plus suitable axioms to rule it. This is done by an application of the method of consistency properties for modal systems as in [4] with suitable adaptations. Despite no graded modality is invoked here, we consider this work as pertaining to that area both because ?f is a definable operator in the graded infinitary system Kω10 (see [4]), and because this idea was the original source for the development of graded modalities.  相似文献   

8.
This paper is a continuation of [8]. We study weighted function spaces of type B and F on the Euclidean space Rn, where u is a weight function of at most exponential growth. In particular, u(χ (±|χ|) is an admissible weight. We deal with atomic decompositions of these spaces. Furthermore, we prove that the spaces B and F are isomorphic to the corresponding unweighted spaces B and F.  相似文献   

9.
Hoover [2] proved a completeness theorem for the logic L(∫)??. The aim of this paper is to prove a similar completeness theorem with respect to product measurable biprobability models for a logic L(∫1, ∫2) with two integral operators. We prove: If T is a ∑1 definable theory on ?? (a countable admissible set and ω ∈) and consistent with the axioms of L(∫1, ∫2), then there is an analytic absolutely continuous biprobability model in which every sentence in T is satified.  相似文献   

10.
We consider a domain Ω in ?n of the form Ω = ?l × Ω′ with bounded Ω′ ? ?n?l. In Ω we study the Dirichlet initial and boundary value problem for the equation ? u + [(? ? ?… ? ?)m + (? ? ?… ? ?)m]u = fe?iωt. We show that resonances can occur if 2ml. In particular, the amplitude of u may increase like tα (α rational, 0<α<1) or like in t as t∞∞. Furthermore, we prove that the limiting amplitude principle holds in the remaining cases.  相似文献   

11.
Let K denote the graph obtained from the complete graph Ks+t by deleting the edges of some Kt‐subgraph. We prove that for each fixed s and sufficiently large t, every graph with chromatic number s+t has a K minor. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 343–350, 2010  相似文献   

12.
A set S of vertices is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted Det(G), is the size of a smallest determining set. This paper begins by proving that if G=G□?□G is the prime factor decomposition of a connected graph then Det(G)=max{Det(G)}. It then provides upper and lower bounds for the determining number of a Cartesian power of a prime connected graph. Further, this paper shows that Det(Qn)=?log2n?+1 which matches the lower bound, and that Det(K)=?log3(2n+1)?+1 which for all n is within one of the upper bound. The paper concludes by proving that if H is prime and connected, Det(Hn)=Θ(logn). © 2009 Wiley Periodicals, Inc. J Graph Theory  相似文献   

13.
In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph λKn into cycles of length λ, and the λ‐fold complete symmetric digraph λK into directed cycles of length λ. As a corollary to these results we obtain necessary and sufficient conditions for decomposing λKn (respectively, λK) into cycles (respectively, directed cycles) of prime length. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 85–93, 2010  相似文献   

14.
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.  相似文献   

15.
For the Radon transform of functions with circular symmetry an inversion formula is proved in a new and elementary way. The inversion formula combined with Fourier theory is applied to Sommer-feld's integral for H, yielding a representation of products which generalizes Nicholson's integral for |H| 2.  相似文献   

16.
We study the following initial and boundary value problem: In section 1, with u0 in L2(Ω), f continuous such that f(u) + ? non-decreasing for ? positive, we prove the existence of a unique solution on (0,T), for each T > 0. In section 2 it is proved that the unique soluition u belongs to L2(0, T; H ∩ H2) ∩ L(0, T; H) if we assume u0 in H and f in C1(?,?). Numerical results are given for these two cases.  相似文献   

17.
We prove stability of the kink solution of the Cahn‐Hilliard equation ∂tu = ∂( ∂uu/2 + u3/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. We prove stability of the kink solution of the Cahn‐Hilliard equation ∂tu = ∂( ∂uu/2 + u3/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. © 1999 John Wiley & Sons, Inc.  相似文献   

18.
In this paper, we construct iterative methods for computing the generalized inverse A over Banach spaces, and also for computing the generalized Drazin inverses ad of Banach algebra element a. Moreover, we estimate the error bounds of the iterative methods for approximating A or ad. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   

19.
In this paper we prove subelliptic estimates for operators of the form Δx + λ2 (x)S in ?N = ? × ?, where the operator S is an elliptic integro - differential operator in ?N and λ is a nonnegative Lipschitz continuous function.  相似文献   

20.
This paper is the continuation of [17]. We investigate mapping and spectral properties of pseudodifferential operators of type Ψ with χ χ ? ? and 0 ≤ γ ≤ 1 in the weighted function spaces B (?n, w(x)) and F (?n, w(x)) treated in [17]. Furthermore, we study the distribution of eigenvalues and the behaviour of corresponding root spaces for degenerate pseudodifferential operators preferably of type b2(x) b(x, D) b1(x), where b1(x) and b2(x) are appropriate functions and b(x, D) ? Ψ. Finally, on the basis of the Birman-Schwinger principle, we deal with the “negative spectrum” (bound states) of related symmetric operators in L2.  相似文献   

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

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