Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T20:23:53.053Z Has data issue: false hasContentIssue false
  • English
  • Français

Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs

Published online by Cambridge University Press:  12 September 2008

D. K. Arrowsmith  and
J. W. Essam
D. K. Arrowsmith
Affiliation:
School of Math. Sci., Queen Mary and Westfleld College, Univ. of London, Mile End Road, London, UK
J. W. Essam
Affiliation:
Dept. of Math., Royal Holloway and Bedford New College, Univ. of London, Egham, Surrey, UK
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider special types of mod-λ flows, called odd and even mod-λ flows, for directed graphs, and prove that the numbers of such flows can be interpolated by polynomials in λ with the degree given by the cycle rank of the graph. The proofs involve computation of the number of integer solutions in a polyhedral region of Euclidean space using theorems due to Ehrhart. The resulting reciprocity properties of the interpolating polynomials for even flows are considered. The analogous properties of odd and even mod-λ potential differences and their associated potentials are also developed.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 3 , Issue 1 , March 1994 , pp. 1 - 11
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Arrowsmith, D. K. and Essam, J. W. (1977) Percolation Theory on Directed Graphs. J. Math. Phys. 18 (2) 234–238.CrossRefGoogle Scholar
[2]Arrowsmith, D. K. and Essam, J. W. (1990) An extension of the Kasteleyn–Fortuin formulae. Phys. Rev. Lett. 65 3068–3071.CrossRefGoogle Scholar
[3]Arrowsmith, D. K. and Jaeger, F. (1982) Enumeration of Regular Chain Groups. J. Comb. Thy. B. 32 (1), 75–89.CrossRefGoogle Scholar
[4]Arrowsmith, D. K., Essam, J. W. and Mason, P. H. (1991) Vicious walkers, flows and directed percolation. Physica A177 267–272.CrossRefGoogle Scholar
[5]Biggs, N. L. (1974) Algebraic graph theory, Cambridge University Press.CrossRefGoogle Scholar
[6]Bondy, J. A. and Murty, U. S. R. (1976) Graph Theory with Applications, Macmillan.CrossRefGoogle Scholar
[7]de Magalhães, A. C. N. and Essam, J. W. (1989) Z(A) model and flows: subgraph break-collapse method. J. Phys. A: Math. Gen. 22, 2549–2566.CrossRefGoogle Scholar
[8]de Magalhaes, A. C. N. and Essam, J. W. (1990) n-component cubic model and flows-subgraph break-collapse method. J. Stat. Phys. 58 1059–1082.CrossRefGoogle Scholar
[9]Ehrhart, E. (1967) Demonstration de la loi de réciprocité pour un polyèdre entier. C.R. Acad. Sc. Paris, t.265.Google Scholar
[10]Essam, J. W. and Tsallis, C. (1986) The Potts Model and Flows I: The pair correlation function. J. Phys. A: Math. Gen. 409–422.CrossRefGoogle Scholar
[11]Hoffman, A. J. and Kruskal, J. B. (1970) Integral Boundary Points of Convex Polyhedra. Ann. of Math. Studies 38, p. 223, Princeton Univ. Press, Princeton, N.J.Google Scholar
[12]Tutte, W. (1954) A contribution to the theory of chromatic polynomials. Canadian Jnl. Math. 5 80–91.CrossRefGoogle Scholar
[13]Whitney, H. (1932) The colouring of graphs. Ann. Math. 33 (2) 688–718.CrossRefGoogle Scholar