A Simple Formula for the Series of Constellations and Quasi-constellations with Boundaries
نویسندگان
چکیده
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The formula is derived from a bijection due to Bouttier, Di Francesco and Guitter combined with a process (reminiscent of a construction of Pitman) of aggregating connected components of a forest into a single tree. The formula naturally extends to p-constellations and quasi-p-constellations with boundaries (the case p = 2 corresponding to bipartite maps).
منابع مشابه
A New, Simple and Exact Result for Calculating the Probability of Error for Two-dimensional Signal Constellations
In most signaling schemes in digital communication, the boundaries of the decision regions are straight lines. For some of these schemes such as quadrature amplitude modulation and its special cases where the boundaries meet at right angles, simple and exact expressions are known for the probability of error on an AWGN channel. In other cases where the boundaries do not meet at right angles, th...
متن کاملA bijection between planar constellations and some colored Lagrangian trees
Constellations are colored planar maps that generalize different families of maps (planar maps, bipartite planar maps, bi-Eulerian planar maps, planar cacti, . . . ) and are strongly related to factorizations of permutations. They were recently studied by Bousquet-Mélou and Schaeffer [9] who describe a correspondence between these maps and a family of trees, called Eulerian trees. In this paper...
متن کاملSupporting the Flow of Information Through Constellations of Interaction
In field studies designed to uncover opportunities for computationallyintensive business applications, we observed an interaction pattern we term "constellations" in which people depend on a variety of people and information sources to perform the duties of their employ. Constellations are significant for several reasons, constellations extensively cross organizational and corporate boundaries,...
متن کاملA simple model of trees for unicellular maps
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects. In this paper, we give another bijection that explicitly describes the “recursive part” of the first bijection. As a result we obtain a very simpl...
متن کاملGDOP Classification and Approximation by Implementation of Time Delay Neural Network Method for Low-Cost GPS Receivers
Geometric Dilution of Precision (GDOP) is a coefficient for constellations of Global Positioning System (GPS) satellites. These satellites are organized geometrically. Traditionally, GPS GDOP computation is based on the inversion matrix with complicated measurement equations. A new strategy for calculation of GPS GDOP is construction of time series problem; it employs machine learning and artif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014