Related papers: On counting plurifibered varieties
In this short note, we find the number of forests of chord diagrams with a given number of trees and a given number of chords.
In this paper, we study properties of maps between fibrant objects in model categories. We give a characterization of weak equivalences between fibrant object. If every object of a model category is fibrant, then we give a simple…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…
In this article we prove that a semialgebraic map is a branched covering if and only if its associated spectral map is a branched covering. In addition, such spectral map has a neat behavior with respect to the branching locus, the…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
The number of species can be estimated by sampling individuals from a species assemblage. The problem of estimating generalized species accumulation curve is addressed in a nonparametric Poisson mixture model. A likelihood-based estimator…
We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, following Bernardi…
We prove a weighted generalization of the formula for the number of plane vertex-labeled trees.
We survey $k$-best enumeration problems and the algorithms for solving them, including in particular the problems of finding the $k$ shortest paths, $k$ smallest spanning trees, and $k$ best matchings in weighted graphs.
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
Mobiles are a particular class of decorated plane trees which serve as codings for planar maps. Here we address the question of enumerating mobiles in their most general flavor, in correspondence with planar Eulerian (i.e., bicolored) maps.…
We prove results on fibers of polynomial mappings Rn ! Rn and deduce when such mappings are surjective under certain conditions.
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
Combinatorial enumeration of various RNA secondary structures and protein contact maps, is of great interest for both combinatorists and computational biologists. Enumeration of protein contact maps has considerable difficulties due to the…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
We give explicit formulas enumerating 4-regular labelled and unlabelled one-face maps.
Given a manifold M, it is natural to ask in how many ways it fibers (we mean fibering in a general way, where the base might be an orbifold -- this could be described as Seifert fibering)There are group-theoretic obstructions to the…
We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…