Related papers: The $c_2$ invariant is invariant
The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…
The c-map of four dimensional non-linear theories of electromagnetism is considered both in the rigid case and in its coupling to gravity. In this way theories with antisymmetric tensors and scalars are obtained, and the three non-linear…
A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…
We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…
We consider the family of piecewise linear maps $$F_{a,b}(x,y)=\left(|x| - y + a, x - |y| + b\right),$$ where $(a,b)\in \mathbb{R}^2$. This family belongs to a wider one that has deserved some interest in the recent years as it provides a…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
A careful look at an allegedly well-known century-old concept reveals interesting aspects in it that have generally avoided recognition in literature. There are four different kinds of physical observables known or proclaimed as…
This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
We show that momentum space Feynman diagrams involving internal massless fields can be cast as conformal integrals. This leads to a classification of all Feynman diagrams into conformal families, labelled by conformal integrals. Computing…
The time evolution of a wave function with $N$ time variables through the Feynman picture of quantum mechanics is derived. However, these evolutions will be compatible if and only if the $N$ Lagrangians satisfy a certain relation called the…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
The standard argument why gravity is not renormalisable relies on direct powercounting of Feynman graphs to estimate the degree of UV divergence. This analysis has in several (highly) supersymmetric examples be shown to overestimate…
Canonical vacuum gravity is expressed in generally-covariant form in order that spacetime diffeomorphisms be represented within its equal-time phase space. In accordance with the principle of general covariance, the time mapping ${\T}:…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
A flow invariant is a quantity depending only on the UV and IR conformal fixed points and not on the flow connecting them. Typically, its value is related to the central charges a and c. In classically-conformal field theories, scale…