18 citations · 38 across the 7 of their papers we have counts for
7 papers
Taffy, Trees, and Tangles
Neil J. Calkin, Eliza Gallagher, Ben Gobler
We study the relationship between three combinatorial objects -- a taffy pulling machine, the Calkin-Wilf tree of all fractions, and Conway's rational tangles. After introducing th…
On the maximal spread of symmetric Bohemian matrices
Neil J. Calkin, Robert M. Corless, Laureano Gonzalez-Vega +2
Let A be a square matrix with real entries. The spread of A is defined as the maximum of the distances among the eigenvalues of A. Let denote the set of all …
Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials
Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless
The authors have been using a largely algebraic form of ``computational discovery'' in various undergraduate classes at their respective institutions for some decades now to teach…
A Fractal Eigenvector
Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless +2
The recursively-constructed family of Mandelbrot matrices for , , have nonnegative entries (indeed just and , so each can be called a binary mat…
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments
Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa
Moser asked for a construction of explicit tournaments on vertices having at least Hamilton cycles. We show that he could have asked for rather more.
Finite field elements of high order arising from modular curves
Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao +6
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit…