Related papers: When does the table theorem imply a solution to th…
The Newcomb's paradox is one of the most known paradox in Game Theory about the Oracles. We will define the graph associated to the time lines of the Game. After this Studying its topology and using only the Expected Utility Principle we…
The connected door space is an enigmatic topological space in which every proper nonempty subset is either open or closed, but not both. This paper provides an elementary proof of the classification theorem of connected door spaces. More…
Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
Among perhaps many things common to Kuratowski's Theorem in graph theory, Reidemeister's Theorem in topology, and Cook's Theorem in theoretical computer science is this: all belong to the phenomenon of simultaneous discovery in mathematics.…
This document develops general concepts useful for extracting knowledge embedded in large graphs or datasets that have pair-wise relationships, such as cause-effect-type relations. Almost no underlying assumptions are made, other than that…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
A classic problem in analysis is to solve nonlinear equations of the form \begin{equation*} F(x)=0, \end{equation*} where $F:D^n\to \mathbb{R}^m$ is a continuous map of the closed unit disk $D^n\subset\mathbb{R}^n$ in $\mathbb{R}^m$. A…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
This note describes some open problems that can be examined with the purpose of gaining additional insight of how to solve the problem of finding a general classification of geodetic graphs
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…
The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of…
A possible link between Holography and Information Theory is presented. Using the relation between the Shannon and Boltzmann formulas Holography can be seen as the best encoding scheme.
Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…
The order topology $\tau_o(P)$ (resp. the sequential order topology $\tau_{os}(P)$) on a poset $P$ is the topology that has as its closed sets those that contain the order limits of all their order convergent nets (resp. sequences). For a…