On Q-polynomial regular near 2d-gons

We discuss thick regular near 2d-gons with a Q-polynomial collinearity graph. For da parts per thousand yen4, we show that apart from Hamming near polygons and dual polar spaces there are no thick Q-polynomial regular near polygons. We also show that no regular near hexagons exist with parameters (s, t (2), t) equal to (3, 1, 34), (8, 4, 740), (92, 64, 1314560), (95, 19, 1027064) or (105, 147, 2763012). Such regular near hexagons are necessarily Q-polynomial. All these nonexistence results imply the nonexistence of distance-regular graphs with certain classical parameters. We also discuss some implications for the classification of dense near polygons with four points per line

Families of Graphs with W_r({G},q) Functions That Are Nonanalytic at 1/q=0

Denoting $P(G,q)$ as the chromatic polynomial for coloring an $n$-vertex graph $G$ with $q$ colors, and considering the limiting function $W(\{G\},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, a fundamental question in graph theory is the following: is $W_r(\{G\},q) = q^{-1}W(\{G\},q)$ analytic or not at the origin of the $1/q$ plane? (where the complex generalization of $q$ is assumed). This question is also relevant in statistical mechanics because $W(\{G\},q)=\exp(S_0/k_B)$, where $S_0$ is the ground state entropy of the $q$-state Potts antiferromagnet on the lattice graph $\{G\}$, and the analyticity of $W_r(\{G\},q)$ at $1/q=0$ is necessary for the large-$q$ series expansions of $W_r(\{G\},q)$. Although $W_r$ is analytic at $1/q=0$ for many $\{G\}$, there are some $\{G\}$ for which it is not; for these, $W_r$ has no large-$q$ series expansion. It is important to understand the reason for this nonanalyticity. Here we give a general condition that determines whether or not a particular $W_r(\{G\},q)$ is analytic at $1/q=0$ and explains the nonanalyticity where it occurs. We also construct infinite families of graphs with $W_r$ functions that are non-analytic at $1/q=0$ and investigate the properties of these functions. Our results are consistent with the conjecture that a sufficient condition for $W_r(\{G\},q)$ to be analytic at $1/q=0$ is that $\{G\}$ is a regular lattice graph $\Lambda$. (This is known not to be a necessary condition).Comment: 22 pages, Revtex, 4 encapsulated postscript figures, to appear in Phys. Rev.

Chromatic Polynomials for Families of Strip Graphs and their Asymptotic Limits

We calculate the chromatic polynomials $P((G_s)_m,q)$ and, from these, the asymptotic limiting functions $W(\{G_s\},q)=\lim_{n \to \infty}P(G_s,q)^{1/n}$ for families of $n$-vertex graphs $(G_s)_m$ comprised of $m$ repeated subgraphs $H$ adjoined to an initial graph $I$. These calculations of $W(\{G_s\},q)$ for infinitely long strips of varying widths yield important insights into properties of $W(\Lambda,q)$ for two-dimensional lattices $\Lambda$. In turn, these results connect with statistical mechanics, since $W(\Lambda,q)$ is the ground state degeneracy of the $q$-state Potts model on the lattice $\Lambda$. For our calculations, we develop and use a generating function method, which enables us to determine both the chromatic polynomials of finite strip graphs and the resultant $W(\{G_s\},q)$ function in the limit $n \to \infty$. From this, we obtain the exact continuous locus of points ${\cal B}$ where $W(\{G_s\},q)$ is nonanalytic in the complex $q$ plane. This locus is shown to consist of arcs which do not separate the $q$ plane into disconnected regions. Zeros of chromatic polynomials are computed for finite strips and compared with the exact locus of singularities ${\cal B}$. We find that as the width of the infinitely long strips is increased, the arcs comprising ${\cal B}$ elongate and move toward each other, which enables one to understand the origin of closed regions that result for the (infinite) 2D lattice.Comment: 48 pages, Latex, 12 encapsulated postscript figures, to appear in Physica

Incidence geometry from an algebraic graph theory point of view

The goal of this thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces, polar spaces and near polygons. These geometries give rise to one or more graphs. By use of eigenvalue techniques, we obtain results on these graphs and on their substructures that are regular or extremal in some sense. The first chapter introduces the basic notions of geometries, such as projective and polar spaces. In the second chapter, we introduce the necessary concepts from algebraic graph theory, such as association schemes and distance-regular graphs, and the main techniques, including the fundamental contributions by Delsarte. Chapter 3 deals with the Grassmann association schemes, or more geometrically: with the projective geometries. Several examples of interesting subsets are given, and we can easily derive completely combinatorial properties of them. Chapter 4 discusses the association schemes from classical finite polar spaces. One of the main applications is obtaining bounds for the size of substructures known as partial m- systems. In one specific case, where the partial m-systems are partial spreads in the polar space H(2d − 1, q^2) with d odd, the bound is new and even tight. A variant of the famous Erdős-Ko-Rado problem is considered in Chapter 5, where we study sets of pairwise non-trivially intersecting maximal totally isotropic subspaces in polar spaces. A combination of geometric and algebraic techniques is used to obtain a classification of such sets of maximum size, except for one specific polar space, namely H(2d − 1, q^2) for odd rank d ≥ 5. Near polygons, including generalized polygons and dual polar spaces, are studied in the last chapter. Several results on substructures in these geometries are given. An inequality of Higman on the parameters of generalized quadrangles is generalized. Finally, it is proved that in a specific dual polar space, a highly regular substructure would yield a distance- regular graph, generalizing a result on hemisystems. The appendix consists of an alternative proof for one of the main results in the thesis, a list of open problems and a summary in Dutch

Distance-regular graphs

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page

Universal scaling limits of matrix models, and (p,q) Liouville gravity

We show that near a point where the equilibrium density of eigenvalues of a matrix model behaves like y ~ x^{p/q}, the correlation functions of a random matrix, are, to leading order in the appropriate scaling, given by determinants of the universal (p,q)-minimal models kernels. Those (p,q) kernels are written in terms of functions solutions of a linear equation of order q, with polynomial coefficients of degree at most p. For example, near a regular edge y ~ x^{1/2}, the (1,2) kernel is the Airy kernel and we recover the Airy law. Those kernels are associated to the (p,q) minimal model, i.e. the (p,q) reduction of the KP hierarchy solution of the string equation. Here we consider only the 1-matrix model, for which q=2.Comment: pdflatex, 44 pages, 2 figure

Lower Bounds and Series for the Ground State Entropy of the Potts Antiferromagnet on Archimedean Lattices and their Duals

We prove a general rigorous lower bound for $W(\Lambda,q)=\exp(S_0(\Lambda,q)/k_B)$, the exponent of the ground state entropy of the $q$-state Potts antiferromagnet, on an arbitrary Archimedean lattice $\Lambda$. We calculate large-$q$ series expansions for the exact $W_r(\Lambda,q)=q^{-1}W(\Lambda,q)$ and compare these with our lower bounds on this function on the various Archimedean lattices. It is shown that the lower bounds coincide with a number of terms in the large-$q$ expansions and hence serve not just as bounds but also as very good approximations to the respective exact functions $W_r(\Lambda,q)$ for large $q$ on the various lattices $\Lambda$. Plots of $W_r(\Lambda,q)$ are given, and the general dependence on lattice coordination number is noted. Lower bounds and series are also presented for the duals of Archimedean lattices. As part of the study, the chromatic number is determined for all Archimedean lattices and their duals. Finally, we report calculations of chromatic zeros for several lattices; these provide further support for our earlier conjecture that a sufficient condition for $W_r(\Lambda,q)$ to be analytic at $1/q=0$ is that $\Lambda$ is a regular lattice.Comment: 39 pages, Revtex, 9 encapsulated postscript figures, to appear in Phys. Rev.