47 research outputs found

    Spanning quadrangulations of triangulated surfaces

    Get PDF

    Critical and Tricritical Hard Objects on Bicolorable Random Lattices: Exact Solutions

    Full text link
    We address the general problem of hard objects on random lattices, and emphasize the crucial role played by the colorability of the lattices to ensure the existence of a crystallization transition. We first solve explicitly the naive (colorless) random-lattice version of the hard-square model and find that the only matter critical point is the non-unitary Lee-Yang edge singularity. We then show how to restore the crystallization transition of the hard-square model by considering the same model on bicolored random lattices. Solving this model exactly, we show moreover that the crystallization transition point lies in the universality class of the Ising model coupled to 2D quantum gravity. We finally extend our analysis to a new two-particle exclusion model, whose regular lattice version involves hard squares of two different sizes. The exact solution of this model on bicolorable random lattices displays a phase diagram with two (continuous and discontinuous) crystallization transition lines meeting at a higher order critical point, in the universality class of the tricritical Ising model coupled to 2D quantum gravity.Comment: 48 pages, 13 figures, tex, harvmac, eps

    Facial achromatic number of triangulations on the sphere (Women in Mathematics)

    Get PDF
    A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of colors to the vertices such that any adjacent vertices receive different colors. In particular, a coloring is called complete if every pair of colors appear on some edge. In this talk, we expand complete colorings of graphs to those of graphs embedded on surfaces and consider such colorings of even triangulations on the sphere

    A new Kempe invariant and the (non)-ergodicity of the Wang-Swendsen-Kotecky algorithm

    Get PDF
    We prove that for the class of three-colorable triangulations of a closed oriented surface, the degree of a four-coloring modulo 12 is an invariant under Kempe changes. We use this general result to prove that for all triangulations T(3L,3M) of the torus with 3<= L <= M, there are at least two Kempe equivalence classes. This result implies in particular that the Wang-Swendsen-Kotecky algorithm for the zero-temperature 4-state Potts antiferromagnet on these triangulations T(3L,3M) of the torus is not ergodic.Comment: 37 pages (LaTeX2e). Includes tex file and 3 additional style files. The tex file includes 14 figures using pstricks.sty. Minor changes. Version published in J. Phys.

    Coloring and constructing (hyper)graphs with restrictions

    Get PDF
    We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges. We prove a conjecture of Chen, Erdős, Gyárfás, and Schelp concerning the minimum number of edges in a “nearly bipartite” 4-critical graph. In Chapter 3 we consider coloring and list-coloring graphs and hypergraphs with few edges and no small cycles. We prove two main results. If a bipartite graph has maximum average degree at most 2(k−1), then it is colorable from lists of size k; we prove that this is sharp, even with an additional girth requirement. Using the same approach, we also provide a simple construction of graphs with arbitrarily large girth and chromatic number (first proved to exist by Erdős). In Chapter 4 we consider list-coloring the family of kth power graphs. Kostochka and Woodall conjectured that graph squares are chromatic-choosable, as a strengthening of the Total List Coloring Conjecture. Kim and Park disproved this stronger conjecture, and Zhu asked whether graph kth powers are chromatic-choosable for any k. We show that this is not true: we construct families of graphs based on affine planes whose choice number exceeds their chromatic number by a logarithmic factor. In Chapter 5 we consider the existence of uniform hypergraphs with prescribed degrees and codegrees. In Section 5.2, we show that a generalization of the graphic 2-switch is insufficient to connect realizations of a given degree sequence. In Section 5.3, we consider an operation on 3-graphs related to the octahedron that preserves codegrees; this leads to an inductive definition for 2-colorable triangulations of the sphere. In Section 5.4, we discuss the notion of fractional realizations of degree sequences, in particular noting the equivalence of the existence of a realization and the existence of a fractional realization in the graph and multihypergraph cases. In Chapter 6 we consider a question concerning poset dimension. Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of sqrt(dn) was observed by Goodwillie. We provide a sublinear upper bound
    corecore