Related papers: Scaffolds: a graph-based system for computations i…

We provide a framework for the construction of diffeomorphism invariant sheaves of nonlinear generalized functions spaces. As an application, global algebras of generalized functions for distributions on manifolds and diffeomorphism…

Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from…

We consider dataflow architecture for two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We improve the earlier technique of almost continuous program…

We propose an algebro-geometric interpretation of the Schur and Macdonald indices of four-dimensional $\mathcal{N}=2$ superconformal field theories (SCFTs). We conjecture that there exists an affine scheme $X$, which reduces to the Higgs…

While studying gradient dynamical systems (DSs), Morse introduced the idea of encoding the qualitative behavior of a DS into a graph. Smale later refined Morse's idea and extended it to Axiom-A diffeomorphisms on manifolds. In Smale's…

Let $G$ be a graph. Denote by $d_x$, $E(G)$, and $D(G)$ the degree of a vertex $x$ in $G$, the set of edges of $G$, and the degree set of $G$, respectively. This paper proposes to investigate (both from mathematical and applications points…

This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…

A finite-dimensional linear representation of a group or an algebra may be regarded as a map into a space of matrices, endowing abstract elements with coordinates, and encoding algebraic operations as matrix products. With this in mind, we…

This paper lays the foundations for a nonlinear theory of differential geometry that is developed in a subsequent paper which is based on Colombeau algebras of tensor distributions on manifolds. We adopt a new approach and construct a…

We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…

Topographs, introduced by Conway in 1997, are infinite trivalent planar trees used to visualize the values of binary quadratic forms. In this work, we study series whose terms are indexed by the vertices of a topograph and show that they…

This book studies ultrafilters on connectivity systems, that is, on pairs \((X,f)\) where \(X\) is a finite set and \(f:2^{X}\to \mathbb{N}\) is a symmetric submodular function. Ultrafilters, which play a fundamental role in topology and…

{\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\sum_{e=uv \in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$…

We develop a diagrammatic language for symmetric product orbifolds of two-dimensional conformal field theories. Correlation functions of twist operators are written as sums of diagrams: each diagram corresponds to a branched covering map…

If $X$ is a smooth manifold then the $\mathbb R$-algebra $C^\infty(X)$ of smooth functions $c:X\to\mathbb R$ is a $C^\infty$-$ring$. That is, for each smooth function $f:{\mathbb R}^n\to\mathbb R$ there is an $n$-fold operation…

Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…

We find that multiple vertex algebras can arise from a single 4d $\mathcal{N}=2$ superconformal field theory (SCFT). The connection is given by the BPS monodromy operator $M$, which is a wall-crossing invariant quantity that captures the…

In this paper, we develop a manifestly geometric framework for equivariant manifold neural ordinary differential equations (NODEs) and use it to analyse their modelling capabilities for symmetric data. First, we consider the action of a Lie…