Related papers: Which Vertical Graphs are Non VPHT Reconstructible…
Learning workable representations of dynamical systems is becoming an increasingly important problem in a number of application areas. By leveraging recent work connecting deep neural networks to systems of differential equations, we…
Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…
Let $P$ be a Poisson structure on a finite-dimensional affine real manifold. Can $P$ be deformed in such a way that it stays Poisson? The language of Kontsevich graphs provides a universal approach -- with respect to all affine Poisson…
Holographic reduced representations (HRR) are based on superpositions of convolution-bound $n$-tuples, but the $n$-tuples cannot be regarded as vectors since the formalism is basis dependent. This is why HRR cannot be associated with…
Including intricate topological information (e.g., cycles) provably enhances the expressivity of message-passing graph neural networks (GNNs) beyond the Weisfeiler-Leman (WL) hierarchy. Consequently, Persistent Homology (PH) methods are…
After introducing a noncommutative counterpart of commutative algebraic geometry based on monoidal categories of quasi-coherent sheaves we show that various constructions in noncommutative geometry (e.g. Morita equivalences, Hopf-Galois…
In the time evolution of fluids, the topologies of fluids can be changed by the creations and annihilations of singular points and by switching combinatorial structures of separatrices. In this paper, to describe the possible generic time…
Without leaving finite mathematics and using finite topological spaces only, we give a definition of homeomorphisms of finite abstract simplicial complexes or finite graphs. Besides exploring the definition in various contexts, we add some…
A Heffter array is an m by n matrix with nonzero entries from Z_{2mn+1} such that i) every row and column sum to 0, and ii) no element from {x,-x} appears twice. We construct some Heffter arrays. These arrays are used to build current…
Topological holography is a conjectured correspondence between the symmetry charges and defects of a $D$-dimensional system with the anyons in a $(D+1)$-dimensional topological order: the symmetry topological field theory (SymTFT).…
For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…
Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. Even though PH has been used in many different types of applications, the reasons behind its success remain elusive; in particular, it is not known…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
Multiscale shape skeletonization on pixel adjacency graphs is an advanced intriguing research subject in the field of image processing, computer vision and data mining. The previous works in this area almost focused on the graph vertices.…
In this paper we introduce the horizon visibility graph, a simple extension to the popular horizontal visibility graph representation of a time series, and show that it possesses a rigorous mathematical foundation in computational algebraic…
The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…
This paper gives a classification of the topology of vector fields which are nowhere tangent to the fibers of a Seifert fibering.
Some functorial and topological properties of vertical cohomologies and their application to completely integrable Hamiltonian systems are studied.
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…