Related papers: Joining dessins together
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating…
In this short note we identify a family of partition functions recently introduced by Wang, Liu, Zhang, and Zhao with certain specializations of the generating function for dessins d'enfant. This provides a new W-description for orbifold…
In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…
The diagrammatic coaction maps any given Feynman graph into pairs of graphs and cut graphs such that, conjecturally, when these graphs are replaced by the corresponding Feynman integrals one obtains a coaction on the respective functions.…
Series involving hypergeometric functions are used to derive, extend and evaluate integrals involving the product of two Bessel functions of the first kind $J_{u}(a z)$ $J_{v}(b z)$ with order $u,v$, studied by Landau et al. The method used…
We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define…
In addition to the three standard operations on posets which are dual of poset or ordinal and cardinal sums of partial ordered sets one adds the natural join of posets. This is especially natural natural join operation for graded posets…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…
This is the text accompanying my Bourbaki seminar on the work of Einsiedler and Lindenstrauss on joinings. The first five sections surveys their proof of the classification of joinings of higher-rank torus actions on arithmetic quotients of…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…
Graphs are a powerful mathematical model, and they are used to represent real-world structures in various fields. In many applications, real-world structures with high connectivity and robustness are preferable. For enhancing the…
We improve a recent result by Shparlinski and Banks related to sums with convolution of Dirichlet characters.
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…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
We develop an alternative view on the concept of connections over a vector bundle map, which consists of a horizontal lift procedure to a prolonged bundle. We further focus on prolongations to an affine bundle and introduce the concept of…
We construct an extension of the Kontsevich integral of knots to knotted trivalent graphs, which commutes with orientation switches, edge deletions, edge unzips, and connected sums. In 1997 Murakami and Ohtsuki [MO] first constructed such…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…