2 citations · 6 across the 11 of their papers we have counts for
11 papers
Pi Visits Manhattan
Michelle Rudolph-Lilith
Is it possible to draw a circle in Manhattan, using only its discrete network of streets and boulevards? In this study, we will explore the construction and properties of circular…
On a recursive construction of circular paths and the search for on the integer lattice
Michelle Rudolph-Lilith
Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this p…
On the Product Representation of Number Sequences, with Application to the Fibonacci Family
Michelle Rudolph-Lilith
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences…
Percolation in Random Graphs: A Finite Approach
Michelle Rudolph-Lilith, Lyle E. Muller
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact resul…
On an explicit representation of central -nomial coefficients
Michelle Rudolph-Lilith, Lyle E. Muller
We propose an explicit representation of central -nomial coefficients in terms of finite sums over trigonometric constructs. The approach utilizes the diagonalization of ci…
Aspects of randomness in neural graph structures
Michelle Rudolph-Lilith, Lyle E. Muller
In the past two decades, significant advances have been made in understanding the structural and functional properties of biological networks, via graph-theoretic analysis. In gene…