相关论文: Spider Evaluation and Representations of Web Group…
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
We define $2n$-multiwebs on planar graphs and discuss their relation with $\mathrm{Sp}(2n)$-webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of $2n$-multiwebs. As application we…
We show that the topological equivalence class of holomorphic foliation germs with an isolated singularity of Poincar\'e type is determined by the topological equivalence class of the real intersection foliation of the (suitably normalized)…
In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…
An algebraic domain is a closed topological subsurface of a real affine plane whose boundary consists of disjoint smooth connected components of real algebraic plane curves. We study the geometric shape of an algebraic domain by collapsing…
Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…
The zeroth-order general Randi\'c index (usually denoted by $R_{\alpha}^{0}$) and variable sum exdeg index (denoted by $SEI_{a}$) of a graph $G$ are defined as $R_{\alpha}^{0}(G)= \sum_{v\in V(G)} (d_{v})^{\alpha}$ and $SEI_{a}(G)=…
This elementary note proposes candidates for interesting continuous piecewise-smooth `Riemannian' metrics on the moduli spaces of rooted geodesic trees embedded in the Poincar\'e disk. A related digression observes the existence of an…
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
A unit disk intersection representation (UDR) of a graph $G$ represents each vertex of $G$ as a unit disk in the plane, such that two disks intersect if and only if their vertices are adjacent in $G$. A UDR with interior-disjoint disks is…
Graph embeddings play a critical role in graph representation learning, allowing machine learning models to explore and interpret graph-structured data. However, existing methods often rely on opaque, high-dimensional embeddings, limiting…
A network's topology information can be given as an adjacency matrix. The bitmap of sorted adjacency matrix(BOSAM) is a network visualisation tool which can emphasise different network structures by just looking at reordered adjacent…
Ranking nodes in networks according to a defined measure of importance is an extensively studied task, with applications in ecology, economic trade networks, and social networks. This paper introduces a method based on a non-linear…
The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…
We study the structural properties of the neural network of the C.elegans (worm) from a directed graph point of view. The Google matrix analysis is used to characterize the neuron connectivity structure and node classifications are…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geodesics which cover the edge set of the graph. The geodesic…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
We describe the rank 3 Temperley-Lieb-Martin algebras in terms of Kuperberg's A_2-webs. We define consistent labelings of webs, and use them to describe the coefficients of decompositions into irreducible webs. We introduce web immanants,…