Related papers: Which Vertical Graphs are Non VPHT Reconstructible…

In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent. We…

We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…

This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…

In vector tomography (VT), the aim is to reconstruct an unknown multi-dimensional vector field using line integral data. In the case of a 2-dimensional VT, two types of line integral data are usually required. These data correspond to…

A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, there exists a unique smallest Helly graph H(G) into which G…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

In this article we study the equivariant elliptic cohomology of complex toric varieties. We prove a partial reconstruction theorem showing that equivariant elliptic cohomology encodes considerable non-trivial information on the equivariant…

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in the context of terrains. Here, we are given a graph $G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling corresponds with a…

We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that…

Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…

Geometric structures on $\mathbb N Q$-manifolds, i.e.~non-negatively graded manifolds with an homological vector field, encode non-graded geometric data on Lie algebroids and their higher analogues. A particularly relevant class of…

In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered, by means of projection data collected along a set $U$ of discrete directions. Possible ambiguous reconstructions can arise if and only if…

Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram. Computing persistence diagrams is often the…

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…

Persistent Homology (PH) is a useful tool to study the underlying structure of a data set. Persistence Diagrams (PDs), which are 2D multisets of points, are a concise summary of the information found by studying the PH of a data set.…

A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an…

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

A translation structure on a surface is an atlas of charts to the plane so that the transition functions are translations. We allow our surfaces to be non-compact and infinite genus. We endow the space of all pointed surfaces equipped with…

We complete the classification of almost commutative geometries from a particle physics point of view given in hep-th/0312276. Four missing Krajewski diagrams will be presented after a short introduction into irreducible, non-degenerate…