Chromatic sums of biloopless nonseparable near-triangulations on the projective plane

In this paper, the chromatic sum functions of rooted biloopless nonseparable near-triangulations on the sphere and the projective plane are studied. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. An asymptotic evaluation and some explicit expression of enumerating functions are also derived.     

Chromatic sums of nonseparable near-triangulations on the projective plane

In this paper, we study the chromatic sum functions of rooted nonseparable near-triangulations on the sphere and the projective plane. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of such maps are derived. Applying chromatic sum theory, the enumerating problem of different sorts maps can be studied, and a new method of enumeration can be obtained. Moreover, an asymptotic evaluation and some explicit expression of enumerating functions are also derived.     

平面上一般地图的色和与双色和

本文研究了平面上一般带根地图的色和与双色和,得到了这类地图的色和与双色和函数方程。从这类地图的色和函数方程,导出了平面上一般无环地图、平面上二部地图和平面上欧拉地图的计数函数方程。还得到了一些计数函数的计数显式。     

Chromatic sums of general maps on the sphere and the projective plane

In this paper, we study the chromatic sum functions of rooted general maps on the sphere and the projective plane. The chromatic sum function equations of such maps are obtained. From the chromatic sum equations of such maps, the enumerating function equations of rooted loopless maps, bipartite maps and Eulerian maps are also derived. Moreover, some explicit expressions of enumerating functions are also derived.     

射影平面和环面上奇异地图的色和

一个地图的每条边,若在同一面的边界上,则称它为奇异地图．由于含环的地图是不可着色的,本文所有地图均不含环．本文研究射影平面和环面上带根奇异地图的色和．     

球面和射影平面上不可分地图的色和

给出了球面和射影平面上带根不可分地图的色和方程,从色和方程导出了球面和射影平面上带根一般不可分地图、二部地图的计数函数方程. 利用色和理论,研究不同类地图的计数问题,得到了一种研究计数问题的新方法. 此外,还得到了一些计数显示表达式.     

克莱茵瓶上奇异地图的色数

A map is singular if each edge is on the same face on a surface (i.e., it has only one face on a surface). In this paper we present the chromatic enumeration for rooted singular maps on the Klein bottle.     

Chromatic sums of nonseparable simple maps on the plane

In this paper we study the chromatic sum functions for rooted nonseparable simple maps on the plane. The chromatic sum function equation for such maps is obtained. The enumerating function equation of such maps is derived by the chromatic sum equation of such maps. From the chromatic sum equation of such maps, the enumerating function equation of rooted nonseparable simple bipartite maps on the plane is also derived.     

Klein瓶上的奇异地图

It is well known that singular maps (i. e. ,those have only one face on a surface)play a key role in the theory of up-embeddability of graphs. In this paper the number of rooted singular maps on the Klein bottle is studied. An explicit form of the enumerating function according to the root-valency and the size of the map is determined. Further ,an expression of the vertex partition function is also found.     

Chromatic sums of rooted triangulations on the projective plane

In this paper we study the chromatic sum functions for rooted nonseparable near-triangular maps on the projective plane. A chromatic sum equation for such maps is obtained.     

ENUMERATION OF ROOTED VERTEX NON-SEPARABLE PLANAR MAPS

In a rooted planar map, the rooted vertex is said to be non-separable if the vertex onthe boundary of the outer face as an induced graph is not a cut-vertex. In this paper, the author derives a functional equation satisfied by the enumeratingfuuction of rooted vertex non-separable planar maps dependent on the edge number and thenumber of the edges on the outer face boundary, finds a parametric expression of itssolution, and obtains an explicit formula for the function. Particularly, the number of rooted vertex non-separable maps only replying on theedge number and that of rooted vertex non-separable tree-like maps defined in [4] accordingto the two indices, the edge number and the number of the edges on the outer face boundary,or only one index, the edge number, are also determined.     

Chromatic sums of 2-edge-connected maps on the projective plane

This paper provides the chromatic sum function equations of rooted 2-edge-connected maps on the projective plane. The enumerating function equations of rooted 2-edge-connected loopless maps and rooted 2-edge-connected bipartite maps on the projective plane are derived by the chromatic sum function equation of rooted 2-edge-connected maps on the projective plane.     

Gradient modeling for multivariate quantitative data

We propose a new parametric model for continuous data, a “g-model”, on the basis of gradient maps of convex functions. It is known that any multivariate probability density on the Euclidean space is uniquely transformed to any other density by using the gradient map of a convex function. Therefore the statistical modeling for quantitative data is equivalent to design of the gradient maps. The explicit expression for the gradient map enables us the exact sampling from the corresponding probability distribution. We define the g-model as a convex subset of the space of all gradient maps. It is shown that the g-model has many desirable properties such as the concavity of the log-likelihood function. An application to detect the three-dimensional interaction of data is investigated.     

Reconstructing birational maps from their face functions

We first prove that any birational map, from an affine space of dimension ≥ 2 to itself, is not determined by its face functions. On the other hand, we prove that a birational map with irreducibly polynomial inverse is completely determined, within the class of all birational maps with irreducibly polynomial inverses, by its face functions. We show also how to effectively reconstruct such a map from its face functions. Supported partly by the Centre Interuniversitaireen Calcul Mathématique Algébrique.     

关于平面树色和方程结果的一个注记

这篇文章得到了有根平面树的节点剖分的色和方程. 导出了带无限多个参数的有根平面植树和平面树的色和方程的精确表达式. 作为直接推论可推出节点剖分的有根平面树的计数方程的精确结果 .     

Coloring vertices and faces of maps on surfaces

The vertex-face chromatic number of a map on a surface is the minimum integer m such that the vertices and faces of the map can be colored by m colors in such a way that adjacent or incident elements receive distinct colors. The vertex-face chromatic number of a surface is the maximal vertex-chromatic number for all maps on the surface. We give an upper bound on the vertex-face chromatic number of the surfaces of Euler genus ≥2. The upper bound is less (by 1) than Ringel’s upper bound on the 1-chromatic number of a surface for about 5/12 of all surfaces. We show that there are good grounds to suppose that the upper bound on the vertex-face chromatic number is tight.     

The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of given genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the case of labelled unicellular maps, which are related to all rooted maps by Marcus and Schaeffer’s bijection. This gives an immediate derivation of the asymptotic number of unicellular maps of given genus, and a simple bijective proof of a formula of Lehman and Walsh on the number of triangulations with one vertex. From the labelled case, we deduce an expression of the asymptotic number of maps of genus g with n edges involving the ISE random measure, and an explicit characterization of the limiting profile and radius of random bipartite quadrangulations of genus g in terms of the ISE.     

The homological singularities of maps in trace spaces between manifolds

We deal with mappings defined between Riemannian manifolds that belong to a trace space of Sobolev functions. The homological singularities of any such map are represented by a current defined in terms of the boundary of its graph. Under suitable topological assumptions on the domain and target manifolds, we show that the non triviality of the singular current is the only obstruction to the strong density of smooth maps. Moreover, we obtain an upper bound for the minimal integral connection of the singular current that depends on the fractional norm of the mapping.     

Regular unipotent elements

We construct a map from the set of regular unipotent classes of a finite reductive group to the corresponding set in a Levi subgroup. A theorem of Digne, Lehrer and Michel on Lusztig restriction of characteristic functions of such classes gives in particular another (not explicit) construction of such a map. We conjecture that these two maps coincide.     

Counting unrooted maps on the plane

A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps.