Related papers: Banach-Mazur game and open mapping theorem
We provide sufficient conditions for a mapping between two Banach spaces to be a diffeomorphism using the approach of an auxiliary functional and also by the aid of a duality mapping corresponding to a normalization function. We simplify…
The Robinson-Goforth topology of swaps in adjoining payoffs elegantly arranges 2x2 ordinal games in accordance with important properties including symmetry, number of dominant strategies and Nash Equilibria, and alignment of interests.…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
In this paper, by establishing a new characterization of the notion of upper semi-continuity of multi-valued mappings in generalized Banach spaces, we prove some Perov type fixed point theorems for multi-valued mappings with closed graphs.…
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…
The theory of compact linear operators acting on a Banach space has such a classical core and is familiar to many. Perhaps lesser known is the characterization theorem of Terzio\u{g}lu for compact maps. In this paper we consider…
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes…
The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.
This paper presents an overview of the current state of knowledge in the field of equivariant map algebras and discusses some open problems in this area.
We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a graph it is possible to change one into another via these…
The goal of this survey is to give a list of resent results about topology of manifolds admitting different metrics with the same geodesics. We emphasize the role of the theory of integrable systems in obtaining these results.
In this article, we study questions pertaining to ramified $\mathbb{Z}_p^d$-extensions of a finite connected graph $X$. We also study the Iwasawa theory of dual graphs.
We establish the existence of fixed points for set-valued maps defined on metric spaces and satisfying a pointwise or a local version of Banach's contraction property. As an application, we demonstrate the existence of Nash equilibrium in a…
We study bipartite correlations in Bell-type games. We show that in a setup where the information carriers are allowed to locally deform the manifold on which the game is played, stronger correlations may be obtained than those maximally…
For a system of ODEs defined on an open, convex domain $U$ containing a positively invariant set $\Gamma$, we prove that under appropriate hypotheses, $\Gamma$ is the graph of a $C^r$ function and thus a $C^r$ manifold. Because the…
A bidimensional representation of the space of 2x2 Symmetric Games in the strategic representation is proposed. This representation provides a tool for the classification of 2x2 symmetric games, quantification of the fraction of them having…
We define the Sign Game as a two-player game played on a simple undirected mathematical graph $G$. The players alternate turns, assigning vertices of $G$ either $1$ or $-1$, and edges take on the value of the product of their endvertices.…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.