Fixed point theorems for better admissible multimaps on almost convex sets

We obtain new fixed point theorems on multimaps in the class Bp defined on almost convex subsets of topological vector spaces. Our main results are applied to deduce various fixed point theorems, coincidence theorems, almost fixed point theorems, intersection theorems, and minimax theorems. Consequently, our new results generalize well-known works of Kakutani, Fan, Browder, Himmelberg, Lassonde, and others.     

Six-variable generalization of Ramanujan's reciprocity theorem and its variants

By virtue of Shukla's well-known bilateral summation formula and Watson's transfor-mation formula, we extend the four-variable generalization of Ramanujan's reciprocity theorem due to Andrews to a six-variable one. Some novel variants of Ramanujan's reciprocity theorem and q-series identities are presented.     

Remarks on the formula for γ-interior

The paper presents a formula for the γ-interior of a set under special conditions for , more general than those in the previous paper [Acta Math. Hungar. 80 (1998) 89-93]. There are also some applications.     

Applications of Michael's selection theorems to fixed point theory

Applying some of Ernest Michael's selection theorems, from recent fixed point theorems on u.s.c. multimaps, we deduce generalizations of the classical Bolzano theorem, several fixed point theorems on multimaps defined on almost convex sets, almost fixed point theorems, coincidence theorems, and collectively fixed point theorems. These results are related mainly to Michael maps, that is, l.s.c. multimaps having nonempty closed convex values.     

Short proofs of summation and transformation formulas for basic hypergeometric series

We show that several terminating summation and transformation formulas for basic hypergeometric series can be proved in a straightforward way. Along the same line, new finite forms of Jacobi's triple product identity and Watson's quintuple product identity are also proved.     

Some properties for a class of interchange graphs

The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.     

Spanning trails containing given edges

A graph G is Eulerian-connected if for any u and v in V(G), G has a spanning (u,v)-trail. A graph G is edge-Eulerian-connected if for any e^′ and e^″ in E(G), G has a spanning (e^′,e^″)-trail. For an integer r?0, a graph is called r-Eulerian-connected if for any X⊆E(G) with |X|?r, and for any , G has a spanning (u,v)-trail T such that X⊆E(T). The r-edge-Eulerian-connectivity of a graph can be defined similarly. Let θ(r) be the minimum value of k such that every k-edge-connected graph is r-Eulerian-connected. Catlin proved that θ(0)=4. We shall show that θ(r)=4 for 0?r?2, and θ(r)=r+1 for r?3. Results on r-edge-Eulerian connectivity are also discussed.     

Common fixed point theorem for hybrid generalized multi-valued contraction mappings

In this paper, we introduce the notion of a hybrid generalized multi-valued contraction mapping and establish the common fixed point theorem for this mapping. Our results generalize, unify, extend and complement several common fixed point theorems of many authors in the literature.     

Group actions and Helly's theorem

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on nonpositively curved metric spaces. These results are encoded in a property that we introduce called “property FAr”, which reduces to Serre's property FA when r=1. The method applies to S-arithmetic groups in higher Q-rank, to simplex reflection groups (including some nonarithmetic ones), and to higher rank Chevalley groups over polynomial and other rings (for example SLn(Z[x₁,…,xd]), n>2).     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

Descriptive properties of families of autohomeomorphisms of the unit interval

Let H⊂C[0,1] stand for the Polish space of all increasing autohomeomorphisms of [0,1]. We show that the family of all strictly singular autohomeomorphisms is -complete. This confirms a suggestion of Graf, Mauldin and Williams. Some related results are also included.     

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new concept of a large set of even levelled -design of order v and index 2, denoted by -LELD, which is equivalent to an optimal, levelled (v−2)-fault-tolerant routing with levelled minimum optical indices of the complete network with v nodes. On the basis of the theory of three-wise balanced designs and partitionable candelabra systems, several infinite classes of -LELDs are constructed. As a consequence, the existence problem for optimal routings with levelled minimum optical indices is solved for nearly a third of the cases.     

Iterative approximation of a zero of accretive operator in Banach space

This paper introduces an iteration scheme for viscosity approximation of a zero of accretive operator in a reflexive Banach space with weakly continuous duality mapping. A new iterative sequence is introduced and strong convergence of the algorithm {x_n} is proved. The results improve and extend the results of Su [Xiaolong Qin, Yongfu Su, Approximation of a zero point of accretive operator in Banach spaces, J. Math. Anal. Appl. 320 (2007) 415-424] and some others.     

Variations on Weyl's theorem

In this note we study the property (w), a variant of Weyl's theorem introduced by Rako?evi?, by means of the localized single-valued extension property (SVEP). We establish for a bounded linear operator defined on a Banach space several sufficient and necessary conditions for which property (w) holds. We also relate this property with Weyl's theorem and with another variant of it, a-Weyl's theorem. We show that Weyl's theorem, a-Weyl's theorem and property (w) for T (respectively T^*) coincide whenever T^* (respectively T) satisfies SVEP. As a consequence of these results, we obtain that several classes of commonly considered operators have property (w).     

Condensed Cramer rule for some restricted quaternion linear equations

In this paper, we derive an alternative more condensed Cramer rule for the unique solution of some restricted left and right systems of quaternion linear equations. The findings of this paper extend some known results in the literature.     

Parametric duality on minimax programming involving generalized convexity in complex space

In this paper we employ generalized convexity of complex functions to establish several sufficient optimality conditions for minimax programming in complex spaces. Using such criteria, we constitute a parametrical dual, and establish the weak, strong, and strict converse duality theorems in the framework.     

Generalized Navier-Stokes equations with initial data in local Q-type spaces

In this paper, we establish a link between Leray mollified solutions of the three-dimensional generalized Navier-Stokes equations and mild solutions for initial data in the adherence of the test functions for the norm of . This result applies to the usual incompressible Navier-Stokes equations.     

A note on the hardness of Skolem-type sequences

The purpose of this note is to give upper bounds (assuming different from ) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly -complete. These results are significant strengthenings and simplifications of the recent -completeness result for generalized multi-Skolem sequences.