The Edge-Diametric Theorem in Hamming Spaces

The Diametric Theorem in Hamming Spaces-Optimal Anticodes

Ž n . For a Hamming space X , d , the set of n-length words over the alphabet a H 4 n X s 0, 1, . . . , a y 1 endowed with the distance d , which for two words x s a H Ž . n Ž . n x , . . . , x , y s y , . . . , y g X counts the number of different components, 1 n 1 n a we determine the maximal cardinality of subsets with a prescribed diameter d or, in another language, anticodes with distance ...

Fan-KKM Theorem in Minimal Vector Spaces and its Applications

In this paper, after reviewing some results in minimal space, some new results in this setting are given. We prove a generalized form of the Fan-KKM typetheorem in minimal vector spaces. As some applications, the open type of matching theorem and generalized form of the classical KKM theorem in minimal vector spaces are given.

A Fixed Point Theorem in Generalized D-metric Spaces

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings

In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...

Diametric theorems in seuence spaces

In a finite metric space (F, #) a (discrete) diametrical problem concerns a quest ion like "How large can a subset A of F with #(a, a I) <_ 5 for all a, a I E A be and what are the opt imal configurations?" For systems of subsets with the union function d V or binary sequences with the Hamming distance dH the diametrical problems have been solved by Ka tona [3] and Klei tman [4], respectively. ...