arXiv subjects

Thomas Morrill

Publications and source records attributed to Thomas Morrill.

9 recordsLinked to original sources

arXiv2022

On The Euclidean Algorithm: Rhythm Without Recursion

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 method to easily calculate Euclid's algorithm by hand as a modification of Bresenham's line-drawing algorithm. Notably, this modified algorithm is a non-recursive matrix construction, using only modular arithmetic and combinatorics. This construction does not outperform the traditional divide-with-remainder method; it is presented for combinatorial interest and ease of hand computation.

math.HO↗

arXiv2020

Quasimodularity of the $k$th Residual Cranks

We establish quasimodularity for a family of residual crank generating functions defined on overpartitions. We also show that the second moments of these $k$th residual cranks admit a combinatoric interpretation as weighted overpartition counts.

math.NT↗

arXiv2020

Look, Knave

We examine a recursive sequence in which $s_n$ is a literal description of what the binary expansion of the previous term $s_{n-1}$ is not. By adapting a technique of Conway, we determine limiting behaviour of $\{s_n\}$ and dynamics of a related self-map of $2^{\mathbb{N}}$. Our main result is the existence and uniqueness of a pair of binary sequences, each the compliment-description of the other. We also take every opportunity to make puns.

math.CO↗

arXiv2019

Inequalities for the $d$th Residual Crank Moments of Overpartitions

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 defined for overpartitions whose parts are divisible by an arbitrary $d$. We examine the positive moments of these crank functions while varying $d$ and prove some inequalities.

math.NT↗

arXiv2019

Sign changes in the prime number theorem

Let $V(T)$ denote the number of sign changes in $\psi(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq \gamma_{1}/\pi + 1.867\cdot 10^{-30}$, where $\gamma_{1} = 14.13\ldots$ denotes the ordinate of the lowest-lying non-trivial zero of the Riemann zeta-function. This improves on a long-standing result by Kaczorowski.

math.NT↗

arXiv2018

An elementary bound on Siegel zeroes

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a real, non-principal character modulo $q$. Using Pintz's refinement of Page's theorem, we prove that for $q\geq 3$ the function $L(s, \chi)$ has at most one real zero $\beta$ with $1- 1.011/\log q < \beta < 1$.

math.NT↗

arXiv2018

Robin's inequality for 20-free integers

In 1984, Robin showed that the Riemann Hypothesis for $\zeta$ is equivalent to demonstrating $\sigma(n) < e^\gamma n \log \log n$ for all $n > 5040$. Robin's inequality has since been proven for various infinite families of power-free integers: $5$-free integers, $7$-free integers, and $11$-free integers. We extend these results to cover $20$-free integers.

math.NT↗

arXiv2018

Difference Tones in "Non-Pythagorean" Scales Based on Logarithms

In order to explore tonality outside of the `Pythagorean' paradigm of integer ratios, Robert Schneider introduced a musical scale based on the logarithm function. We seek to refine Schneider's scale so that the difference tones generated by different degrees of the scale are themselves octave equivalents of notes in the scale. In doing so, we prove that a scale which contains all its difference tones in this way must consist solely of integer ratios. With this in mind, we present some methods for producing logarithmic scales which contain many, but not all, of the difference tones they generate.

math.HO↗

arXiv2017

Two Families of Buffered Frobenius Representations of Overpartitions

We generalize the generating series of the Dyson ranks and $M_2$-ranks of overpartitions to obtain $k$-fold variants, and give a combinatorial interpretation of each. The $k$-fold generating series correspond to the full ranks of two families of buffered Frobenius representations, which generalize Lovejoy's first and second Frobenius representations of overpartitions, respectively.

math.NT↗