首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

2.
A λ‐design is a family ?? = {B1, B2, …, Bv} of subsets of X = {1, 2, …, v} such that |BiBj| = λ for all ijand not all Bi are of the same size. The only known example of λ‐designs (called type‐1 designs) are those obtained from symmetric designs by a certain complementation procedure. Ryser [J Algebra 10 (1968), 246–261] and Woodall [Proc London Math Soc 20 (1970), 669–687] independently conjectured that all λ‐designs are type‐1. Let g = gcd(r ? 1, r* ? 1), where rand r* are the two replication numbers. Ionin and Shrikhande [J Combin Comput 22 (1996), 135–142; J Combin Theory Ser A 74 (1996), 100–114] showed that λ‐designs with g = 1, 2, 3, 4 are type‐1 and that the Ryser–Woodall conjecture is true for λ‐designs on p + 1, 2p + 1, 3p + 1, 4p + 1 points, where pis a prime. Hein and Ionin [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 145–156] proved corresponding results for g = 5 and Fiala [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 109–124; Ars Combin 68 (2003), 17–32; Ars Combin, to appear] for g = 6, 7, and 8. In this article, we consider λ designs with exactly two block sizes. We show that in this case, the conjecture is true for g = 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, and for g = 10, 14, 18, 22 with v≠4λ ? 1. We also give two results on such λ‐designs on v = 9p + 1 and 12p + 1 points, where pis a prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:95‐110, 2011  相似文献   

3.
We prove some convergence theorems for αψ‐pseudocontractive operators in real Hilbert spaces, by using the concept of admissible perturbation. Our results extend and complement some theorems in the existing literature. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

4.
The aim of this paper is to develop a fully discrete ( T ,ψ)‐ψe finite element decoupled scheme to solve time‐dependent eddy current problems with multiply‐connected conductors. By making ‘cuts’ and setting jumps of ψe across the cuts in nonconductive domain, the uniqueness of ψe is guaranteed. Distinguished from the traditional T ‐ ψ method, our decoupled scheme solves the potentials T and ψψe separately in two different simple equation systems, which avoids solving a saddle‐point equation system and leads to a remarkable reduction in computational efforts. The energy‐norm error estimate of the fully discrete decoupled scheme is provided. Finally, the scheme is applied to solve two benchmark problems—TEAM Workshop Problems 7 and IEEJ model. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

5.
We study the following two integral operators where g is an analytic function on the open unit disk in the complex plane. The boundedness and compactness of these two operators between the α ‐Bloch space Bα and the Besov space are discussed in this paper (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

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

7.
We prove several dichotomy theorems which extend some known results on σ‐bounded and σ‐compact pointsets. In particular we show that, given a finite number of $\Delta ^{1}_{1}$ equivalence relations $\mathrel {\mathsf {F}}_1,\dots ,\mathrel {\mathsf {F}}_n$, any $\Sigma ^{1}_{1}$ set A of the Baire space either is covered by compact $\Delta ^{1}_{1}$ sets and lightface $\Delta ^{1}_{1}$ equivalence classes of the relations $\mathrel {\mathsf {F}}_i$, or A contains a superperfect subset which is pairwise $\mathrel {\mathsf {F}}_i$‐inequivalent for all i = 1, …, n. Further generalizations to $\Sigma ^{1}_{2}$ sets A are obtained.  相似文献   

8.
We derive decomposition theorems for P6, K1 + P4‐free graphs, P5, K1 + P4‐free graphs and P5, K1 + C4‐free graphs, and deduce linear χ‐binding functions for these classes of graphs (here, Pn (Cn) denotes the path (cycle) on n vertices and K1 + G denotes the graph obtained from G by adding a new vertex and joining it with every vertex of G). Using the same techniques, we also obtain an optimal χ‐binding function for P5, C4‐free graphs which is an improvement over that given in [J. L. Fouquet, V. Giakoumakis, F. Maire, and H. Thuillier, 11 , Discrete Math, 146, 33–44.]. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 293–306, 2007  相似文献   

9.
Let M be an MV‐algebra and ΩM be the set of all σ ‐valuations from M into the MV‐unit interval. This paper focuses on the characterization of MV‐algebras using σ ‐valuations of MV‐algebras and proves that a σ ‐complete MV‐algebra is σ ‐regular, which means that ab if and only if v (a) ≤ v (b) for any v ∈ ΩM. Then one can introduce in a natural way a fuzzy topology δ on ΩM. The representation theorem forMV‐algebras is established by means of fuzzy topology. Some properties of fuzzy topology δ and its cut topology U are investigated (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

10.
Let h : ? → ? be a computable function. A real number x is called h‐monotonically computable (h‐mc, for short) if there is a computable sequence (xs) of rational numbers which converges to x h‐monotonically in the sense that h(n)|xxn| ≥ |xxm| for all n andm > n. In this paper we investigate classes hMC of h‐mc real numbers for different computable functions h. Especially, for computable functions h : ? → (0, 1)?, we show that the class hMC coincides with the classes of computable and semi‐computable real numbers if and only if Σi∈?(1 – h(i)) = ∞and the sum Σi∈?(1 – h(i)) is a computable real number, respectively. On the other hand, if h(n) ≥ 1 and h converges to 1, then hMC = SC (the class of semi‐computable reals) no matter how fast h converges to 1. Furthermore, for any constant c > 1, if h is increasing and converges to c, then hMC = cMC . Finally, if h is monotone and unbounded, then hMC contains all ω‐mc real numbers which are g‐mc for some computable function g. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

11.
In this paper we use recent results [14] to establish various characterizations of the global minimum of the map Fψ : U → ?+ defined by Fψ (X) = ‖ψ (X)‖p (1 < p < ∞) where ψ: UCp is a map defined by ψ (X) = S +? (X), with ?: B (H) → B (H) a linear map and SCp , and U = {XB (H): ? (X) ∈ Cp }. Further, we apply these results to characterize the operators which are orthogonal to the range of elementary operators. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

12.
For a regular cardinal κ with κ <κ = κ and κλ , we construct generically (forcing by a < κ‐closed κ +‐c. c. p. o.‐set ℙ0) a subset S of {xP κ λ : xκ is a singular ordinal} such that S is stationary in a strong sense (F IAκ λ ‐stationary in our terminology) but the stationarity of S can be destroyed by a κ +‐c. c. forcing ℙ* (in V ) which does not add any new element of P κ λ . Actually ℙ* can be chosen so that ℙ* is κ‐strategically closed. However we show that such ℙ* itself cannot be κ‐strategically closed or even <κ‐strategically closed if κ is inaccessible. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

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

14.
We consider a class of multidimensional potential‐type operators with kernels that have singularities at the origin and on the unit sphere and that are oscillating at infinity. We describe some convex sets in the (1/p, 1/q)‐plane for which these operators are bounded from Lp into Lq and indicate domains where they are not bounded. We also reveal some effects which show that oscillation and singularities of the kernels may strongly influence on the picture of boundedness of the operators under consideration. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

15.
We give a condition which is sufficient for the two‐weight (p, q) inequalities for multilinear potential type integral operators, where 1 < pq < ∞. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

16.
We construct the minimal and maximal extensions in L p (?n ), 1 < p < ∞, for M ‐elliptic pseudo‐differential operators initiated by Garello and Morando. We prove that they are equal and determine the domains of the minimal, and hence maximal, extensions of M ‐elliptic pseudo‐differential operators. For M ‐elliptic pseudodifferential operators with constant coefficients, the spectra and essential spectra are computed. An application to quantization is given. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

17.
An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of automata or Turing machine. Certain families of languages, such as the languages, may enumerated as P0, P1, … and then an index set associated to a given property R (such as finiteness) of languages is just the set of e such that Pe has the property. The complexity of index sets for 7 types of languages is determined for various properties related to the size of the language.  相似文献   

18.
The ∞ ‐Bilaplacian is a third‐order fully nonlinear PDE given by (1) In this work, we build a numerical method aimed at quantifying the nature of solutions to this problem, which we call ∞ ‐biharmonic functions. For fixed p we design a mixed finite element scheme for the prelimiting equation, the p‐Bilaplacian (2) We prove convergence of the numerical solution to the weak solution of and show that we are able to pass to the limit p → ∞ . We perform various tests aimed at understanding the nature of solutions of and we prove convergence of our discretization to an appropriate weak solution concept of this problem that of ‐solutions.  相似文献   

19.
We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ??ω‐axiomatizable. We also axiomatize the first‐order theory of this class.  相似文献   

20.
The concept of (α,ψ)‐contractions was introduced by Samet et al. in this paper, we introduce (α,ψ)‐generalized contractions in a Hausdorff partial metric space. We discuss its significance and obtain some common fixed point theorems for a pair of self‐mappings. Some examples are given to support the theory.  相似文献   

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

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