Related papers: On irreducible maps and slices

We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted after applying this procedure a fixed number of times by using…

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…

Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…

We consider the trajectories of points on $\mathbb{S}^{d - 1}$ under sequences of certain folding maps associated with reflections. The main result characterizes collections of folding maps that produce dense trajectories. The minimal…

Hierarchical, multi-resolution volumetric mapping approaches are widely used to represent large and complex environments as they can efficiently capture their occupancy and connectivity information. Yet widely used path planning methods…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

We classify the irreducible components of the Hilbert scheme of $n$ points on non-reduced algebraic plane curves, and give a formula for the multiplicities of the irreducible components. The irreducible components are indexed by partitions…

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Let $T$ be a tree with a fixed subset of vertices $V^{\ast}$ such that there is a cyclic order $C$ on it and all terminal vertices are contained in this set. Let $D^{2} = \{(x,y) \in \rr^{2} | x^{2} + y^{2} \leq 1 \}$ be a closed oriented…

In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

In this paper, we prove that the self-dual morphological hierarchical structure computed on a n-D gray-level wellcomposed image u by the algorithm of G{\'e}raud et al. [1] is exactly the mathematical structure defined to be the tree of…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

We outline an approach to the inverse problem of Calder\'on that highlights the role of microlocal normal forms and propagation of singularities and extends a number of earlier results also in the anisotropic case. The main result states…

We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…

Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its "spine". The chordless cycles which comprise this irreducible core effectively characterize the…

Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…

We explore the existence of irreducible and reducible arc-sections in an irreducible hypersurface singularity germ along finite projections. In particular we provide examples of irreducible isolated hypersurface singularities for which no…