相关论文: An algorithm for map enumeration

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…

An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…

On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…

We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration.…

Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…

Given graphs $G$ and $H$, we propose a method to implicitly enumerate topological-minor-embeddings of $H$ in $G$ using decision diagrams. We show a useful application of our method to enumerating subgraphs characterized by forbidden…

One can explicitly compute the generators of a surface cluster algebra either combinatorially, through dimer covers of snake graphs, or homologically, through the CC-map applied to indecomposable modules over the appropriate algebra. Recent…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…

Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…

This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…