Trivalent Diagrams, Modular Group and Triangular Maps

نویسندگان

  • SAMUEL VIDAL
  • A. Mednykh
چکیده

The aim of the paper is to give a preliminary overview of some of the results of the thesis prepared by the author. We propose a bijective classification of the subgroups of the modular group by pointed trivalent diagrams. Conjugacy classes of those subgroups are in one to one correspondence with unpointed trivalent diagrams. We also give in the form of generating series, the number of those trivalent diagrams both pointed or not, as well as generating series for both rooted and unrooted versions of triangular maps up to isomorphism. That later results was a difficult open problem. Introduction The theory of combinatorial maps is a venerable subject dating back to Cayley and Hamilton. Since those time it generated an impressive amount of results of all sorts concerning the enumeration problem of counting the rooted combinatorial maps. Those results came from various communities of researchers, each with its own methods and tradition. Among them, enumerative combinatorists of course played a significant role, starting with pioneering works by Tutte [16] on rooted planar maps. Theoretical physicists also played a significant role, starting with the work by t’Hooft [15] on integrals on random matrix spaces. Pure mathematicians like Harer and Zagier [7] also have contributed to the theory in connection with cutting edge algebraic geometry problems concerning modular spaces of Riemann surfaces. Last but not least, one must mention in mathematical physics the Witten-Kontsevich model of quantum gravity [9] using in a central fashion the higher combinatorics of triangular maps and trivalent diagrams. Although a lot is known concerning the theory of rooted combinatorial maps, very little is known concerning the outstanding problem of enumeration of unrooted combinatorial maps up to isomorphism. It appears as a very difficult problem of combinatorics, which stayed barely untouched for almost 150 years. As a matter of fact, the only general result on those important objects were up to now contained in the recent paper by A. Mednykh

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps

A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of edges incident to to a same vertex. A rooted trivalent diagram is a trivalent diagram with a distinguished edge, its root. We shall describe and analyze an a...

متن کامل

An Optimal Algorithm to Generate Pointed Trivalent Diagrams and Pointed Triangular Maps

A trivalent diagram is a connected graph with cyclic orientations and degree conditions on its vertices. It is the combinatorial description of an unembedded trivalent ribbon graph. We shall describe and analyze an algorithm giving an exhaustive list of trivalent diagrams of a given size. The list being nonredundant in that no two diagrams of the list are isomorphic. The algorithm will be shown...

متن کامل

Linear lambda terms as invariants of rooted trivalent maps

The main aim of the article is to give a simple and conceptual account for the correspondence between (α-equivalence classes of) closed linear lambda terms and (isomorphism classes of) rooted trivalent maps on compact oriented surfaces without boundary, as an instance of a more general correspondence between linear lambda terms with a context of free variables and rooted trivalent maps with a b...

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

Modular application of an Integration by Fractional Expansion (IBFE) method to multiloop Feynman diagrams II

A modular application of the integration by fractional expansion method for evaluating Feynman diagrams is extended to diagrams that contain loop triangle subdiagrams in their geometry. The technique is based in the replacement of this module or subdiagram by its corresponding multiregion expansion (MRE), which in turn is obtained from Schwinger’s parametric representation of the diagram. The r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007