Related papers: Graphs on Surfaces and the Partition Function of S…
For the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary unit transfers between parts, we develop a degree theory with three levels: exact value theory, exact profile theory, and…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
It was suggested in hep-th/0002106, that semiclassically, a partition function of a string theory in the 5 dimensional constant negative curvature space with a boundary condition at the absolute satisfy the loop equation with respect to…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…
We compute the partition function for the $N=1$ spinning particle, including pictures and the large Hilbert space, and show that it counts the dimension of the BRST cohomology in two- and four-dimensional target space. We also construct a…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
We construct and fully characterize a scalar boundary conformal field theory on a triangulated Riemann surface. The results are analyzed from a string theory perspective as tools to deal with open/closed string dualities.
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
In this letter we calculate the exact partition function for free bosons on the plane with lacunae. First the partition function for a plane with two spherical holes is calculated by matching exactly for the infinite set of Wilson…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
The evaluation of graphs on 2-spheres is a central ingredient of the Turaev-Viro construction of three-dimensional topological field theories. In this article, we introduce a class of graphs, called extruded graphs, that is relevant for the…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in…
We consider string theory on $\text{AdS}_3 \times \text{S}^3 \times \mathbb{T}^4$ in the tensionless limit, with one unit of NS-NS flux. This theory is conjectured to describe the symmetric product orbifold CFT. We consider the string on…
Brownian dynamics of colloidal particles on complex surfaces has found important applications in diverse physical, chemical and biological processes. However, current Brownian dynamics simulation algorithms mostly work for relatively simple…
We study the relation between topological string theory and singularity theory using the partition function of $A_{N-1}$ topological string defined by matrix integral of Kontsevich type. Genus expansion of the free energy is considered, and…