Related papers: Beyond Sperner's lemma
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
Here, a non-linear analysis method is applied rather than classical one to study projective Finsler geometry. More intuitively, by means of an inequality on Ricci-Finsler curvature, a projectively invariant pseudo-distance is introduced and…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
In the first part of the article, a new interesting system of difference equations is introduced. It is developed for re-rating purposes in general insurance. A nonlinear transformation $\varphi $ of a d-dimensional $(d \ge 2)$ Euclidean…
We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…
Some fixed point results of classical theory, such as Banach's Fixed Point Theorem, have been previously extended by other authors to asymmetric spaces in recent years. The aim of this paper is to extend to asymmetric spaces some others…
We present a constructive proof of Brouwer's fixed point theorem with sequentially at most one fixed point, and apply it to the mini-max theorem of zero-sum games.
Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…
An abstract linking result for Cerami sequences is proved without the Cerami condition. It is applied directly in order to prove the existence of critical points for a class of indefinite problems in infinite dimensional Hilbert Spaces. The…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…
Let $G$ be a split $p$-adic reductive group with connected centre and simply connected derived subgroup. We show that certain "chains" of principal series of $G$ do not exist and we establish several properties of the Breuil-Herzig…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
Allegedly, Brouwer discovered his famous fixed point theorem while stirring a cup of coffee and noticing that there is always at least one point in the liquid that does not move. In this paper, based on a talk in honour of Brouwer at the…
This is the first in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global confor- mal invariants"; these are defined to be conformally invariant integrals of geometric scalars.…
We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…
The problem to be solved in this paper is to construct a general method of proving whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandhi's fixed point theorem. The classical…
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…