Related papers: Codes on graphs: Duality and MacWilliams identitie…
We present a novel form of Fourier analysis, and associated signal processing concepts, for signals (or data) indexed by edge-weighted directed acyclic graphs (DAGs). This means that our Fourier basis yields an eigendecomposition of a…
Unveiling hidden symmetries within Feynman diagrams is crucial for achieving more efficient computations in high-energy physics. In this paper, we study the symmetries underlying the causal Loop-Tree Duality (LTD) representations through a…
Dualities are mathematical mappings that reveal unexpected links between apparently unrelated systems or quantities in virtually every branch of physics. Systems that are mapped onto themselves by a duality transformation are called…
We study generalized electric/magnetic duality in Abelian gauge theory by combining techniques from locally covariant quantum field theory and Cheeger-Simons differential cohomology on the category of globally hyperbolic Lorentzian…
For a covariant functor W. Fulton and R. MacPherson defined \emph{an operational bivariant theory} associated to this covariant functor. In this paper we will show that given a contravariant functor one can similarly construct a ``dual"…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
Representing and exploiting multivariate signals requires capturing relations between variables, which we can represent by graphs. Graph dictionaries allow to describe complex relational information as a sparse sum of simpler structures,…
We consider finite quantum systems defined by a mixed set of commutation and anti-commutation relations between components of the Hamiltonian operator. These relations are represented by an anti-commutativity graph which contains a…
The theory of differential characters is developed completely from a de Rham - Federer viewpoint. Characters are defined as equivalence classes of special currents, called sparks, which appear naturally in the theory of singular…
Recently there has been increased interest in semi-supervised classification in the presence of graphical information. A new class of learning models has emerged that relies, at its most basic level, on classifying the data after first…
A graph $G = (V,E)$ is a double-threshold graph if there exist a vertex-weight function $w \colon V \to \mathbb{R}$ and two real numbers $\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$ such that $uv \in E$ if and only if $\mathtt{lb} \le…
We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…
For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
We show that interval partition functions (transition amplitudes) of three-dimensional $N = 2$ theories admit factorizations into sums of products of hemisphere partition functions with additional normalization factors. We prove the…
Gross, Mansour and Tucker introduced the partial-twuality polynomial of a ribbon graph. Chumutov and Vignes-Tourneret posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
In this paper we set up a bivariate representation of partial theta functions which not only unifies some famous identities for partial theta functions due to Andrews and Warnaar, et al. but also unveils a new characteristic of such…
Double vector bundles may be dualized in two distinct ways and these duals are themselves dual. These two dualizations generate a group, denoted $\mathscr{D}\mathscr{F}_2$, which is the symmetric group $S_3$ on three symbols. In the case of…