4 papers
Proof of Convergence of a Laplace Expansion Algorithm For Calculating Recursions Satisfied by a Family of Determinants
Russell Jay Hendel
In Evans and Hendel's recent proof of an outstanding conjecture on the resistance distances of a family of linear 3-trees, a key technique in the proof was calculating the recursio…
Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
Russell Jay Hendel
This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Re…
An Introductory Survey of Recursions in the Computation of Resistance Distance
Emily J. Evans, Russell Jay Hendel
This paper presents an introduction and expository account of a beautiful, current, and active application of recursions to the computation of resistance distance. Resistance dista…
Proof of a Conjecture on the Growth of the Maximal Resistance Distance in a Linear 3--Tree
Emily J. Evans, Russell Jay Hendel
Barret, Evans, and Francis conjectured that if is the straight linear 3-tree with vertices and is the straight linear 3-tree with vertices then \[\lim_{n\rightarr…