Related papers: Using the KKM theorem
We build on work of Muro-Raptis in [Ann. K-Theory 2 (2017), no. 2, 303-340] and Cisinski-Neeman in [Adv. Math. 217 (2008), no. 4, 1381-1475] to prove that the additivity of derivator K-theory holds for a large class of derivators that we…
In a paper of 1929, Banach and Kuratowski proved, assuming the continuum hypothesis, a combinatorial theorem which implies that there is no non-vanishing sigma-additive finite measure on the real line which is defined for every set of…
The Lefschetz fixed point theorem follows easily from the identification of the Lefschetz number with the fixed point index. This identification is a consequence of the functoriality of the trace in symmetric monoidal categories. There are…
The K-means algorithm is among the most commonly used data clustering methods. However, the regular K-means can only be applied in the input space and it is applicable when clusters are linearly separable. The kernel K-means, which extends…
We are concerned with the study of fixed points for mappings $T: X\to X$, where $(X,G)$ is a $G$-metric space in the sense of Mustafa and Sims. After the publication of the paper [Journal of Nonlinear and Convex Analysis. 7(2) (2006)…
This is part II of our book on KAM theory. We start by defining functorial analysis and then switch to the particular case of Kolmogorov spaces. We develop functional calculus based on the notion of local operators. This allows to define…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
The KPZ fixed point is a scaling invariant Markov process which arises as the universal scaling limit of a broad class of models of random interface growth in one dimension, the one-dimensional KPZ universality class. In this survey we…
This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…
In this note, we review the history of Khintchine's Theorem which is the foundation of metric Diophantine approximation, and discuss several generalizations and recent breakthroughs in this area. We focus particularly on the direction of…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…
A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically…
The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. This problem is very important in applications but there is no systematic study of it. We present here a new technique, which…
We establish a fixed point property for a certain class of locally compact groups, including almost connected Lie groups and compact groups of finite abelian width, which act by simplicial isometries on finite rank buildings with measurable…
In this article, we generalize some frequently used metrical notions such as: completeness, closedness, continuity, g-continuity and compatibility to relation-theoretic setting and utilize these relatively weaker notions to prove results on…
We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…
In this announcement we generalize the Markov-Kakutani fixed point theorem for abelian semi-groups of affine transformations extending it on some class of non-commutative semi-groups. As an interesting example we apply it obtaining a…
The development of quantum theory on a torus has a long history, and can be traced back to the 1920s, with the attempts by Nordstr\"om, Kaluza and Klein to define a fourth spatial dimension with a finite size, being curved in the form of a…
In many physical, statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpose, Karl Pearson invented principal component analysis in…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…