Related papers: Computing eulerian magnitude homology
Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Let $G$ be a connected graph. Given an ordered set $W = \{w_1, w_2,\dots w_k\}\subseteq V(G)$ and a vertex $u\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\dots,$ $d(u,w_k))$, where…
In this paper, we take a modest first step towards a systematic study of chromatic numbers of Cayley graphs on abelian groups. We lose little when we consider these graphs only when they are connected and of finite degree. As in the work of…
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Consider the configuration spaces of manifolds. We give a precise formula for the integral cohomological dimension (the degree of top non-trivial integral cohomology group) of unordered configuration spaces of manifolds with non-trivial…
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…
A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian extension (EE) where a directed multigraph G and a weight function is given and it is asked…
A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…
It is well known [Lov\'asz, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\hom(F, G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$ ranges over all graphs. Thus, in principle, we can answer…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
Given a simple graph $G$, its line graph, denoted by $L(G)$, is obtained by representing each edge of $G$ as a vertex, with two vertices in $L(G)$ adjacent whenever the corresponding edges in $G$ share a common endpoint. By applying the…