Fourier Analysis on Finite Abelian Groups: Some Graphical Applications

Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Volumn , Issue , 2007, Pages

  Goodall, Andrew ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Abelian groups; Cayley graphs; Fourier analysis; Graph theory; Phylogenetic trees; Tutte polynomial

Indexed keywords

EID: 84920751522     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198571278.003.0007     Document Type: Chapter

References (36)

1. N. Alon, Combinatorial Nullstellensatz, Combinatorics, Probability and Computing 8/1-2 (1999) 7-29.
2. N. Alon, I. Dinur, E. Friedgut, and B. Sudakov, Graph products, Fourier analysis and spectral techniques, Geometric And Functional Analysis 14/5 (2004) 913-940.
3. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, 12 (1992) 125-134.
4. N. Alon and M. Tarsi, A note on graph colorings and graph polynomials, J. Combin. Theory Ser. B 70 (1997) 197-201.
5. J. Ashkin and E. Teller, Statistics of two-dimensional lattices with four components, Physical Review 64/5-6 (1943) 178-184.
6. B. Berndt, R. Evans, and K. Williams, Gauss and Jacobi sums, Wiley-Interscience (1998).
7. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, volume 1 (2nd edn.), Cambridge University Press, Cambridge(1999).
8. N. Biggs, On the duality of interaction models, Mathematical Proceedings of the Cambridge Philosophical Society 80 (1976) 429-436.
9. N. Biggs, Interaction Models, Cambridge University Press (1977).
10. N. Biggs, Algebraic Graph Theory, 2nd edn., Cambridge University Press, Cambridge, 1993.
11. B. Bollobás, Modern Graph Theory, Springer, New York (1998).
12. S. Evans, Fourier analysis and phylogenetic trees, Modern Signal Processing, 46 (2003) 117-136.
13. G. Farr, Tutte-Whitney polynomials: some history and generalisations. Chapter 3 of this volume.
14. G. Farr, A generalization of the Whitney rank generating function, Mathematical Proceedings of the Cambridge Philosophical Society 113 (1993) 267-280.
15. A. Goodall, Graph polynomials and the discrete Fourier transform, Ph.D. thesis, University of Oxford (2004).
16. A. Goodall, Some new evaluations of the Tutte polynomial, Journal of Combinatorial Theory Series B 96 (2006) 207-224.
17. M. Hall, Combinatorial Theory, Wiley-Interscience, New York (1986).
18. B. Hartley and T. Hawkes, Rings, Modules and Linear Algebra, Chapman and Hall, London (1970).
19. M. Hendy and D. Penny, A framework for the quantative study of evolutionary trees, Systematic Zoology 38/4 (1989) 297-309.
20. W. Huffman and V. Pless, Fundamentals of Error-correcting Codes, Cambridge University Press, Cambridge (2003).
21. G. Kalai and M. Safra, Threshold phenomena and influence, in Computational Complexity and Statistical Physics (A. Percus, G. Istrate, and C. Moore, eds.) Oxford University Press, New York (2005).
22. S. Ma. A survey of partial difference sets, Designs, Codes and Cryptography 4/4 (1994) 221-261.
23. Y. Matiyasevich, Some probabilistic restatements of the four color conjecture, Journal of Graph Theory 46 (2004) 167-179.
24. A. Pott, Nonlinear functions in abelian groups and relative difference sets, Discrete Applied Mathematics 138 (2004) 177-193.
25. R. C. Read and P. Rosenstiehl, On the principal edge tripartition of a graph, Annals of Discrete Mathematics (1978) 195-226.
26. C. Semple and M. Steel, Phylogenetics, Oxford University Press, Oxford (2003).
27. R. Stanley, Enumerative Combinatorics, volume 2, Cambridge University Press (1999).
28. L. Székely, P. Erdős, M. Steel, and D. Penny, A Fourier inversion formula for evolutionary trees, Applied Mathematics Letters 6/2 (1993) 13-16.
29. L. Székely, M. Steel, and P. Erdős, Fourier calculus on finite sets and evolutionary trees. Technical report (1991).
30. L. Székely, M. Steel, and P. Erdős. Fourier calculus on evolutionary trees, Advances in Applied Mathematics 14 (1993) 200-216.
31. A. Terras, Fourier analysis on finite groups and applications. Cambridge University Press (1999).
32. D. Vertigan, Latroids and their representation by codes over modules, Transactions of the American Mathematical Society 356/10 (2003) 3841-3868.
33. D. Welsh, Complexity: Knots, Colourings and Counting, Cambridge University Press (1993).
34. D. Welsh, The Tutte polynomial, Random Structures and Algorithms 15 (1999) 210-228.
35. D. Welsh and C. Merino, The Potts model and the Tutte polynomial, Journal of Mathematical Physics 41/3 (2000) 1127-1152.
36. J. Wood, Duality for modules over finite rings and applications to coding theory, American Journal of Mathematics 121/3 (1999) 555-575.