Related papers: An easy (horizontal) walk through fake octagons
I humbly introduce a concept I call "Fregean flows," a graph theoretic representation of classical logic, to show how higher-dimensional graph characteristics might be useful to prove or perhaps at best show the provability of simple…
An iterative map of the unit disc in the complex plane (Appendix) is used to explore certain aspects of selfdual, four dimensional gauge fields (quasi)periodic in the Euclidean time. These fields are characterized by two topological numbers…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…
This is a revised version of a part of the author's preprint "On p-adic uniformization of fake projective planes" (preprint, Max-Planck-Institut fuer Mathematik, 1998 (121)). In this paper we construct explicitly a Shimura surface of…
A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…
Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass streaming graph algorithms. These algorithms were designed for…
Origami is an ancient art that continues to yield both artistic and scientific insights to this day. In 2012, Buhler, Butler, de Launey, and Graham extended these ideas even further by developing a mathematical construction inspired by…
The increasing popularity of facial manipulation (Deepfakes) and synthetic face creation raises the need to develop robust forgery detection solutions. Crucially, most work in this domain assume that the Deepfakes in the test set come from…
We construct the first examples of what we call fake ES-irreducible components; Definition 2.8. In our way to do so, we classify the automorphism groups of smooth plane sextics that only have automorphisms of order 3 or less; Theorems 2.1,…
The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…
Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving…
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the…
A family of algebraic surfaces with many nondegenerate real singularities is introduced with the help of a construction, which has been used in previous works for the generation of substitution tilings.
We construct a signal from "almost" pure oscillations within some low frequency band. We construct it to produce a superoscillation with frequency above the nominal band limit. We find that indeed the required high frequency is produced but…
It is known that Kolmogorov-Arnold-Moser boundaries appear in sufficiently smooth 2-dimensional area-preserving maps. When such boundaries are destroyed, they become pseudo-boundaries. We show that pseudo-boundaries can also be found in…
A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures,…
The addendum updates the results presented in the paper `Fake Projective Plane, Invent Math 168, 321-370 (2007)' and makes some additions and corrections. The fake projective planes are classified into twenty six classes. Together with a…
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant…
R. Crew conjectured that every overconvergent F-isocrystal over k((t)) (k a field of positive characteristic) is quasi-unipotent (equivalently, potentially semistable), and so has ``generic'' and ``special'' Newton polygons. It is easy to…