Publications - Jason I. Brown

43. Jason I. Brown and Richard Nowakowski, Average Independence Polynomials, J. Comb. Th. B, accepeted for publication.

42. Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, The k-Fractal of a Simplicial Complex, Discrete Mathematics, accepted for publication.

41. Jason I. Brown, Mathematics, Physics and A Hard Day's Night, CMS Notes 36 (2004), 4-8.

40. Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, On the Location of Roots of Independence Polynomials, J. Algebraic Combinatorics 19 (2004), 273-282.

39. Jason I. Brown, Carl A. Hickman and Richard J. Nowakowski, Independence Fractals of Graphs, J. Comb. Th. B. 87 (2003), 209-230.

38. Jason I. Brown and Carl A. Hickman, The Existence of Infinitely Many Chromatic Roots With Negative Real Part, Ars Combinatoria 63 (2002), 211-221.

37. Jason I. Brown, Carl A. Hickman, Alan D. Sokal and David G. Wagner, Chromatic Roots of Generalized Theta Graphs, J. Comb. Th. B 83 (2001), 272-297.

36. Jason I. Brown and Carl A. Hickman, On Chromatic Roots of Large Subdivisions of Graphs, Discrete Mathematics 242 (2002), 17-30.

35. Jason I. Brown and Richard J. Nowakowski, Bounding the Roots of Independence Polynomials, Ars Combinatoria 58 (2001), 113-120.

34. Jason I. Brown, K. Dilcher and Richard J. Nowakowski, Roots of Independence Polynomials of Well Covered Graphs, J. Algebraic Comb. 11 (2000), 197-210.

33. Jason I. Brown, Subdivisions and Chromatic Roots, J. Combin. Th. B 76 (1999), 201-204.

32. Jason I. Brown, Chromatic Polynomials and Order Ideals of Monomials, Discrete Mathematics 189 (1998), 43-68.

31. Jason I. Brown, On the Roots of Chromatic Polynomials, J. Combin. Th. B 72 (1998), 251-256.

30. D. Achlioptas, J.I. Brown, D.G. Corneil and M.S.O. Molloy, The Existence of Uniquely -G Colourable Graphs, Discrete Mathematics 179 (1998), 1-11.

29. Jason I. Brown, Charles J. Colbourn and David G. Wagner, Cohen-Macaulay Rings in Network Reliability, SIAM J. Discrete Math. 9 (1996), 377-392.

28. Jason I. Brown and Stephen Watson, The Number of Complements of a Topology on n points is 2^n (except for some special cases), Discrete Mathematics 154 (1996), 1-25.

27. Jason I. Brown, Richard J. Nowakowski and Douglas Rall, The Ultimate Categorical Independence Ratio, SIAM J. Discrete Math. 9 (1996), 290-300.

26. Jason I. Brown, The Complexity of Generalized Graph Colourings, Discrete Appl. Math. 69 (1996), 245-253.

25. Jason I. Brown and Charles J. Colbourn, Non-Stanley Bounds for Network Reliability, Journal of Algebraic Combinatorics 5 (1996), 13-36.

24. Jason I. Brown and Charles J. Colbourn, On the Log Concavity of Reliability and Matroidal Sequences, Advances in Applied Mathematics 15 (1994), 114-127.

23. Jason I. Brown and A. Sidorenko, The Inducibility of Complete Bipartite Graphs, J. Graph Theory 18 (1994), 629-645.

22. Jason I. Brown and Stephen Watson, Partial Order Complementation Graphs, Order 11 (1994), 237-255.

21. Jason I. Brown and Vojtech Rödl, Folkman Numbers for Graphs of Small Order, Ars Combinatoria 35-A (1993), 11-27.

20. Jason I. Brown and Stephen Watson, Mutually Complementary Partial Orders, Discrete Mathematics 113 (1993), 27-39.

19. Jason I. Brown, Charles J. Colbourn and John S. Devitt, Network Transformations and Bounding Network Reliability, Networks 23 (1993), 1-17.

18. Jason I. Brown and Charles J. Colbourn, Roots of the Reliability Polynomial, SIAM J. Discrete Math. 5 (1992), 571-585.

17. Jason I. Brown and Derek G. Corneil, On Uniquely -G k-Colourable Graphs, Quaestiones Math. 15 (1992), 477-487.

16. Jason I. Brown, A Vertex Critical Graph Without Critical Edges, Discrete Math. 102 (1992), 99-101.

15. Jason I. Brown and Derek G. Corneil, Graph Properties and Hypergraph Colourings, Discrete Math. 98 (1991), 81-93.

14. Jason I. Brown and Stephen Watson, Self Complementary Topologies and Partial Orders, Order 7 (1991), 317-328.

13. Jason I. Brown and Vojtech Rödl, A Ramsey Type Problem Concerning Vertex Colourings, J. Combin. Th. B 52 (1991), 45-52.

12. Jason I. Brown and Derek Corneil, Perfect Colourings, Ars Combinatoria 30 (1990), 141-159.

11. Gerhard Benadé, Izak Broere and Jason I. Brown, A Construction of Uniquely -C4 Colourable Graphs, Quaestiones Math. 13 (1990), 359-364.

10. Jason I. Brown, Derek G. Corneil and A.R. Mahjoub, A Note on Ki-Perfection, J. Graph Th. 14 (1990), 333-340.

9. Jason I. Brown and Vojtech Rödl, A New Construction of k-Folkman Graphs, Ars Combinatoria 29 (1990), 265-269.

8. Jason I. Brown, David Kelly, J. Schönheim and Robert E. Woodrow, Graph Colouring Satisfying Restraints, Discrete Math. 80 (1990), 123-143.

7. Jason I. Brown and Charles J. Colbourn, A Set System Polynomial with Coloring and Reliability Applications, SIAM J. Disc. Math. 1 (1988), 151-157.

6. Jason I. Brown and Derek G. Corneil, On Generalized Graph Colorings, J. Graph Th. 11 (1987), 87-99.

5. Jason I. Brown and Charles J. Colbourn, A Combinatorial Study of the Reliability Polynomial, Congressus Numeratium 56 (1987), 71 - 89.

Nonrefereed publications

4. Jason I. Brown, Maple Roots Itself in High Schools, Computer Dealer News 11 (Jan. 25, 1995), 28-30.

3. Jason I. Brown, Tips on Designing Multimedia Program Menus, Multimedia Today 3 (1995), 50-51.

2. Jason I. Brown, Lost in Hyperspace, Multimedia Today 2 (1994), 40-42.

1. Jason I. Brown, "Maple V Project: Final Report", Technical Report 94-2, Center for the Study of Computers in Education, York University, 1994 (submitted to the Province of Ontario's Ministry of Education and Training).

Refereed Conference Papers

C1. Jason I. Brown and Charles J. Colbourn, A Combinatorial Study of the Reliability Polynomial, presented at the Proc. Sixteenth Manitoba Conf. Numerical Mathematics and Computing, Winnipeg, Manitoba, Canada (1986), 71-89.

Publications submitted to refereed journals

S5. Jason I. Brown and Xiaohu Li, The Strongly Connected Relibility of Complete Digraphs, submitted to Networks.

S4. Jason I. Brown and Richard J. Nowakowski, The Well-Covered Dimension of Random Graphs, submitted to Discrete Mathematics.

S3. Jason I. Brown and Richard Hoshino, The Ehrenfeucht-Fraisse Games for Paths and Cycles, submitted to Discrete Mathematics.

S2. Jason I. Brown, Richard J. Nowakowski and Igor Zverovich, The Structure of Well-Covered C4-Free Graphs, submitted to SIAM J. Disc. Math.

S1. Jason I. Brown and Richard J. Nowakowski, Well Covered Vector Spaces of Graphs, submitted to SIAM J. Discrete Math.

Research Monograph/Graduate Texts

M1. Jason I. Brown, Combinatorial Modeling, in preparation. This text, used at the AARMS Summer Graduate School (for Computer Science and Mathematics students) in August 2002, puts a variety of standard (graphs, directed graphs, partial orders, hypergraphs) and nonstandard (preorders, finite topologies, complexes, order ideals of monomials) discrete structures in a common context, and draws connections to various fields of mathematics, such as linear, multilinear and commutative algebra, topology, logic, analysis and probability theory. Rarely studied areas of algorithmic study, such as those on finite topologies, are raised.

Software publications

Online Precalculus DiagnosticTest and Online Assignments for Calculus, Jason I. Brown, 2002. (http://www.mscs.dal.ca/~brown/diagnostic.htm, http://www.conline.mathstat.dal.ca)

Navigating Calculus, Jason I. Brown, Arnold Ostobee and Paul Zorn, Houghton Mifflin, 2002.

This CD guides students through more than 80 interactivities for first year calculus, including multivariable calculus. For the CD, I created the specifications for all storyboards, highlighting what the multimedia medium can uniquely offer in a computer-based learning environment, and an online pedagogical calculator, with specialized tools (slopes, areas, etc.) for learning calculus.

Mathematics, Modeling and Maple® , Jason I. Brown, 1998.

The Mathematics of Multimedia, Jason I. Brown, 2000.

Graph Workshop, Jason I. Brown, 1992.

Vertex Colourings of Graphs, Jason I. Brown, 1991.