Abstract In this paper, the generalized Kannan-type contraction in cone metric spaces over Banach algebras is introduced. The fixed point theorems satisfying contractive conditions are obtained, without appealing to completeness of X or normality cone. continuity mapping relaxed. Furthermore, we prove that necessary if has a . These results greatly generalize several well-known comparable liter...

The rank of a bimatrix game (A,B) is the rank of the matrix A + B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).

Given a family of graphs $\mathcal{F}$, we prove that the normalized edit distance any given graph $\Gamma$ to being induced $\mathcal{F}$-free is estimable with query complexity depends only on bounds Frieze--Kannan regularity lemma and removal for $\mathcal{F}$.

In this paper, we first introduce a new class of the pointwise cyclic-noncyclic proximal contraction pairs. Then consider coincidence quasi-best proximity point problem for class. Finally, study points weak Kannan We an example to indicate validity main result.

The purpose of this paper is to obtain sufficient conditions for the existence of a unique fixed point of T -Kannan type mappings on complete cone metric spaces depended on another function.

In 1990, Cook, Kannan and Schrijver proved that the split closure (the 1st 1-branch split closure) of a polyhedron is again a polyhedron. They also gave an example of a 3-dimensional mixed-integer polytope whose 1-branch split rank is infinite. We generalize this example to a family of high-dimensional polytopes and present a closed-form description of the kth 1-branch split closure of these po...

We characterize the completeness of fuzzy quasi-metric spaces by means a fixed point theorem Kannan-type.Thus, we extend classical characterization metric due to Subrahmanyam as well recent resultsin literature on and completeness, respectively. Wealso introduce discuss contractions Chatterjea-type in this asymmetric context.

We show analogues of Minkowski’s theorem on successive minima, where the volume is replaced by the lattice point enumerator. We further give analogous results to some recent theorems by Kannan and Lovász on covering minima.

The rank of a bimatrix game (A,B) is the rank of the matrix A + B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).