Related papers: Computing SL(2,C) Central Functions with Spin Netw…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
Given a valued graph, where both the nodes and the edges of the graph are associated with one or several values, any network function for a given node must be defined in terms of that node and its connected nodes in the graph. Generally,…
Horn functions form a subclass of Boolean functions possessing interesting structural and computational properties. These functions play a fundamental role in algebra, artificial intelligence, combinatorics, computer science, database…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
Arakelov-Green functions defined on metrized graphs have important role in relating arithmetical problems on algebraic curves into graph theoretical problems. In this paper, we clarify the combinatorial interpretation of certain…
Let $G(g;x):=\sum_{n\leq x}g(n)$ be the summatory function of an arithmetical function $g(n)$. In this paper, we prove that we can write weighted averages of an arbitrary fixed number $N$ of arithmetical functions $g_{j}(n),\,j\in\left\{…
Recall first the algebraic treatment of flows or tensions in a transportation network $N$, i.e. a connected antisymmetric 1-graph $G(X, U)$. Assume that, unusually, we take the values of flows (resp. tensions) in $\mathbb{C}$. So the…
Working in the context of the proposed duality between 3D higher spin gravity and 2D W_N minimal model CFTs, we compute a class of four-point functions in the bulk and on the boundary, and demonstrate precise agreement between them. This is…
In the study of integrable non-linear $\sigma$-models which are assemblies and/or deformations of principal chiral models and/or WZW models, a rational function called the twist function plays a central role. For a large class of such…
The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph. In this article, we use the PageRank function along with persistent homology to obtain a scalable…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
An example of an activation function $\sigma$ is given such that networks with activations $\{\sigma, \lfloor\cdot\rfloor\}$, integer weights and a fixed architecture depending on $d$ approximate continuous functions on $[0,1]^d$. The range…
The complete knowledge of a theory is encoded in its correlation functions. Thus non-perturbative effects, like confinement in QCD, is necessarily contained in these correlation functions. As a consequence, a number of confinement scenarios…
We derive explicit formulae to compute the $a$ and $c$ central charges of four dimensional $\mathcal{N}=2$ superconformal field theories (SCFTs) directly from Coulomb branch related quantities. The formulae apply at arbitrary rank. We also…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
We consider two functions on Sp(g,R) with values in the cyclic group of order four {1,-1,i,-i}. One was defined by Lion and Vergne. The other is -i raised to the power given by an integer valued function defined by Masbaum and the author…