Related papers: Three-page encoding and complexity theory for spat…

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…

We give a presentation for a non-split compact surface embedded in the 3-sphere by using diagrams of spatial trivalent graphs equipped with signs and we define Reidemeister moves for such signed diagrams. We show that two diagrams of…

Positional encoding has become a standard component in graph learning, especially for graph Transformers and other models that must distinguish structurally similar nodes, yet its fundamental identifiability remains poorly understood. In…

Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…

We calculate the spectrum of the diagram for each finite $3$-transposition group. Such graphs with a given minimal eigenvalue have occurred in the context of compact Griess subalgebras of vertex operator algebras.

Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques…

We present a detailed algorithm to construct symbolic encodings for chaotic attractors of three-dimensional flows. It is based on a topological analysis of unstable periodic orbits embedded in the attractor and follows the approach proposed…

The embedded template is a geometric tool in dynamics being used to model knots and links as periodic orbits of $3$-dimensional flows. We prove that for an embedded template in $S^3$ with fixed homeomorphism type, its boundary as a…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…

The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…

Based on a newly proposed spatial data model - spatial chromatic model (SCM), we developed a spatial coding scheme, called full-coded ordinary arranged chromatic diagram (full-OACD). Full-OACD is a type of spatial tessellation, where space…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…

Graph Transformers, which incorporate self-attention and positional encoding, have recently emerged as a powerful architecture for various graph learning tasks. Despite their impressive performance, the complex non-convex interactions…

Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…

It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane graph in which every triangle bounds a face has a two-page…

Encoding 3D points is one of the primary steps in learning-based implicit scene representation. Using features that gather information from neighbors with multi-resolution grids has proven to be the best geometric encoder for this task.…

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…