Publications: Jamie Simpson

1. Myerson, G.; Poon, J.; Simpson J. `Incongruent restricted disjoint covering systems', submitted.
2. Puglisi, S. and Simpson, J., `Words with simple Burrows-Wheeler transforms' [219kB PDF], submitted.
3. Puglisi, S. and Simpson, J., `The expected number of runs in a word' [141kB PDF], to appear Australas. J. Combin.
4. Puglisi, S.; Simpson, J.; Smyth, W. `How many runs can a string contain?' [186kB PDF], to appear Theoretical Computer Science.
5. Myerson, G.; Poon, J.; Simpson J. `Computing incongruent restricted covering systems', Proceedings International Workshop on Combinatorial Algorithms (IWOCA 2007), Newcastle, NSW, 2007.
6. Simpson, J., `Intersecting periodic words' [260kB PostScript], Theoretical Computer Science, 374 No. 1-3 (2007) 58-65.
7. Pleasants, P.; Ray, H.; Simpson, J., `The Frobenius problem on lattices' [228kB PDF], Australasian J. Combinatorics 32 (2005), 27-45.
8. Fan, K.; Smyth, W.F.; Simpson, J., `A new Periodicity Lemma' [166kB PostScript], Proc 16th Symposium on Comb. Pattern Matching, LNCS 3537, Springer-Verlag (2005), 257-265.
9. Fraenkel, A.S.; Simpson, J., `An extension of the periodicity lemma to longer periods' [279kB PDF], Discrete Applied Mathematics 146 (2005) 146-155.
10. Simpson, J., `Disjoint Beatty Sequences' [348 kB PDF], Integers 4 (2004), article A12, 10 pages.
11. Simpson, J., `A new proof that 1=0' [42kB Word], J. Recreational Mathematics 32 (2003-2004) 142-143.
12. Simpson, J., `Comprehension as an assessment tool for mathematics' [28kB Word], Gazette of Aust. Math. Soc. 31 No. 1 (2004), 25-26.
13. Gray, I. D.; MacDougall, J. A.; Simpson, R. J.; Wallis, W. D. `Vertex-magic total labelings of complete bipartite graphs' Ars Combin. 69 (2003), 117-127.
14. Franek, F.; Simpson, J.; Smyth, W.F., `The maximum number of runs in a string', Proceedings of the 2003 Australasian Workshop on Combinatorial Algorithms (2003).
15. Jenkin, Scott; Simpson, Jamie `Composite covering systems of minimum cardinality' Integers 3 (2003), A13, 11 pp. (electronic).
16. Ellis, John; Ruskey, Frank; Sawada, Joe; Simpson, Jamie `Euclidean strings' Theoret. Comput. Sci. 301 (2003), no. 1-3, 321-340.
17. Simpson, R. J.; Tijdeman, R. `Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester' Proc. Amer. Math. Soc. 131 (2003), no. 6, 1661-1671 (electronic).
18. Fraenkel, A. S.; Simpson, R. J.; Paterson, M. S. `On abelian circular squares in binary words' Paul Erdös and his mathematics, II (Budapest, 1999), 329-338, Bolyai Soc. Math. Stud. 11, János Bolyai Math. Soc., Budapest, 2002.
19. Christos , G.; Simpson, J., `Optimal Strategy in the Weakest Link', Gazette Austral. Math. Soc. 29 (2002), 269-272.
20. Christos , G.; Simpson, J., `Fixing the fixtures with genetic algorithms', Proceedings 6th Australasian Conf. on Mathematics and Computers in Sport, Bond University, 2002.
21. Currie, James D.; Simpson, Jamie `Non-repetitive tilings' Electron. J. Combin. 9 (2002), no. 1, RP 28, 13 pp. (electronic).
22. Fraenkel, Aviezri S.; Simpson, Jamie `An extension of the periodicity lemma to longer periods (invited lecture).' Combinatorial pattern matching (Jerusalem, 2001), 98-105, Lecture Notes in Comput. Sci. 2089, Springer, Berlin, 2001.
23. Iliopoulos, Costas S.; Simpson, R. Jamie `On-line validation and analysis of partially occluded images.' J. Autom. Lang. Comb. 6 (2001), no. 3, 291-303.
24. (In honor of Aviezri Fraenkel on the occasion of his 70th birthday) Edited by Edward R. Scheinerman and Jamie Simpson. Electron. J. Combin. 8 (2001), no. 2, 05-06 (front matter).
25. Fraenkel, Aviezri S.; Seeman, Tamar; Simpson, Jamie `The subword complexity of a two-parameter family of sequences' In honor of Aviezri Fraenkel on the occasion of his 70th birthday. Electron. J. Combin. 8 (2001), no. 2, RP 10, 19 pp. (electronic).
26. Simpson, Jamie `Aviezri Fraenkel's work in number theory' In honor of Aviezri Fraenkel on the occasion of his 70th birthday. Electron. J. Combin. 8 (2001), no. 2, Introduction 3, 3 pp. (electronic).
27. Simpson, Jamie, `Magic rectangles', Proceedings of the 2000 Australasian Workshop on Combinatorial Algorithms (AWOCA 2000), University of Newcastle, ISBN 0 7259 1098 4, (2000), pp 119-124.
28. Zeleke, Melkamu; Simpson, Jamie, `On disjoint covering systems with precisely one repeated modulus.' Adv. in Appl. Math. 23 (1999), no. 3, 322-332.
29. Fraenkel, Aviezri S.; Simpson, Jamie `The exact number of squares in Fibonacci words' WORDS (Rouen, 1997). Theoret. Comput. Sci. 218 (1999), no. 1, 95-106.
30. Bruce, I.D.; Simpson, R.J., `Evolution determined by trajectory of expected populations: sufficient conditions with application to crossover', Evolutionary Computation, 7 (1999), 151-171.
31. Simpson, R. J., `Covering systems of homogeneous congruences' Rocky Mountain J. Math. 28 (1998), no. 3, 1125-1133.
32. Simpson, R. J., `Recognising the set of moduli of a covering system', Proceedings of the 1998 Australasian Workshop on Combinatorial Algorithms ( AWOCA'98), Curtin University of Technology (1998).
33. Fraenkel, Aviezri S.; Simpson, Jamie `How many squares can a string contain?' J. Combin. Theory Ser. A 82 (1998), no. 1, 112-120.
34. Boswell, Sharon G.; Simpson, Jamie `Edge-disjoint maximal planar graphs' Discrete Math. 179 (1998), no. 1-3, 235-241.
35. Fraenkel, Aviezri S.; Simpson, Jamie; Paterson, Mike `On weak circular squares in binary words' Combinatorial pattern matching (Aarhus, 1997), 76-82, Lecture Notes in Comput. Sci. 1264, Springer, Berlin, 1997.
36. Iliopoulos, C.S.; Simpson, J., `On-line validation and analysis of occluded images', Proceedings of the 1997 Australasian Workshop on Combinatorial Algorithms (AWOCA'97), Queensland University of Technology (1997), 25-36.
37. Simpson, R. J. `On a conjecture of Crittenden and Vanden Eynden concerning coverings by arithmetic progressions' J. Austral. Math. Soc. Ser. A 63 (1997), no. 3, 396-420.
38. Simpson, R. J. `Scheduling a bridge club using a genetic algorithm' Math. Mag. 70 (1997), no. 4, 281-286.
39. Eggleton, Roger B.; Simpson, R. J. `Beaches, bays and headlands' Australas. J. Combin. 15 (1997), 47-59.
40. Fraenkel, Aviezri S.; Simpson, R. Jamie `How many squares must a binary sequence contain?' Electron. J. Combin. 2 (1995), RP 2, 9 pp. (electronic).
41. Simpson, R. J., `A survey of first year calculus courses at Australian and New Zealand universities', Gazette of Aust. Math. Soc. 23 (1996), 13-17.
42. Miller, M.; Roberts, I.T. and Simpson, R.J., `Prevention of relative compromise in statistical databases using audit expert', Bulletin of the Institute of Combinatorics and its Applications 10 (1994), 51-62.
43. Simpson, R. J. and Smyth, W. F., `Floor and Ceiling identities (Problem 10414)', Amer. Math. Monthly 101 (1994), 912
44. Geelen, J. F.; Simpson, R. J. `A two-dimensional Steinhaus theorem' Australas. J. Combin. 8 (1993), 169-197.
45. Eggleton, Roger B.; Fraenkel, Aviezri S.; Simpson, R. Jamie `Beatty sequences and Langford sequences' Graph theory and combinatorics (Marseille-Luminy, 1990). Discrete Math. 111 (1993), no. 1-3, 165-178.
46. Perriman, W. S. and Simpson, R. J., `On opening doors and envelopes', Gazette of Aust. Math. Soc. 20 (1993), 49-52.
47. Fraenkel, Aviezri S.; Simpson, R. Jamie `On infinite disjoint covering systems' Proc. Amer. Math. Soc. 119 (1993), no. 1, 5-9.
48. Colbourn, Charles J.; Simpson, R. J. `A note on bounds on the minimum area of convex lattice polygons' Bull. Austral. Math. Soc. 45 (1992), no. 2, 237-240.
49. Simpson, R. J. `Disjoint covering systems of rational Beatty sequences' Discrete Math. 92 (1991), no. 1-3, 361-369.
50. Simpson, R. J.; Zeilberger, Doron `Necessary conditions for distinct covering systems with square-free moduli' Acta Arith. 59 (1991), no. 1, 59-70.
51. Simpson, R. J, `Falsity of a stronger form of Carmichael's conjecture: solution to problem E3361', American Mathematical Monthly 98 (1991), 443-444.
52. Miller, Mirka; Roberts, Ian; Simpson, Jamie `Application of symmetric chains to an optimization problem in the security of statistical databases' Bull. Inst. Combin. Appl. 2 (1991), 47-58.
53. Simpson, R. J. `Convex lattice polygons of minimum area' Bull. Austral. Math. Soc. 42 (1990), no. 3, 353-367.
54. Gerver, Joseph; Propp, James; Simpson, Jamie `Greedily partitioning the natural numbers into sets free of arithmetic progressions' Proc. Amer. Math. Soc. 102 (1988), no. 3, 765-772.
55. Simpson, R. J. `Disjoint covering systems of congruences' Amer. Math. Monthly 94 (1987), no. 9, 865-868.
56. Simpson, R. J. `Exact coverings of the integers by arithmetic progressions.' Discrete Math. 59 (1986), no. 1-2, 181-190.
57. Simpson, R. J. `Regular coverings of the integers by arithmetic progressions' Acta Arith. 45 (1985), no. 2, 145-152.
58. Simpson, R. J. `On a conjecture of R. L. Graham' Acta Arith. 40 (1981/82), no. 2, 209-211.
59. Driver, P. M.; Jones, R. W.; Riddiford, C. L. and Simpson, R. J., `A new Chrome Black selective absorbing surface', Solar Energy 19 (1977), 301-306.