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

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.     

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.     

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.     

Global hypoellipticity and global solvability in Gevrey classes on the n-dimensional torus

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

Weak barrelledness for C(X) spaces

Buchwalter and Schmets reconciled C_c(X) and C_p(X) spaces with most of the weak barrelledness conditions of 1973, but could not determine if -barrelled ⇔ ?^∞-barrelled for C_c(X). The areas grew apart. Full reconciliation with the fourteen conditions adopted by Saxon and Sánchez Ruiz needs their 1997 characterization of Ruess' property (L), which allows us to reduce the C_c(X) problem to its 1973 status and solve it by carefully translating the topology of Kunen (1980) and van Mill (1982) to find the example that eluded Buchwalter and Schmets. The more tractable C_p(X) readily partitions the conditions into just two equivalence classes, the same as for metrizable locally convex spaces, instead of the five required for C_c(X) spaces. Our paper elicits others, soon to appear, that analytically characterize when the Tychonov space X is pseudocompact, or Warner bounded, or when C_c(X) is a df-space (Jarchow's 1981 question).     

Some bounds on the p-domination number in trees

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|+|Y_p|)/2, where Y_p 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.     

On p-approximation properties for p-operator spaces

This paper has a two-fold purpose. Let 1<p<∞. We first introduce the p-operator space injective tensor product and study various properties related to this tensor product, including the p-operator space approximation property, for p-operator spaces on Lp-spaces. We then apply these properties to the study of the pseudofunction algebra PFp(G), the pseudomeasure algebra PMp(G), and the Figà-Talamanca-Herz algebra Ap(G) of a locally compact group G. We show that if G is a discrete group, then most of approximation properties for the reduced group C^∗-algebra , the group von Neumann algebra VN(G), and the Fourier algebra A(G) (related to amenability, weak amenability, and approximation property of G) have the natural p-analogues for PFp(G), PMp(G), and Ap(G), respectively. The p-completely bounded multiplier algebra McbAp(G) plays an important role in this work.     

Generalized difference sequence spaces and their dual spaces

The definition of the pα-, pβ- and pγ-duals of a sequence space was defined by Et [Internat. J. Math. Math. Sci. 24 (2000) 785-791]. In this paper we compute pα- and N-duals of the sequence spaces Δ^m_v(X) for X=?_∞, c and c₀, and compute β- and γ-duals of the sequence spaces Δ^m_v(X) for X=?_∞, c and c₀.     

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.     

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.     

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.     

Approximation by light maps and parametric Lelek maps

The class of metrizable spaces M with the following approximation property is introduced and investigated: M∈AP(n,0) if for every ε>0 and a map g:In→M there exists a 0-dimensional map g^′:In→M which is ε-homotopic to g. It is shown that this class has very nice properties. For example, if Mi∈AP(ni,0), i=1,2, then M₁×M₂∈AP(n₁+n₂,0). Moreover, M∈AP(n,0) if and only if each point of M has a local base of neighborhoods U with U∈AP(n,0). Using the properties of AP(n,0)-spaces, we generalize some results of Levin and Kato-Matsuhashi concerning the existence of residual sets of n-dimensional Lelek maps.     

On discrete q-ultraspherical polynomials and their duals

A special case of the big q-Jacobi polynomials Pn(x;a,b,c;q), which corresponds to a=b=−c, is shown to satisfy a discrete orthogonality relation for imaginary values of the parameter a (outside of its commonly known domain 0<a<q⁻¹). Since Pn(x;qα,qα,−qα;q) tend to Gegenbauer (or ultraspherical) polynomials in the limit as q→1, this family represents another q-extension of these classical polynomials, different from the continuous q-ultraspherical polynomials of Rogers. For a dual family with respect to the polynomials Pn(x;a,a,−a;q) (i.e., for dual discrete q-ultraspherical polynomials) we also find new orthogonality relations with extremal measures.     

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.     

On some new generalized sequence spaces

In this paper we define the sequence sets ?_∞(u,Δ²,p), c(u,Δ²,p) and c₀(u,Δ²,p), and give α- and β-duals of these sets. Further we investigate matrix transformations in the spaces and give a characterization of the class (?_∞(u,Δ²,p),?_∞).     

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.     

On p-covalenced association schemes

Let (X,S) denote an association scheme where X is a finite set. For a prime p we say that (X,S) is p-covalenced (p-valenced) if every multiplicity (valency, respectively) of (X,S) is a power of p. In the character theory of finite groups Ito's theorem states that a finite group G has a normal abelian p-complement if and only if every character degree of G is a power of p. In this article we generalize Ito's theorem to p-valenced association schemes, i.e., a p-valenced association scheme (X,S) has a normal p-covalenced p-complement if and only if (X,S) is p-covalenced.     

Composition operators from F(p, q, s) spaces to the nth weighted-type spaces on the unit disc

In this note we characterize the boundedness and compactness of the composition operator from the general function space F(p, q, s) to the nth weighted-type space on the unit disk, where the nth weighted-type space has been recently introduced by Stevo Stevi?.     

N-Capacity, N-harmonic radius and N-harmonic transplantation

For the N-Laplacian ΔN on a regular domain the N-Green's function exists. This allows us to define the N-Robin's function and the N-harmonic radius. We show their basic properties and extend the method of the harmonic transplantation to that of the N-harmonic transplantation. The method is used to estimate the first eigenvalue of the N-Laplacian ΔN. We also give another proof of the isoperimetric inequality for the N-capacity and give the isoperimetric inequality for the N-harmonic radius.