Related papers: Three-page encoding and complexity theory for spat…
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
Semantic segmentation of raw 3D point clouds is an essential component in 3D scene analysis, but it poses several challenges, primarily due to the non-Euclidean nature of 3D point clouds. Although, several deep learning based approaches…
We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
We propose a novel deep learning-based framework to tackle the challenge of semantic segmentation of large-scale point clouds of millions of points. We argue that the organization of 3D point clouds can be efficiently captured by a…
We consider holographic entanglement entropy in AdS black hole backgrounds by using the limit of large number of dimensions. By dividing the geometry to two patches (with one patch covering the vicinity of the black hole horizon and another…
Graph transformation theory relies upon the composition of rules to express the effects of sequences of rules. In practice, graphs are often subject to constraints, ruling out many candidates for composed rules. Focusing on the case of…
We extend the formalism of embedded spin networks and spin foams to include topological data that encode the underlying three-manifold or four-manifold as a branched cover. These data are expressed as monodromies, in a way similar to the…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
Motivated by the holographic prescriptions for computing entanglement entropy and complexity, we study the properties of volumes/areas of bulk surfaces. We obtain a simple formula for the shape dependence of holographic entanglement entropy…
We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…
For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
In this work we study the acyclic orientations of graphs. We obtain an encoding of the acyclic orientations of the complete $p$-partite graph with size of its parts $n_1,n_2,\ldots,n_p$ via a vector with $p$ symbols and length…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
The quadratic embedding property of graphs consisting of three paths (theta graphs) is fully characterised. For this aim, a theorem by Winkler (1985) is utilized. An alternative proof of that result using the RKHS technique is presented.