Related papers: Introducing Loopedia
Loopedia is a new database at loopedia.org for information on Feynman integrals, intended to provide both bibliographic information as well as results made available by the community. Its bibliometry is complementary to that of SPIRES or…
Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that describe various structural properties of a chemical…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
Sustainable roofs, such as those with greenery and photovoltaic panels, contribute to the roadmap for reducing the carbon footprint of cities. However, research on sustainable urban roofscapes is rather focused on their potential and it is…
We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique…
This paper describes how to implement a documentation technique that helps readers to understand large programs or collections of programs, by providing local indexes to all identifiers that are visible on every two-page spread. A detailed…
Libraries of formal proofs are an important part of our mathematical heritage, but their usability and sustainability is poor. Indeed, each library is specific to a proof system, sometimes even to some version of this system. Thus, a…
The neighborhood degree list (NDL) is a graph invariant that refines information given by the degree sequence and joint degree matrix of a graph and is useful in distinguishing graphs having the same degree sequence. We show that the space…
Feynman diagrams are a pictorial way of describing integrals predicting possible outcomes of interactions of subatomic particles in the context of quantum field physics. It is highly desirable to have an intrinsic mathematical…
This paper introduces Data2Neo, an open-source Python library for converting relational data into knowledge graphs stored in Neo4j databases. With extensive customization options and support for continuous online data integration from…
Two programs, feyngen and feyncop, were developed. feyngen is designed to generate high loop order Feynman graphs for Yang-Mills, QED and $\phi^k$ theories. feyncop can compute the coproduct of these graphs on the underlying Hopf algebra of…
We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be…
The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…
We study the lobby index (l-index for short) as a local node centrality measure for complex networks. The l-inde is compared with degree (a local measure), betweenness and Eigenvector centralities (two global measures) in the case of…
The forgotten topological index or F-index of a graph is defined as the sum of degree cube of all the vertices of the graph. This index was introduced by Gutman and Trinajesti\'{c} more than 40 years ago. In this paper, we derive F-index of…
Link prediction is a crucial task in many downstream applications of graph machine learning. To this end, Graph Neural Network (GNN) is a widely used technique for link prediction, mainly in transductive settings, where the goal is to…
We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimental results, this creates a demand for a public archive to…
CoCoE stands for Complexity, Coherence and Entropy, and presents an extensible methodology for empirical analysis of Linked Open Data (i.e., RDF graphs). CoCoE can offer answers to questions like: Is dataset A better than B for knowledge…