Related papers: Some Comments on Multiple Discovery in Mathematics
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
We establish a dynamical version of Kuratowski-Mycielski Theorem on the existence of "large" invariant dependent sets. We apply this result to the study of invariant chaotic sets in topological dynamical systems, simplify many known results…
In this paper we study geometric coincidence problems in the spirit of the following problems by B. Gr\"unbaum: How many affine diameters of a convex body in $\mathbb R^n$ must have a common point? How many centers (in some sense) of…
The paradoxes of thermodynamics and statistical physics are unavoidable in the study of physical paradoxes because of their importance at the time they came to be as well as the frequency of their appearance in historical studies of…
Cross phenomena, representing responses of a system to external stimuli, are ubiquitous from quantum to macro scale. The Onsager theorem is often used to describe them, stating that the coefficient matrix of cross phenomena connecting the…
Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…
Pairs of consecutive integers have the same height in the Collatz problem with surprising frequency. Garner gave a conjectural family of conditions for exactly when this occurs. Our main result is an infinite family of counterexamples to…
Learning graphs from sets of nodal observations represents a prominent problem formally known as graph topology inference. However, current approaches are limited by typically focusing on inferring single networks, and they assume that…
The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…
Pairs of numerically computed trajectories of a chaotic system may coalesce because of finite arithmetic precision. We analyse an example of this phenomenon, showing that it occurs surprisingly frequently. We argue that our model belongs to…
In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…
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],…
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…
We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…
We give a homotopy invariant construction of the Reidemeister trace for the coincidence of two maps between closed manifolds of not necessarily the same dimensions. It is realized as a homology class of the homotopy equalizer, which…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…