Home Publications Other places you can find me

Choose a numbered point to jump to its citation. Overlapping subject areas indicate thematic connections; placement is a conceptual guide, not a measured similarity score.

Numbered publication points grouped in overlapping subject bubbles. Each point links to its citation below. A topic index follows. 68: Multigraphs with a unique partition into cycles 67: Distance Critical Graphs 66: Permutations minimizing the number of collinear triples 65: Principal eigenvectors and principal ratios in hypergraph Turán problems 64: A generalization of the Graham-Pollak tree theorem to even-order Steiner distance 63: Note on the spectra of Steiner distance hypermatrices 62: Polynomial reconstruction problem for hypergraphs 61: A generalization of the Graham-Pollak tree theorem to Steiner distance 60: Positive-Definite Matrices over Finite Fields 59: Characteristic power series of graph limits 58: Geometric vs algebraic nullity for hyperpaths 57: Applications of the Harary-Sachs theorem for hypergraphs 56: Recurrence ranks and moment sequences 55: Sampling Permutations for Shapley Value Estimation 54: Radar based navigation for Autonomous Surface Vehicles 53: Spectral Extremal Results for Hypergraphs 52: Recurrence Ranks and Moment Sequences 51: A Harary-Sachs theorem for hypergraphs 50: Constraints on Brouwer’s Laplacian spectrum conjecture 49: Adjacency spectra of random and complete hypergraphs 48: Stably computing the multiplicity of known roots given leading coefficients 47: A New Characterization of V-Posets 46: Adjacency Spectral Theory for Uniform Hypergraphs 45: Uniquely pressable graphs: Characterization, enumeration, and recognition 44: Machine Learning to Quantitate Neutrophil NETosis 43: On the Adjacency Spectra of Hypertrees 41: Graham’s Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions 40: Density dichotomy in random words 39: Throwing a Ball as Far as Possible, Revisited 38: Analytic connectivity of k-uniform hypergraphs 69: Calculus Problems 37: Quantitation of Suicidal Netosis Using Convolutional Neural Networks in Human Neutrophils 36: Asymptotic Density of Zimin Words 35: Successful pressing sequences for a bicolored graph and binary matrices 34: The complexity of counting poset and permutation patterns 33: Computing hypermatrix spectra with the Poisson product formula 32: Bounds on Zimin word avoidance 31: Colorings of Pythagorean triples within colorings of the positive integers 30: Note on the spectral radius of alternating sign matrices 29: Deterministic walks with choice 28: Critical sets for Sudoku and general graph colorings 70: Bioterrorism and the Fermi Paradox 27: On the Reciprocal of the Binary Generating Function for the Sum of Divisors 26: Generalized Pattern Frequency in Large Permutations 25: Greedy Galois Games 24: Generalized Fibonacci recurrences and the lex-least de Bruijn sequence 23: Spectra of uniform hypergraphs 22: Uniquely C4-Saturated Graphs 21: Monochromatic Boxes in Colored Grids 20: Graphs with Asymptotically Invariant Degree Sequences under Restriction 19: Linearly bounded liars, adaptive covering codes, and deterministic random walks 18: Deterministic random walks on regular trees 17: Iterated Point-Line Configurations Grow Doubly-Exponentially 16: The discrepancy of the lex-least de Bruijn sequence 15: Deterministic Random Walks on Regular Trees 14: Deterministic Random Walks on Regular Trees 13: Deterministic random walks on the integers 12: Reciprocals of Binary Power Series 11: Deterministic Random Walks 10: A Permutation Regularity Lemma 9: Simulating a Random Walk with Constant Error 8: Continued fractions with partial quotients bounded in average 7: Deterministic Random Walks on the Integers 6: Collinear Points in Permutations 5: Quasirandom arithmetic permutations 4: Generalized de Bruijn Cycles 3: De Bruijn cycles for covering codes 2: Quasirandom permutations 71: A Student at the Board Meeting 1: Asymmetric Binary Covering Codes
Browse publications by topic

Discrete geometry

66, 21, 17, 6

Permutations

66, 55, 34, 26, 10, 6, 5, 2

Quasirandomness

59, 55, 49, 26, 20, 16, 10, 5, 2

Spectral graph theory

67, 64, 63, 61, 59, 50, 41, 30, 22

Spectral hypergraph theory

65, 64, 63, 62, 61, 58, 57, 53, 51, 49, 46, 43, 38, 33, 23

Extremal combinatorics

68, 67, 65, 53, 50, 31, 28, 22, 21, 20

Poset theory

47, 34

Pressing sequences

60, 47, 45, 35

Combinatorial matrix theory

60, 56, 52, 48, 45, 35, 30

Machine learning

55, 54, 44, 37

Deterministic walks

29, 19, 18, 15, 14, 13, 11, 9, 7

Combinatorics on words

40, 36, 32, 27, 25, 24

Universal cycles

68, 24, 16, 12, 4, 3

Coding theory

19, 3, 1

Combinatorial number theory

56, 52, 41, 31, 27, 25, 12, 8, 5

Other writing

39, 69, 70, 71

Publication list

Jump to year: 2026 · 2025 · 2024 · 2023 · 2022 · 2021 · 2020 · 2019 · 2018 · 2017 · 2016 · 2015 · 2014 · 2013 · 2012 · 2011 · 2010 · 2008 · 2007 · 2006 · 2005 · 2004 · 2002

2026

68. Multigraphs with a unique partition into cycles

J. Cooper, U. Okur. Discussiones Mathematicae Graph Theory 46(3) (2026). Published article.

2025

67. Distance Critical Graphs

J. Cooper, G. Tauscheck. Graphs and Combinatorics 41, article 87 (2025).

66. Permutations minimizing the number of collinear triples

J. Cooper, J. Hyatt. Designs, Codes and Cryptography 93 (2025), 3135–3142.

2024

65. Principal eigenvectors and principal ratios in hypergraph Turán problems

J. Cooper, D. N. Desai, A. Sahay. Electronic Journal of Linear Algebra 40 (2024), 697–713.

64. A generalization of the Graham-Pollak tree theorem to even-order Steiner distance

J. Cooper, G. Tauscheck. Special Matrices 12(1) (2024), article 20240018.

63. Note on the spectra of Steiner distance hypermatrices

J. Cooper, Z. Du. Electronic Journal of Combinatorics 31(3) (2024), P3.7.

62. Polynomial reconstruction problem for hypergraphs

J. Cooper, U. Okur. Linear Algebra and its Applications 692 (2024), 37–61.

61. A generalization of the Graham-Pollak tree theorem to Steiner distance

J. Cooper, G. Tauscheck. Discrete Mathematics 347(4) (2024), article 113849.

60. Positive-Definite Matrices over Finite Fields

J. Cooper, E. Hanna, H. Whitlatch. Rocky Mountain Journal of Mathematics 54(2) (2024), 423–438.

2023

59. Characteristic power series of graph limits

J. N. Cooper. European Journal of Combinatorics 108 (2023), article 103629.

2022

58. Geometric vs algebraic nullity for hyperpaths

J. Cooper, G. Fickes. Pure and Applied Mathematics Quarterly 18(6) (2022), 2433–2460.

57. Applications of the Harary-Sachs theorem for hypergraphs

G. J. Clark, J. N. Cooper. Linear Algebra and its Applications 649 (2022), 354–374.

56. Recurrence ranks and moment sequences

J. Cooper, G. Fickes. In Number Theory and Combinatorics: A Collection in Honor of the Mathematics of Ronald Graham, De Gruyter (2022). Book chapter; also published in Integers (2021), entry 52.

55. Sampling Permutations for Shapley Value Estimation

R. Mitchell, J. Cooper, E. Frank, G. Holmes. Journal of Machine Learning Research 23(43) (2022), 1–46.

2021

54. Radar based navigation for Autonomous Surface Vehicles

I. J. Salman, J. A. Baum, H. J. Damron, J. Y. Nelson, A. K. Smith, M. Xanthidis, J. Cooper, I. Rekleitis. Radar Perception for All-Weather Autonomy, workshop at the IEEE International Conference on Robotics and Automation (ICRA), 2021. Workshop paper.

53. Spectral Extremal Results for Hypergraphs

Y. Hou, A. Chang, J. Cooper. Electronic Journal of Combinatorics 28(3) (2021), P3.46.

52. Recurrence Ranks and Moment Sequences

J. Cooper, G. Fickes. Integers 21A (2021), A9. Also published as a book chapter (2022), entry 56.

51. A Harary-Sachs theorem for hypergraphs

G. J. Clark, J. N. Cooper. Journal of Combinatorial Theory, Series B 149 (2021), 1–15.

50. Constraints on Brouwer’s Laplacian spectrum conjecture

J. N. Cooper. Linear Algebra and its Applications 615 (2021), 11–27.

2020

49. Adjacency spectra of random and complete hypergraphs

J. N. Cooper. Linear Algebra and its Applications 596 (2020), 184–202.

48. Stably computing the multiplicity of known roots given leading coefficients

G. J. Clark, J. N. Cooper. Numerical Linear Algebra with Applications 27(2) (2020), e2275.

47. A New Characterization of V-Posets

J. Cooper, P. Gartland, H. Whitlatch. Order 37(2) (2020), 371–387.

2019

46. Adjacency Spectral Theory for Uniform Hypergraphs

G. J. Clark, J. N. Cooper. IMAGE, Bulletin of the International Linear Algebra Society 62 (Spring 2019), 7–19. Survey article.

45. Uniquely pressable graphs: Characterization, enumeration, and recognition

J. N. Cooper, H. W. Whitlatch. Advances in Applied Mathematics 103 (2019), 13–42.

44. Machine Learning to Quantitate Neutrophil NETosis

L. Elsherif, N. Sciaky, C. A. Metts, M. Modasshir, I. Rekleitis, C. A. Burris, J. A. Walker, N. Ramadan, T. M. Leisner, S. P. Holly, M. Cowles, K. I. Ataga, J. N. Cooper, L. V. Parise. Scientific Reports 9 (2019), article 16891.

2018

43. On the Adjacency Spectra of Hypertrees

G. J. Clark, J. N. Cooper. Electronic Journal of Combinatorics 25(2) (2018), P2.48.

42. Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham

S. Butler, J. Cooper, G. Hurlbert (editors). Cambridge University Press (2018). Edited volume.

41. Graham’s Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions

J. N. Cooper, B. Kay, A. Swifton. Journal of Combinatorics 9(3) (2018), 469–488.

40. Density dichotomy in random words

J. N. Cooper, D. Rorabaugh. Contributions to Discrete Mathematics 13(1) (2018), 120–135.

2017

39. Throwing a Ball as Far as Possible, Revisited

J. N. Cooper, A. Swifton. The American Mathematical Monthly 124(10) (2017), 955–959.

38. Analytic connectivity of k-uniform hypergraphs

A. Chang, J. N. Cooper, W. Li. Linear and Multilinear Algebra 65(6) (2017), 1247–1258.

2016

69. Calculus Problems

J. N. Cooper. Journal of Humanistic Mathematics 6(2) (2016), 228. Poem.

37. Quantitation of Suicidal Netosis Using Convolutional Neural Networks in Human Neutrophils

Laila Elsherif, Carrington A. Metts, Noah Sciaky, Joshua N. Cooper, Stephen P. Holly, and Leslie V. Parise. Blood 128(22) (2016), abstract 3686. Published meeting abstract.

36. Asymptotic Density of Zimin Words

J. Cooper, D. Rorabaugh. Discrete Mathematics & Theoretical Computer Science 18(3) (2016), article 3.

35. Successful pressing sequences for a bicolored graph and binary matrices

J. N. Cooper, J. Davis. Linear Algebra and its Applications 490 (2016), 162–173.

34. The complexity of counting poset and permutation patterns

J. N. Cooper, A. Kirkpatrick. Australasian Journal of Combinatorics 64(1) (2016), 154–165.

2015

33. Computing hypermatrix spectra with the Poisson product formula

J. N. Cooper, A. Dutle. Linear and Multilinear Algebra 63(5) (2015), 956–970.

2014

32. Bounds on Zimin word avoidance

J. N. Cooper, D. Rorabaugh. Congressus Numerantium 222 (2014), 87–95.

31. Colorings of Pythagorean triples within colorings of the positive integers

J. Cooper, M. Filaseta, J. Harrington, D. White. Journal of Combinatorial Number Theory 6(1) (2014).

30. Note on the spectral radius of alternating sign matrices

R. A. Brualdi, J. N. Cooper. Linear Algebra and its Applications 442 (2014), 99–105.

29. Deterministic walks with choice

P. S. Barr, K. E. Beeler, K. S. Berenhaut, J. N. Cooper, M. N. Hunter. Discrete Applied Mathematics 162 (2014), 100–107.

28. Critical sets for Sudoku and general graph colorings

J. N. Cooper, A. E. Kirkpatrick. Discrete Mathematics 315–316 (2014), 112–119.

2013

70. Bioterrorism and the Fermi Paradox

J. N. Cooper. International Journal of Astrobiology 12(2) (2013), 144–148.

27. On the Reciprocal of the Binary Generating Function for the Sum of Divisors

J. N. Cooper, A. Riasanovsky. Journal of Integer Sequences 16 (2013), article 13.1.8.

26. Generalized Pattern Frequency in Large Permutations

J. N. Cooper, E. Lundberg, B. Nagle. Electronic Journal of Combinatorics 20(1) (2013), P1.28.

25. Greedy Galois Games

J. N. Cooper, A. Dutle. The American Mathematical Monthly 120(5) (2013), 441–451.

24. Generalized Fibonacci recurrences and the lex-least de Bruijn sequence

J. N. Cooper, C. Heitsch. Advances in Applied Mathematics 50(4) (2013), 465–473.

2012

23. Spectra of uniform hypergraphs

J. N. Cooper, A. Dutle. Linear Algebra and its Applications 436(9) (2012), 3268–3292.

22. Uniquely C4-Saturated Graphs

J. N. Cooper, J. Lenz, T. D. LeSaulnier, P. S. Wenger, D. B. West. Graphs and Combinatorics 28(2) (2012), 189–197.

2011

21. Monochromatic Boxes in Colored Grids

J. N. Cooper, S. Fenner, S. Purewal. SIAM Journal on Discrete Mathematics 25(3) (2011), 1054–1068.

20. Graphs with Asymptotically Invariant Degree Sequences under Restriction

J. N. Cooper, L. Lu. Internet Mathematics 7(1) (2011), 67–80.

2010

19. Linearly bounded liars, adaptive covering codes, and deterministic random walks

J. N. Cooper, R. Ellis. Journal of Combinatorics 1(3–4) (2010), 307–334.

18. Deterministic random walks on regular trees

J. N. Cooper, B. Doerr, T. Friedrich, J. Spencer. Random Structures & Algorithms 37(3) (2010), 353–366. Journal version of entries 15 and 14.

17. Iterated Point-Line Configurations Grow Doubly-Exponentially

J. N. Cooper, M. Walters. Discrete & Computational Geometry 43(3) (2010), 554–562.

16. The discrepancy of the lex-least de Bruijn sequence

J. N. Cooper, C. Heitsch. Discrete Mathematics 310(6–7) (2010), 1152–1159.

2008

15. Deterministic Random Walks on Regular Trees

J. N. Cooper, B. Doerr, T. Friedrich, J. Spencer. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), 766–772. Conference version; journal version in entry 18.

2007

14. Deterministic Random Walks on Regular Trees

J. N. Cooper, B. Doerr, T. Friedrich, J. Spencer. Electronic Notes in Discrete Mathematics 29 (2007), 509–513. Extended abstract; journal version in entry 18.

13. Deterministic random walks on the integers

J. N. Cooper, B. Doerr, J. Spencer, G. Tardos. European Journal of Combinatorics 28(8) (2007), 2072–2090.

2006

12. Reciprocals of Binary Power Series

J. N. Cooper, D. Eichhorn, K. O’Bryant. International Journal of Number Theory 2(4) (2006), 499–522.

11. Deterministic Random Walks

J. N. Cooper, B. Doerr, J. Spencer, G. Tardos. Proceedings of the Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2006), 185–197. Conference paper.

10. A Permutation Regularity Lemma

J. N. Cooper. Electronic Journal of Combinatorics 13 (2006), R22.

9. Simulating a Random Walk with Constant Error

J. N. Cooper and J. Spencer. Combinatorics, Probability and Computing 15(6) (2006), 815–822.

8. Continued fractions with partial quotients bounded in average

J. N. Cooper. The Fibonacci Quarterly 44(4) (2006), 297–301.

2005

7. Deterministic Random Walks on the Integers

J. N. Cooper, B. Doerr, J. Spencer, G. Tardos. EuroComb 2005, Discrete Mathematics & Theoretical Computer Science Proceedings AE (2005), 73–76. Conference version of entry 13.

6. Collinear Points in Permutations

J. N. Cooper and J. Solymosi. Annals of Combinatorics 9(2) (2005), 169–175.

5. Quasirandom arithmetic permutations

J. N. Cooper. Journal of Number Theory 114(1) (2005), 153–169.

2004

4. Generalized de Bruijn Cycles

J. N. Cooper and R. L. Graham. Annals of Combinatorics 8(1) (2004), 13–25.

3. De Bruijn cycles for covering codes

F. Chung and J. N. Cooper. Random Structures & Algorithms 25(4) (2004), 421–431.

2. Quasirandom permutations

J. N. Cooper. Journal of Combinatorial Theory, Series A 106(1) (2004), 123–143.

2002

71. A Student at the Board Meeting

J. N. Cooper. FOCUS, Newsletter of the Mathematical Association of America 22(3) (March 2002). Newsletter article.

1. Asymmetric Binary Covering Codes

J. N. Cooper, R. B. Ellis, A. B. Kahng. Journal of Combinatorial Theory, Series A 100(2) (2002), 232–249.