Related papers: Trees, graphs and aggregates: a categorical perspe…
Inspired by the seminal result that a graph and an associated rotation system uniquely determine the topology of a closed manifold, we propose a combinatorial method for reconstruction of surfaces from points. Our method constructs a…
String backgrounds are described as purely geometric objects related to moduli spaces of Riemann surfaces, in the spirit of Segal's definition of a conformal field theory. Relations with conformal field theory, topological field theory and…
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism group of a Klein surface and a Smarandache manifold,…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
Complex structures are determined for surfaces with $S^2$ and $T^2$ topologies generated by the dynamical triangulation method. For a surface with $S^2$ topology the spacial distribution of the conformal mode is obtained, while for the case…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…
Group Field Theories (GFT) are quantum field theories over group manifolds; they can be seen as a generalization of matrix models. GFT Feynman graphs are tensor graphs generalizing ribbon graphs (or combinatorial maps); these graphs are…
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
General graphs are difficult for learning due to their irregular structures. Existing works employ message passing along graph edges to extract local patterns using customized graph kernels, but few of them are effective for the integration…
We construct symmetric monoidal categories $\LRF, \FD$ of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf…
This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
The worldline formalism shares with string theory the property that it allows one to write down master integrals that effectively combine the contributions of many Feynman diagrams. While at the one-loop level these diagrams differ only by…
Generalized linear and additive models are very efficient regression tools but the selection of relevant terms becomes difficult if higher order interactions are needed. In contrast, tree-based methods also known as recursive partitioning…
Group field theories are higher dimensional generalizations of matrix models. Their Feynman graphs are fat and in addition to vertices, edges and faces, they also contain higher dimensional cells, called bubbles. In this paper, we propose a…