Related papers: Beyond Sperner's lemma
In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…
We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…
We prove a fixed-point theorem that generalises and simplifies a number of results in the theory of $F$-contractions. We show that all of the previously imposed conditions on the operator can be either omitted or relaxed. Furthermore, our…
The proof of the combinatorial Hard Lefschetz Theorem for the ``virtual'' intersection cohomology of a not necessarily rational polytopal fan that has been presented by K. Karu completely establishes Stanley's conjectures for the…
For an abelian category and a distinguished object with a graded endomorphism ring a necessary and sufficient criterion is given so that the category is equivalent to the abelian quotient of the category of finitely presented graded modules…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
All product fixed point results in ordered metric spaces based on linear contractive conditions are but a vectorial form of the fixed point statement due to Nieto and Rodriguez-Lopez [Order, 22 (2005), 223-239], under the lines in Matkowski…
Combinatorial analogues of classical Borsuk-Ulam-type theorems (e.g., Tucker's lemma, $\mathbb{Z}_p$-Tucker's lemma, etc.) have numerous important applications in combinatorics. In this paper, we formulate a combinatorial degree version of…
Given a selfmap $f:X\to X$ on a compact connected polyhedron $X$, H. Schirmer gave necessary and sufficient conditions for a nonempty closed subset $A$ to be the fixed point set of a map in the homotopy class of $f$. R. Brown and C.…
We present a proof of Arrow's theorem from social choice theory that uses a fixpoint argument. Specifically, we use Banach's result on the existence of a fixpoint of a contractive map defined on a complete metric space. Conceptually, our…
The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…
In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…
Michael Handel has proved in [Ha] a fixed point theorem for an orientation preserving homeomorphism of the open unit disk, that turned out to be an efficient tool in the study of the dynamics of surface homeomorphisms. The present article…
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…
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…
The presented splitting lemma extends the techniques of Gromov and Forstneri\v{c} to glue local sections of a given analytic sheaf, a key step in the proof of all Oka principles. The novelty on which the proof depends is a lifting lemma for…
A geometric argument is given to prove that the Seifert genus of a positive knot equals its slice genus. A combinatorial invariant, giving a lower bound for the slice genus, is formulated for arbitrary knots. Properties and applications of…