首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
A t-packing is an ordered pair (V,P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-subset of V occurs in exactly one block of P, then (V,P) is known as a Steiner (t,k,v)-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices.  相似文献   

2.
A graph G of order p is k-factor-critical,where p and k are positive integers with the same parity, if the deletion of any set of k vertices results in a graph with a perfect matching. G is called maximal non-k-factor-critical if G is not k-factor-critical but G+e is k-factor-critical for every missing edge eE(G). A connected graph G with a perfect matching on 2n vertices is k-extendable, for 1?k?n-1, if for every matching M of size k in G there is a perfect matching in G containing all edges of M. G is called maximal non-k-extendable if G is not k-extendable but G+e is k-extendable for every missing edge eE(G) . A connected bipartite graph G with a bipartitioning set (X,Y) such that |X|=|Y|=n is maximal non-k-extendable bipartite if G is not k-extendable but G+xy is k-extendable for any edge xyE(G) with xX and yY. A complete characterization of maximal non-k-factor-critical graphs, maximal non-k-extendable graphs and maximal non-k-extendable bipartite graphs is given.  相似文献   

3.
In this paper, we define λ-joint, a-joint, (λ,λ)-joint, (λ,a)-joint and (a,a)-joint t-universality of Lerch zeta functions and consider the relations among those. Next we show the existence of (λ,λ)-joint t-universality. Finally, we also show the existence of λ-joint, a-joint, (λ,a)-joint and (a,a)-joint t-universality by using inversion formulas.  相似文献   

4.
We characterize the p-approximation property (p-AP) introduced by Sinha and Karn [D.P. Sinha, A.K. Karn, Compact operators whose adjoints factor through subspaces of ?p, Studia Math. 150 (2002) 17-33] in terms of density of finite rank operators in the spaces of p-compact and of adjoints of p-summable operators. As application, the p-AP of dual Banach spaces is characterized via density of finite rank operators in the space of quasi-p-nuclear operators. This relates the p-AP to Saphar's approximation property APp. As another application, the p-AP is characterized via a trace condition, allowing to define the trace functional on certain subspaces of the space of nuclear operators.  相似文献   

5.
Invexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-invex functions with respect to η and b, being introduced, includes many well-known classes of generalized invex functions as its subclasses. Some properties of the introduced class of B-(p,r)-invex functions with respect to η and b are studied. Further, mathematical programming problems involving B-(p,r)-invex functions with respect to η and b are considered. The equivalence between saddle points and optima, and different type duality theorems are established for this type of optimization problems.  相似文献   

6.
We apply equivariant joins to give a new and more transparent proof of the following result: if G is a compact Hausdorff group and X a G-ANR (respectively, a G-AR), then for every closed normal subgroup H of G, the H-orbit space X/H is a G/H-ANR (respectively, a G/H-AR). In particular, X/G is an ANR (respectively, an AR).  相似文献   

7.
We consider the generalized shift operator, associated with the Laplace-Bessel differential operator . The maximal operator Mγ (B-maximal operator) and the Riesz potential (B-Riesz potential), associated with the generalized shift operator are investigated. At first, we prove that the B-maximal operator Mγ is bounded from the B-Morrey space Lp,λ,γ to Lp,λ,γ for all 1<p<∞ and 0?λ<n+|γ|. We prove that the B-Riesz potential , 0<α<n+|γ| is bounded from the B-Morrey space Lp,λ,γ to Lq,λ,γ if and only if α/(n+|γ|−λ)=1/p−1/q, 1<p<(n+|γ|−λ)/α. Also we prove that the B-Riesz potential is bounded from the B-Morrey space L1,λ,γ to the weak B-Morrey space WLq,λ,γ if and only if α/(n+|γ|−λ)=1−1/q.  相似文献   

8.
Let Γ(H) be the symmetric Fock space over a Hilbert space H and ε:H→Γ(H) the exponential mapping. By an E-operator we mean an operator defined on ε(H). For an E-operator A, the composition mapping Φ=A°ε is called its W-transform. In this paper, we obtain a criterion based on the W-transform for checking whether or not an E-operator becomes a bounded linear operator on the Fock space.  相似文献   

9.
The notion of e-filters is introduced in an MS-algebra and characterized. The concept of D-filters is introduced and a set of equivalent conditions under which every D-filter is an e-filter are given. The properties of the space of all prime e-filters of an MS-algebra are observed. The concept of D-prime filters is introduced and then a set of equivalent conditions are derived for a prime e-filter to become a D-prime filter in topological terms.  相似文献   

10.
The sequence spaces ?(p), c(p) and c0(p) were introduced and studied by Maddox [I.J. Maddox, Paranormed sequence spaces generated by infinite matrices, Proc. Cambridge Philos. Soc. 64 (1968) 335-340]. In the present paper, the sequence spaces λ(u,v;p) of non-absolute type which are derived by the generalized weighted mean are defined and proved that the spaces λ(u,v;p) and λ(p) are linearly isomorphic, where λ denotes the one of the sequence spaces ?, c or c0. Besides this, the β- and γ-duals of the spaces λ(u,v;p) are computed and the basis of the spaces c0(u,v;p) and c(u,v;p) is constructed. Additionally, it is established that the sequence space c0(u,v) has AD property and given the f-dual of the space c0(u,v;p). Finally, the matrix mappings from the sequence spaces λ(u,v;p) to the sequence space μ and from the sequence space μ to the sequence spaces λ(u,v;p) are characterized.  相似文献   

11.
A consecutive(rs)-out-of-(mn):F lattice system which is defined as a two-dimensional version of a consecutive k-out-of-n:F system is used as a reliability evaluation model for a sensor system, an X-ray diagnostic system, a pattern search system, etc. This system consists of m × n components arranged like an (mn) matrix and fails iff the system has an (rs) submatrix that contains all failed components. In this paper we deal a combined model of a k-out-of-mn:F and a consecutive (rs)-out-of-(mn):F lattice system. Namely, the system has one more condition of system down, that is the total number of failed components, in addition to that of a consecutive (rs)-out-of-(mn):F lattice system. We present a method to obtain reliability of the system. The proposed method obtains the reliability by using a combinatorial equation that does not depend on the system size. Some numerical examples are presented to show the relationship between component reliability and system reliability.  相似文献   

12.
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1,…,vk of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability, and motivated by the fact that k-orderedness of a graph implies (k-1)-connectivity, they posed the question of the existence of low degree k-ordered hamiltonian graphs. We construct an infinite family of graphs, which we call bracelet graphs, that are (k-1)-regular and are k-ordered hamiltonian for odd k. This result provides the best possible answer to the question of the existence of low degree k-ordered hamiltonian graphs for odd k. We further show that for even k, there exist no k-ordered bracelet graphs with minimum degree k-1 and maximum degree less than k+2, and we exhibit an infinite family of bracelet graphs with minimum degree k-1 and maximum degree k+2 that are k-ordered for even k. A concept related to k-orderedness, namely that of k-edge-orderedness, is likewise strongly related to connectivity properties. We study this relation and give bounds on the connectivity necessary to imply k-(edge-)orderedness properties.  相似文献   

13.
We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring c is a coloring such that for every edge [xi,xj], c(xi)≠c(xj) and for every arc (xp,xq), c(xp)<c(xq). We will analyse the complexity status of this problem for some special classes of graphs.  相似文献   

14.
In the previous papers [J. Boos, T. Leiger, Dual pairs of sequence spaces, Int. J. Math. Math. Sci. 28 (2001) 9-23; J. Boos, T. Leiger, Dual pairs of sequence spaces. II, Proc. Estonian Acad. Sci. Phys. Math. 51 (2002) 3-17], the authors defined and investigated dual pairs (E,ES), where E is a sequence space, S is a BK-space on which a sum s is defined in the sense of Ruckle [W.H. Ruckle, Sequence Spaces, Pitman Advanced Publishing Program, Boston, 1981], and ES is the space of all factor sequences from E into S. In generalization of the SAK-property (weak sectional convergence) in the case of the dual pair (E,Eβ), the SK-property was introduced and studied. In this note we consider factor sequence spaces E|S|, where |S| is the linear span of , the closure of the unit ball of S in the FK-space ω of all scalar sequences. An FK-space E such that E|S| includes the f-dual Ef is said to have the SB-property. Our aim is to demonstrate, that in the duality (E,ES), the SB-property plays the same role as the AB-property in the case ES=Eβ. In particular, we show for FK-spaces, in which the subspace of all finitely non-zero sequences is dense, that the SB-property implies the SK-property. Moreover, in the context of the SB-property, a generalization of the well-known factorization theorem due to Garling [D.J.H. Garling, On topological sequence spaces, Proc. Cambridge Philos. Soc. 63 (1967) 997-1019] is given.  相似文献   

15.
The definition of the -, - and -duals of a sequence space was defined by Et [Internat. J. Math. Math. Sci. 24 (2000) 785-791]. In this paper we compute - and N-duals of the sequence spaces Δmv(X) for X=?, c and c0, and compute β- and γ-duals of the sequence spaces Δmv(X) for X=?, c and c0.  相似文献   

16.
In this paper, we introduce a class of P-η-accretive mappings, an extension of η-m-accretive mappings [C.E. Chidume, K.R. Kazmi, H. Zegeye, Iterative approximation of a solution of a general variational-like inclusion in Banach spaces, Int. J. Math. Math. Sci. 22 (2004) 1159-1168] and P-accretive mappings [Y.-P. Fang, N.-J. Huang, H-accretive operators and resolvent operator technique for solving variational inclusions in Banach spaces, Appl. Math. Lett. 17 (2004) 647-653], in real Banach spaces. We prove some properties of P-η-accretive mappings and give the notion of proximal-point mapping, termed as P-η-proximal-point mapping, associated with P-η-accretive mapping. Further, using P-η-proximal-point mapping technique, we prove the existence of solution and discuss the convergence analysis of iterative algorithm, for multi-valued variational-like inclusions in real Banach space. The theorems presented in this paper extend and improve many known results in the literature.  相似文献   

17.
For a,b,c,d?0 with adbc>0, we consider the unilateral weighted shift S(a,b,c,d) with weights . Using Schur product techniques, we prove that S(a,b,c,d) is always subnormal; more generally, we establish that for every p?1, all p-subshifts of S(a,b,c,d) are subnormal. As a consequence, we show that all Bergman-like weighted shifts are subnormal.  相似文献   

18.
Let P be a linear partial differential operator with coefficients in the Gevrey class Gs(Tn) where Tn is the n-dimensional torus and s?1. We prove that if P is s-globally hypoelliptic in Tn then its transposed operator tP is s-globally solvable in Tn, thus extending to the Gevrey classes the well-known analogous result in the corresponding C class.  相似文献   

19.
Let p be a positive integer and G=(V,E) a graph. A subset S of V is a p-dominating set if every vertex of V-S is dominated at least p times, and S is a p-dependent set of G if the subgraph induced by the vertices of S has maximum degree at most p-1. The minimum cardinality of a p-dominating set a of G is the p-domination number γp(G) and the maximum cardinality of a p-dependent set of G is the p-dependence number βp(G). For every positive integer p?2, we show that for a bipartite graph G, γp(G) is bounded above by (|V|+|Yp|)/2, where Yp is the set of vertices of G of degree at most p-1, and for every tree T, γp(T) is bounded below by βp-1(T). Moreover, we characterize the trees achieving equality in each bound.  相似文献   

20.
In this paper, the necessary and sufficient conditions are found for the boundedness of the rough B-fractional integral operators from the Lorentz spaces Lp,s,γ to Lq,r,γ, 1<p<q<∞, 1?r?s?∞, and from L1,r,γ to Lq,∞,γWLq,γ, 1<q<∞, 1?r?∞. As a consequence of this, the same results are given for the fractional B-maximal operator and B-Riesz potential.  相似文献   

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

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