ترغب بنشر مسار تعليمي؟ اضغط هنا

A note on irreducible maps with several boundaries

89   0   0.0 ( 0 )
 نشر من قبل Emmanuel Guitter
 تاريخ النشر 2013
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary (non necessarily irreducible) bipartite planar maps, which we recover by taking d=0. As an application, we obtain an expression for the number of d-irreducible bipartite planar maps with a prescribed number of faces of each allowed degree. Very explicit expressions are given in the case of maps without multiple edges (d=2), 4-irreducible maps and maps of girth at least 6 (d=4). Our derivation is based on a tree interpretation of the various encountered generating functions.



قيم البحث

اقرأ أيضاً

296 - J. Bouttier , E. Guitter 2013
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the natural approac h via substitution where these maps are obtained from general maps by a replacement of all d-cycles by elementary faces, and a bijective approach via slice decomposition which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions of d-irreducible maps with controlled face degrees, summarized in some elegant pointing formula. We provide an equivalent description of d-irreducible slices in terms of so-called d-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
76 - Luna Lomonaco 2020
We show that the definition of parabolic-like map can be slightly modified, by asking $partial Delta$ to be a quasiarc out of the parabolic fixed point, instead of the dividing arcs to be $C^1$ on $[-1,0]$ and $[0,1]$.
Usually, it is difficult to determine the weight distribution of an irreducible cyclic code. In this paper, we discuss the case when an irreducible cyclic code has the maximal number of distinct nonzero weights and give a necessary and sufficient con dition. In this case, we also obtain a divisible property for the weight of a codeword. Further, we present a necessary and sufficient condition for an irreducible cyclic code with only one nonzero weight. Finally, we determine the weight distribution of an irreducible cyclic code for some cases.
This article contains a characterization of operator systems $cS$ with the property that every positive map $phi:cS rightarrow M_n$ is decomposable, as well as an alternate and a more direct proof of a characterization of decomposable maps due to E. Sto rmer.
In the picture-hanging puzzle we are to hang a picture so that the string loops around $n$ nails and the removal of any nail results in a fall of the picture. We show that the length of a sequence representing an element in the free group with $n$ ge nerators that corresponds to a solution of the picture-hanging puzzle must be at least $n2^{sqrt{log_2 n}}$. In other words, this is a lower bound on the length of a sequence representing a non-trivial element in the free group with $n$ generators such that if we replace any of the generators by the identity the sequence becomes trivial.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا