Counting maps on doughnuts
نویسنده
چکیده
Abstract. How many maps with V vertices and E edges can be drawn on a doughnut with G holes? I solved this problem for doughnuts with up to 10 holes, and my colleagues Alain Giorgetti and Alexander Mednykh counted maps by number of edges alone on doughnuts with up to 11 holes. This expository paper outlines, in terms meant to be understandable by a nonspecialist, the methods we used and those used by other researchers to obtain the results upon which our own research depends.
منابع مشابه
Counting rooted maps on a surface
Several enumeration results are known about rooted maps on orientable surfaces, whereas rooted maps on non-orientable surfaces have seldom been studied. First, we unify both kind of maps, giving general functional equations for the generating series which counts rooted maps on any locally orientable surface, by number of vertices and faces. Then, we formally solve these equations, in order to e...
متن کاملBeyond Counting: Comparisons of Density Maps for Crowd Analysis Tasks - Counting, Detection, and Tracking
For crowded scenes, the accuracy of object-based computer vision methods declines when the images are lowresolution and objects have severe occlusions. Taking counting methods for example, almost all the recent state-of-the-art counting methods bypass explicit detection and adopt regressionbased methods to directly count the objects of interest. Among regression-based methods, density map estim...
متن کاملSuper-Eddington black hole accretion: Polish doughnuts and slim disks
The theory of highly super-Eddington black hole accretion, Ṁ ≫ ṀEdd, was developed in the 1980s in Warsaw by Paczyński and his collaborators [1]–[9] in terms of Polish doughnuts , i.e. low viscosity, rotating accretion flows that are optically thick, radiation pressure supported, cooled by advection, and radiatively very inefficient. Polish doughnuts resemble fat tori with two narrow funnels al...
متن کاملA Biased Survey of Map Enumeration Results
This is a survey paper presenting map enumeration results obtained by the author, either alone or jointly with other researchers, as well as some of the other results in the literature that are the most relevant to the author's work. The results discussed in this paper include counting and generating maps and hypermaps of various types on orientable surfaces. The counting is achieved by means o...
متن کاملMaps, Sheaves, and K3 Surfaces
The conjectural equivalence of curve counting on Calabi-Yau 3-folds via stable maps and stable pairs is discussed. By considering Calabi-Yau 3-folds with K3 fibrations, the correspondence naturally connects curve and sheaf counting on K3 surfaces. New results and conjectures (with D. Maulik) about descendent integration on K3 surfaces are announced. The recent proof of the Yau-Zaslow conjecture...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 502 شماره
صفحات -
تاریخ انتشار 2013