On p-adic q-l-functions and sums of powers

In this paper, we give an explicit p-adic expansion of

     

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.     

Two new q-exponential operator identities and their applications

In this paper, we use the q-Chu–Vandermonde formula to prove two new operator identities, which are the extensions of Liu's results. These two q-exponential operator identities are used to derive some q-summation formulas and q-integrals.     

Inversion formulas for q-Riemann-Liouville and q-Weyl transforms

We study fractional transforms associated with q-Bessel operator which is useful to inverse q-Riemann-Liouville and q-Weyl transforms.     

Polynomial sequential continuity on C(K,E) spaces

We show that, for bounded sequences in C(K,E), the polynomial sequential convergence is not equivalent to the pointwise polynomial sequential convergence. We introduce several conditions on E under which different versions of the result are true when K is a scattered compact space. These conditions are related with some others appeared in the literature and they seem to be of independent interest.     

Reducing network and computation complexities in neural based real-time scheduling scheme

Multiprocessor real-time scheduling is an important issue in many applications. A neural network provides a highly effective method to obtain good solutions for real-time scheduling problems. However, multiprocessor real-time scheduling problems include multiple variables; processor, process and time, and the neural networks have to be presented in three dimensions with these variables. Hence, the corresponding neural networks have more neurons, and synaptic weights, and thus associated network and computational complexities increase. Meanwhile, a neural network using the competitive scheme can provide a highly effective method with less network complexity. Therefore, in this study, a simplified two-dimensional Hopfield-type neural network using competitive rule is introduced for solving three-dimensional multiprocessor real-time scheduling problems. Restated, a two-dimensional network is proposed to lower the neural network dimensions and decrease the number of neurons and hence reduce the network complexity; an M-out-of-N competitive scheme is suggested to greatly reduce the computational complexity. Simulation results reveal that the proposed scheme imposed on the derived energy function with respect to process time and deadline constraints is an appropriate approach to solving these class scheduling problems. Moreover, the computational complexity of the proposed scheme is greatly lowered to O(N × T²).     

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

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

Kernel systems on L-ordered sets

This paper presents fuzzy versions of kernel operators and kernel systems on L-ordered sets and establishes a one-to-one correspondence between them.     

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

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.     

A family of p-adic twisted interpolation functions associated with the modified Bernoulli numbers

The main purpose of this paper is to construct a family of modified p-adic twisted functions, which interpolate the modified twisted q-Bernoulli polynomials and the generalized twisted q-Bernoulli numbers at negative integers. We also give some applications and examples related to these functions and numbers.     

q-positive definiteness and related operators

We are in progress of extending the family of ‘q-deformed operators’ considered in the previous papers by joining to them q-subnormal as well as q-formally subnormal ones. It turns out that q-positive definiteness, a notion generalizing Halmos' standard positive definiteness of bounded subnormal operators, is likewise central for our new scheme.     

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.     

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

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.     

Extensions of q-Chu-Vandermonde's identity

In this paper, we apply q-exponential operator to get some general q-Chu-Vandermonde's identities.     

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.     

On properties of discrete (r, q) and (s, T) inventory systems

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventory literature studies continuous approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that these properties no longer hold in the discrete space, in the sense of linear interpolation extension and L^?-convexity. This nonconvexity can lead to failure of optimization techniques based on local optimality to obtain the optimal inventory policies. It can also make certain comparative properties established previously using continuous variables invalid. We revise these properties in the discrete space.     

Generalized R-KKM theorems in topological space and their applications

In this paper, we introduce generalized R-KKM mapping and discuss some new generalized R-KKM theorem under the nonconvexity setting of topological space. As applications, some new minimax inequalities, saddle point theorem are proved in topological space. Our theorems unified and extend many known results in recent literature.