The p-approximation property in terms of density of finite rank operators

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.     

A novel use of t-packings to construct d-disjunct matrices

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.     

A class of B-(p,r)-invex functions and mathematical programming

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.     

A characterization of maximal non-k-factor-critical graphs

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 e∉E(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 e∉E(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 xy∉E(G) with x∈X and y∈Y. A complete characterization of maximal non-k-factor-critical graphs, maximal non-k-extendable graphs and maximal non-k-extendable bipartite graphs is given.     

e-filters of MS-algebras

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.     

Reliability of a consecutive (r, s)-out-of-(m, n):F lattice system with conditions on the number of failed components in the system

A consecutive(r, s)-out-of-(m, n):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 (m, n) matrix and fails iff the system has an (r, s) submatrix that contains all failed components. In this paper we deal a combined model of a k-out-of-mn:F and a consecutive (r, s)-out-of-(m, n):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 (r, s)-out-of-(m, n):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.     

Varieties of algebras arising from K-perfect m-cycle systems

A class of algebras forms a variety if it is characterised by a collection of identities. There is a well-known method, often called the standard construction, which gives rise to algebras from m-cycle systems. It is known that the algebras arising from {1}-perfect m-cycle systems form a variety for m∈{3,5} only, and that the algebras arising from {1,2}-perfect m-cycle systems form a variety for m∈{3,5,7} only. Here we give, for any set K of positive integers, necessary and sufficient conditions under which the algebras arising from K-perfect m-cycle systems form a variety.     

Applications of inversion formulas to the joint t-universality of Lerch zeta functions

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.     

Reliability evaluation of multi-state consecutive k-out-of-r-from-n: G system

This paper proposes a model that generalizes the linear consecutive k-out-of-r-from-n: G system to multi-state case. In this model the system consists of n linearly ordered multi-state components. Both the system and its components can have different states: from complete failure up to perfect functioning. The system is in state j or above if and only if at least k_j components out of r consecutive are in state j or above. An algorithm is provided for evaluating reliability of a special case of multi-state consecutive k-out-of-r-from-n: G system. The algorithm is based on the application of the total probability theorem and on the application of a special case taken from the [Jinsheng Huang, Ming J. Zuo, Member IEEE and Yanhong Wu, Generalized multi-state k-out-of-n: G system, IEEE Trans. Reliab. 49(1) (2000) 105–111.]. Also numerical results of the formerly published test examples and new examples are given.     

Compact group actions on equivariant absolute neighborhood retracts and their orbit spaces

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).     

Iterative approximation of a solution of multi-valued variational-like inclusion in Banach spaces: A P-η-proximal-point mapping approach

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.     

Error bounds for linear complementarity problems of DB-matrices

Doubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (2003) [2]. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a DB-matrix and a new bound for linear complementarity problem of a B-matrix. The numerical examples show that the bounds are sharp.     

A W-transform-based criterion for the existence of bounded extensions of E-operators

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.     

Necessary and sufficient conditions for the boundedness of B-Riesz potential in the B-Morrey spaces

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.     

Convexity conditions and normal structure of Banach spaces

We prove that F-convexity, the property dual to P-convexity of Kottman, implies uniform normal structure. Moreover, in the presence of the WORTH property, normal structure follows from a weaker convexity condition than F-convexity. The latter result improves the known fact that every uniformly nonsquare space with the WORTH property has normal structure.     

Gaps of operators

We construct examples which distinguish clearly the classes of p-hyponormal operators for 0<p?∞. In addition, we show that those examples classify the classes of w-hyponormal, absolute-p-paranormal, and normaloid operators on the complex Hilbert space. Only a few examples of p-hyponormal operators have been examined. Our technique can provide many examples related to the above operators.     

On low degree k-ordered graphs

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v₁,…,v_k 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.     

Constructions of new families of nonbinary CSS codes

New families of good q-ary (q is an odd prime power) Calderbank-Shor-Steane (CSS) quantum codes derived from two distinct classical Bose-Chaudhuri-Hocquenghem (BCH) codes, not necessarily self-orthogonal, are constructed. These new families consist of CSS codes whose parameters are better than the ones available in the literature and comparable to the parameters of quantum BCH codes generated by applying the q-ary Steane’s enlargement of CSS codes.     

On the T-ramified, S-split p-class field towers over an extension of degree prime to p

Let K be a number field, p a prime, and let be the T-ramified, S-split p-class field tower of K, i.e., the maximal pro-p-extension of K unramified outside T and totally split on S, where T and S are disjoint finite sets of places of K. Using a theorem of Tate on nilpotent quotient groups, we give (Theorem 2 in Section 3) an elementary characterisation of the finite extensions L/K, with a normal closure of degree prime to p, such that the analogous p-class field tower of L is equal to the compositum . This N.S.C. only depends on classes and units of L. Some applications and examples are given.     

Dual pairs of sequence spaces. III

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.