Neil J. Calkin

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 7

Top Topics

Topology Preservation

Fractal Image Encoding

Top Venues

Algorithmic Finance

INFORMS J. Appl. Anal.

Publications

Amy B. Gore, Mary E. Kurz, Matthew J. Saltzman, Blake Splitter, William C. Bridges, Neil J. Calkin
Clemson University's Rotational Attendance Plan During COVID-19. INFORMS J. Appl. Anal. 52 (6) (2022)
Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless, David J. Jeffrey, Piers W. Lawrence
A Fractal Eigenvector. Am. Math. Mon. 129 (6) (2022)
Neil J. Calkin, Killian Davis, Evan Haithcock, Catherine M. Kenyon, Sylvia Wu
What Newton Might Have Known: Experimental Mathematics in the Classroom. Am. Math. Mon. 128 (9) (2021)
Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless
Some Facts and Conjectures about Mandelbrot Polynomials. Maple Trans. 1 (1) (2021)
Neil J. Calkin, Colm Mulcahy
Reviews. Am. Math. Mon. 128 (7) (2021)
Jonathan M. Borwein, Neil J. Calkin, Scott B. Lindstrom, Andrew Mattingly
Continued Logarithms and Associated Continued Fractions. Exp. Math. 26 (4) (2017)
Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments. Am. Math. Mon. 123 (4) (2016)
Neil J. Calkin, Marcos López de Prado
Stochastic flow diagrams. Algorithmic Finance 3 (1-2) (2014)
Neil J. Calkin, Marcos López de Prado
The topology of macro financial flows: An application of stochastic flow diagrams. Algorithmic Finance 3 (1-2) (2014)
Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob, Kevin James
Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach. Integers 13 (2013)
Jonathan M. Borwein, Neil J. Calkin, Dante Manna
Euler-Boole Summation Revisited. Am. Math. Mon. 116 (5) (2009)
Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith
Finite field elements of high order arising from modular curves. Des. Codes Cryptogr. 51 (3) (2009)
Neil J. Calkin, Jimena Davis, Kevin James, Elizabeth Perez, Charles H. Swannack
Computing the integer partition function. Math. Comput. 76 (259) (2007)
Peter Dankelmann, Neil J. Calkin
The Domatic Number of Regular Graphs. Ars Comb. 73 (2004)
Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electron. J. Comb. 10 (2003)
Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory, Ser. A 91 (1-2) (2000)
Neil J. Calkin, Herbert S. Wilf
Recounting the Rationals. Am. Math. Mon. 107 (4) (2000)
Neil J. Calkin, Jennifer D. Key, Marialuisa J. de Resmini
Minimum Weight and Dimension Formulas for Some Geometric Codes. Des. Codes Cryptogr. 17 (1-3) (1999)
Neil J. Calkin, Peter J. Cameron
Almost Odd Random Sum-Free Sets. Comb. Probab. Comput. 7 (1) (1998)
Neil J. Calkin, Herbert S. Wilf
The Number of Independent Sets in a Grid Graph. SIAM J. Discret. Math. 11 (1) (1998)
Neil J. Calkin
On the structure of a random sum-free set of positive integers. Discret. Math. 190 (1-3) (1998)
Neil J. Calkin
Dependent Sets of Constant Weight Binary Vectors. Comb. Probab. Comput. 6 (3) (1997)
Neil J. Calkin, Paul Erdös, Craig A. Tovey
New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. 10 (3) (1997)
Neil J. Calkin
Dependent sets of constant weight vectors in GF(q). Random Struct. Algorithms 9 (1-2) (1996)
Neil J. Calkin, Steven R. Finch
Conditions on Periodicity for Sum-Free Sets. Exp. Math. 5 (2) (1996)
Neil J. Calkin
A curious binomial identity. Discret. Math. 131 (1-3) (1994)
Neil J. Calkin, Alan M. Frieze, Ludek Kucera
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. Random Struct. Algorithms 3 (2) (1992)
Neil J. Calkin, Alan M. Frieze, Brendan D. McKay
On Subgraph Sizes in Random Graphs. Comb. Probab. Comput. 1 (1992)
Neil J. Calkin, Alan M. Frieze
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms 1 (1) (1990)