Related papers: Notes on graphical functions with numerator struct…
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…
In this paper, we extend to the case of spin 1 the method we have devised for deriving generalized spin quantities from first principles, and which we illustrated using the spin-1/2 case. Again, we not only derive from first principles the…
Graph signal processing (GSP) has become an important tool in many areas such as image processing, networking learning and analysis of social network data. In this paper, we propose a broader framework that not only encompasses traditional…
We introduce a generalization of symmetric functions and apply the resulting theory to compute the class in the Grothendieck ring of varieties of the space of geometrically irreducible hypersurfaces of a fixed degree in projective space.
We derive the representation theory of $SU(2)$ from the expository theory of Lie groups and Lie algebras. Based on this, the mathematics of non-relativistic quantum mechanics of a spin $\frac{1}{2}$ particle are described from a…
We develop the theory of Wigner representations for general probabilistic theories (GPTs), a large class of operational theories that include both classical and quantum theory. The Wigner representations that we introduce are a natural way…
Graph-based modeling plays a fundamental role in many areas of computer science. In this paper, we introduce systems of graph formulas with variables for specifying graph properties; this notion generalizes the graph formulas introduced in…
Foundational cases of the generalized Stokes' theorem are visualized using geometric algebra. From considering bivector valued fields, two seldom used instances of the theorem are obtained. Graphical representations are given, showing a…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
The aim of this paper is to generalize Grothendieck's theory of smooth functors in order to include within this framework the theory of fibered categories. We obtain in particular a new characterization of fibered categories.
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
We present a generalization of Schlick's bias and gain functions -- simple parametric curve-shaped functions for inputs in [0, 1]. Our single function includes both bias and gain as special cases, and is able to describe other smooth and…
We define a certain abstract planar algebra by generators and relations, study various aspects of its structure, and then identify it with Jones' spin planar algebra.
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
We present some addition theorems for spin-weighted spherical harmonics, generalizing previous results for scalar (spin-zero) spherical harmonics. These addition theorems involve sums over the azimuthal quantum number of products of two…