Related papers: Graph parameters from symplectic group invariants

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

Given a symplectomorphism f of a symplectic manifold X, one can form the `symplectic mapping cylinder' $X_f = (X \times R \times S^1)/Z$ where the Z action is generated by $(x,s,t)\mapsto (f(x),s+1,t)$. In this paper we compute the Gromov…

The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…

We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…

Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…

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 this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…

Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…

Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…

We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\varepsilon$ of edges and $\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\%$ of the possible range…

Simple semitoric systems were classified about ten years ago in terms of a collection of invariants, essentially given by a convex polygon with some marked points corresponding to focus-focus singularities. Each marked point is endowed with…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…

Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…

We propose a combination of a variational autoencoder and a transformer based model which fully utilises graph convolutional and graph pooling layers to operate directly on graphs. The transformer model implements a novel node encoding…

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

Many identities involving symmetric functions can be proved through bijective manipulations of tableaux. In this paper, we prove identities involving polysymmetric functions through bijections and sign-reversing involutions. In their paper…