Related papers: Scaffolds: a graph-based system for computations i…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
It is often noted that many of the basic concepts of differential geometry, such as the definition of connection, are purely algebraic in nature. Here, we review and extend existing work on fully algebraic formulations of differential…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…
The Wiener index $W(G)$ of a connected graph $G$ is a sum of distances between all pairs of vertices of $G$. In 1991, \v{S}olt\'{e}s formulated the problem of finding all graphs $G$ such that for every vertex $v$ the equation $W(G)=W(G-v)$…
A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…
This paper introduces the concept of supermanifolds, viewed as the super-analogues of classical manifolds. Instead of treating supermanifolds as sets of points, we adopt an algebraic-geometric perspective, emphasizing the algebra of…
To a large class of graphs of groups we associate a C*-algebra universal for generators and relations. We show that this C*-algebra is stably isomorphic to the crossed product induced from the action of the fundamental group of the graph of…
We derive a full Bern-Kosower-type rule for scalar QED starting from quantum field theory: we derive a set of rules for calculating $S$-matrix elements for any processes at any order of the coupling constant. Gauge-invariant set of diagrams…
We survey the mathematical foundations of geometric deep learning, focusing on group equivariant and gauge equivariant neural networks. We develop gauge equivariant convolutional neural networks on arbitrary manifolds $\mathcal{M}$ using…
We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
Given a totally positive matrix, can one insert a line (row or column) between two given lines while maintaining total positivity? This question was first posed and solved by Johnson and Smith who gave an algorithm that results in one…
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
The classical Kolmogorov-Gelfand theorem gives an embedding of a (compact Hausdorff) topological space X into the linear space of all linear functionals C(X)^* on the algebra of continuous functions C(X). The image is specified by algebraic…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…
Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…
It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…
The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…