Related papers: Combinatorics of 1-particle irreducible n-point fu…
We use a coproduct on the time-ordered algebra of field operators to derive simple relations between complete, connected and 1-particle irreducible n-point functions. Compared to traditional functional methods our approach is much more…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be…
An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…
We present a new formula for the coaction of a large class of integrals. When applied to one-loop (cut) Feynman integrals, it can be given a diagrammatic representation purely in terms of pinches and cuts of the edges of the graph. The…
Using functional derivatives with respect to free propagators and interactions we derive a closed set of Schwinger-Dyson equations in quantum electrodynamics. Its conversion to graphical recursion relations allows us to systematically…
We describe a type of n-point function associated to strongly regular vertex operator algebras V and their irreducible modules. Transformation laws with respect to the Jacobi group are developed for 1-point functions. For certain elements…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…
The linear finite irreducible representations of the algebra of the 1D $N$-Extended Supersymmetric Quantum Mechanics are discussed in terms of their "connectivity" (a symbol encoding information on the graphs associated to the irreps). The…
We encapsulate the basic notions of the theory of vertex algebras into the construction of a comonad on an appropriate category of formal distributions. Vertex algebras are recovered as coalgebras over this comonad.
The current article considers Mayer cluster integrals of n-dimensional hard particles in the n>1 dimensional flat Euclidean space. Extending results from Wertheim and Rosenfeld, we proof that the graphs are completely reducible into 1- and…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
Complement-reducible graphs (or cographs) are the graphs formed from the single-vertex graph by the operations of complement and disjoint union. By combining the Johnson-Newman theorem on generalized cospectrality with the standard tools in…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs.…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…