activity
20172022
most citedTwo Families of Buffered Frobenius Representations of Overpartitions

4 citations · 7 across the 5 of their papers we have counts for

collaborators

9 papers

math.HO2022

On The Euclidean Algorithm: Rhythm Without Recursion

Thomas Morrill

A modified form of Euclid's algorithm has gained popularity among musical composers following Toussaint's 2005 survey of so-called Euclidean rhythms in world music. We offer a meth…

math.NT2020

Quasimodularity of the th Residual Cranks

Thomas Morrill, Aleksander Simonič

We establish quasimodularity for a family of residual crank generating functions defined on overpartitions. We also show that the second moments of these th residual cranks admi…

math.CO2020

Look, Knave

Thomas Morrill

We examine a recursive sequence in which is a literal description of what the binary expansion of the previous term is not. By adapting a technique of Conway, we de…

math.NT2019

Inequalities for the th Residual Crank Moments of Overpartitions

Ali H. Al-Saedi, Thomas Morrill, Holly Swisher

Two analogues of the crank function are defined for overpartitions -- the first residual crank and the second residual crank. This suggests an exploration of crank functions define…

math.NT2019

Sign changes in the prime number theorem

Thomas Morrill, Dave Platt, Tim Trudgian

Let denote the number of sign changes in for . We show that , where $γ_{…

math.NT2018

An elementary bound on Siegel zeroes

Thomas Morrill, Tim Trudgian

We consider Dirichlet -functions where is a real, non-principal character modulo . Using Pintz's refinement of Page's theorem, we prove that for the f…