Related papers: Entropy, cocycles, and their diagrammatics
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its…
In our study of electrical networks we develop two themes: finding explicit formulas for special classes of functions defined on the vertices of a transient network, namely monopoles, dipoles, and harmonic functions. Secondly, our interest…
For many finite groups a symmetric $2$-cocycle $\alpha$ ($\alpha(g,h)=\alpha(h,g)$, for all pairs $(h,g)$ of the group) with values in $\mathbb{C}^\times$ is a coboundary. We show using a theoretic arguement and GAP that there is a group of…
The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a…
The relative entropy in two-dimensional field theory is studied on a cylinder geometry, interpreted as finite-temperature field theory. The width of the cylinder provides an infrared scale that allows us to define a dimensionless relative…
We consider the monodromy group of the differential systems for multiloop integrals. We describe a simple heuristic method to obtain the monodromy matrices as functions of space-time dimension $d$. We observe that in a special basis the…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
This paper studies planar algebras of Jones' style associated with the Young graph. We first see that, given a positive real valued function on the Young graph, we may obtain a planar algebra whose structure is defined in terms of a state…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…
In this paper, we study cryptography from a geometrical viewpoint. Let N be a network, we endow N with a natural Grothendieck topology. We use geometric representations of cohomological classes to define encryptions protocols. Link to link…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
The holographic representation of the entanglement entropy of four dimensional conformal field theories is studied. By generalizing the replica trick the anomalous terms in the entanglement entropy are evaluated. The same terms in the…
We study the problem of learning a binary classifier on the vertices of a graph. In particular, we consider classifiers given by monophonic halfspaces, partitions of the vertices that are convex in a certain abstract sense. Monophonic…
This article proposes a method to quantify the structure of a bipartite graph using a network entropy per link. The network entropy of a bipartite graph with random links is calculated both numerically and theoretically. As an application…
We give an explicit handy (and cocycle-free) description of the groupoid of weak maps between two crossed-modules in terms of certain digrams of groups which we we call a {\em butterflies}. We define composition of butterflies and this way…