Automorphism Groups of Geometrically Represented Graphs

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of interval, permutation and circle graphs. We combine techniques from group theory (products, homomorphisms, actions) with data structures from computer science (PQ-trees, split trees, modular trees) that encode all geometric representations. We prove that interval graphs have the same automorphism groups as trees, and for a given interval graph, we construct a tree with the same automorphism group which answers a question of Hanlon [Trans. Amer. Math. Soc 272(2), 1982]. For permutation and circle graphs, we give an inductive characterization by semidirect and wreath products. We also prove that every abstract group can be realized by the automorphism group of a comparability graph/poset of the dimension at most four

Of McKay Correspondence, Non-linear Sigma-model and Conformal Field Theory

The ubiquitous ADE classification has induced many proposals of often mysterious correspondences both in mathematics and physics. The mathematics side includes quiver theory and the McKay Correspondence which relates finite group representation theory to Lie algebras as well as crepant resolutions of Gorenstein singularities. On the physics side, we have the graph-theoretic classification of the modular invariants of WZW models, as well as the relation between the string theory nonlinear $\sigma$-models and Landau-Ginzburg orbifolds. We here propose a unification scheme which naturally incorporates all these correspondences of the ADE type in two complex dimensions. An intricate web of inter-relations is constructed, providing a possible guideline to establish new directions of research or alternate pathways to the standing problems in higher dimensions.Comment: 35 pages, 4 figures; minor corrections, comments on toric geometry and references adde

Algorithmic Aspects of a General Modular Decomposition Theory

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs, the terminology ``module'' not only captures the classical graph modules but also allows to handle 2-connected components, star-cutsets, and other vertex subsets. The main result is that most of the nice algorithmic tools developed for modular decomposition of graphs still apply efficiently on our generalisation of modules. Besides, when an essential axiom is satisfied, almost all the important properties can be retrieved. For this case, an algorithm given by Ehrenfeucht, Gabow, McConnell and Sullivan 1994 is generalised and yields a very efficient solution to the associated decomposition problem