Search

Motivated by the rich properties and various applications of recurrence relations, we consider the extension of traditional recurrence relations to matrices, where we use matrix multiplication and the Kronecker product to construct matrix sequences. We provide a sharp condition, which when satisfied, guarantees that any fixed-depth matrix recurrence relation defined over a product (with respect to matrix multiplication) will converge to the zero matrix. We also show that the same statement applies to matrix recurrence relations defined over a Kronecker product. Lastly, we show that the dual of this condition, which remains sharp, guarantees the divergence of matrix recurrence relations defined over a consecutive Kronecker product. These results completely determine the stability of nontrivial fixed-depth complex-valued recurrence relations defined over a consecutive product.

Under the generalized Riemann Hypothesis (GRH), Baluyot, Chandee, and Li nearly doubled the range in which the density of low lying zeros predicted by Katz and Sarnak is known to hold for a large family of automorphic $L$-functions with orthogonal symmetry. We generalize their main techniques to the study of higher centered moments of the one-level density of this family, leading to better results on the behavior near the central point. Numerous technical obstructions emerge that are not present in the one-level density. Averaging over the level of the forms and assuming GRH, we prove the density predicted by Katz and Sarnak holds for the $n$-th centered moments for test functions whose Fourier transform is compactly supported in $(-\sigma, \sigma)$ for $\sigma~=~\min\left\{3/2(n-1), 4/(2n-\mathbf{1}_{2\nmid n})\right\}$. For $n=3$, our results improve the previously best known $\sigma=2/3$ to $\sigma=3/4$. We also prove the two-level density agrees with the Katz-Sarnak density conjecture for test functions whose Fourier transform is compactly supported in $\sigma_1 = 3/2$ and $\sigma_2 = 5/6$, respectively, extending the previous best known sum of supports $\sigma_1 + \sigma_2 = 2$. This work is the first evidence of an interesting new phenomenon: by taking different test functions, we are able to extend the range in which the Katz-Sarnak density predictions hold. The techniques we develop can be applied to understanding quantities related to this family containing sums over multiple primes., Comment: 36 pages

Conway Checkers is a game played with a checker placed in each square of the lower half of an infinite checkerboard. Pieces move by jumping over an adjacent checker, removing the checker jumped over. Conway showed that it is not possible to reach row 5 in finitely many moves by weighting each cell in the board by powers of the golden ratio such that no move increases the total weight. Other authors have considered the game played on many different boards, including generalising the standard game to higher dimensions. We work on a board of arbitrary dimension, where we allow a cell to hold multiple checkers and begin with m checkers on each cell. We derive an upper bound and a constructive lower bound on the height that can be reached, such that the upper bound almost never fails to be equal to the lower bound. We also consider the more general case where instead of jumping over 1 checker, each checker moves by jumping over k checkers, and again show the maximum height reachable lies within bounds that are almost always equal., Comment: 17 pages, 7 figures

We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the sum of $N>1$ consecutive Pell numbers is a fixed integer multiple of another Pell number if and only if $4\mid N$. We consider the generalized Pell $(k,i)$-numbers defined by $p(n) :=\ 2p(n-1)+p(n-k-1) $ for $n\geq k+1$, with $p(0)=p(1)=\cdots =p(i)=0$ and $p(i+1)=\cdots = p(k)=1$ for $0\leq i\leq k-1$, and prove that the sum of $N=2k+2$ consecutive terms is a fixed integer multiple of another term in the sequence. We also prove that for the generalized Pell $(k,k-1)$-numbers such a relation does not exist when $N$ and $k$ are odd. We give analogous results for the Fibonacci and other related second-order recursive sequences., Comment: 33 Pages. Comments welcome!

The Katz-Sarnak philosophy states that statistics of zeros of $L$-function families near the central point as the conductors tend to infinity agree with those of eigenvalues of random matrix ensembles as the matrix size tends to infinity. While numerous results support this conjecture, S. J. Miller observed that for finite conductors, very different behavior can occur for zeros near the central point in elliptic curve $L$-function families. This led to the creation of the excised model of Due\~{n}ez, Huynh, Keating, Miller, and Snaith, whose predictions for quadratic twists of a given elliptic curve are well fit by the data. The key ingredients are relating the discretization of central values of the $L$-functions to excising matrices based on the value of the characteristic polynomials at 1 and using lower order terms (in statistics such as the one-level density and pair-correlation) to adjust the matrix size. We extended this model for a family of twists of an $L$-function associated to a given holomorphic cuspidal newform of odd prime level and arbitrary weight. We derive the corresponding "effective" matrix size for a given form by computing the one-level density and pair-correlation statistics for a chosen family of twists, and we show there is no repulsion for forms with weight greater than 2 and principal nebentype. We experimentally verify the accuracy of the model, and as expected, our model recovers the elliptic curve model., Comment: 55 pages, 13 figures. arXiv admin note: substantial text overlap with arXiv:2402.06641

Motivated by the works of Erd\"os, Pomerance, Wolke and Harman on the sum-of-divisor function $\sigma(n)$, we study the distribution of a special class of natural numbers closely related to (multiply) perfect numbers which we term `$(\ell;k)$-within-perfect numbers', where $\ell >1$ is a real number and $k: [1, \infty) \rightarrow (0, \infty)$ is an increasing and unbounded function., Comment: Submitted (13 pp). This article together with arXiv:1610.04253v4 (published in Acta Arithmetica 194 (2020), 341-366) supersede arXiv:1610.04253v2

Assuming the Generalized Riemann Hypothesis, the non-trivial zeros of $L$-functions lie on the critical line with the real part $1/2$. We find an upper bound of the lowest first zero in families of even cuspidal newforms of prime level tending to infinity. We obtain explicit bounds using the $n$-level densities and results towards the Katz-Sarnak density conjecture. We prove that as the level tends to infinity, there is at least one form with a normalized zero within $1/4$ of the average spacing. We also obtain the first-ever bounds on the percentage of forms in these families with a fixed number of zeros within a small distance near the central point., Comment: Version 1.0, 18 pages, 2 figures

Around the year 2007, one of the authors, Tsai, accidentally discovered a property of the number $198$ he saw on the license plate of a car. Namely, if we take $198$ and its reversal $891$, which have prime factorizations $198 = 2\cdot 3^2\cdot 11$ and $891 = 3^4\cdot 11$ respectively, and sum the numbers appearing in each factorization getting $2+3+2+11 = 18$ and $3+4+11 = 18$, both sums are $18$. Such numbers were later named $v$-palindromes because they can be viewed as an analogy to the usual palindromes. In this article, we introduce the concept of a $v$-palindrome in base $b$ and prove their existence for infinitely many bases. We also exhibit infinite families of $v$-palindromes in bases $p+1$ and $p^2+1$, for each odd prime $p$. Finally, we collect some conjectures and problems involving $v$-palindromes., Comment: 22 pages, 2 figures, 1 table. arXiv admin note: substantial text overlap with arXiv:2111.10211

During the Second World War, estimates of the number of tanks deployed by Germany were critically needed. The Allies adopted two methods to estimate this information: espionage and statistical analysis. The latter approach was far more successful and is as follows: assuming that the tanks are sequentially numbered starting from 1, if we observe $k$ serial numbers from an unknown total of $N$ tanks, with the highest observed number being $M$, then the best linear unbiased estimator for $N$ is $M(1+1/k)-1$. This is now known as the German Tank Problem. Suppose one wishes to estimate the productivity of a rival by inspecting captured or destroyed tanks, each with a unique serial number. In many situations, the original German Tank Problem is insufficient, since typically there are $l>1$ factories, and tanks produced by different factories may have serial numbers in disjoint ranges that are often far separated, let alone sequentially numbered starting from 1. We wish to estimate the total tank production across all of the factories. We construct an efficient procedure to estimate the total productivity and prove that our procedure effectively estimates $N$ when $\log l/\log k$ is sufficiently small, and is robust against both large and small gaps between factories. In the final section, we show that given information about the gaps, we can make a far better estimator that is also effective when we have a small number of samples. When the number of samples is small compared to the number of gaps, the Mean Squared Error of this new estimator is several orders of magnitude smaller than the one that assumes no information. This quantifies the importance of hiding such information if one wishes to conceal their productivity from a rival.

We study $|A + A|$ as a random variable, where $A \subseteq \{0, \dots, N\}$ is a random subset such that each $0 \le n \le N$ is included with probability $0 < p < 1$, and where $A + A$ is the set of sums $a + b$ for $a,b$ in $A$. Lazarev, Miller, and O'Bryant studied the distribution of $2N + 1 - |A + A|$, the number of summands not represented in $A + A$ when $p = 1/2$. A recent paper by Chu, King, Luntzlara, Martinez, Miller, Shao, Sun, and Xu generalizes this to all $p\in (0,1)$, calculating the first and second moments of the number of missing summands and establishing exponential upper and lower bounds on the probability of missing exactly $n$ summands, mostly working in the limit of large $N$. We provide exponential bounds on the probability of missing at least $n$ summands, find another expression for the second moment of the number of missing summands, extract its leading-order behavior in the limit of small $p$, and show that the variance grows asymptotically slower than the mean, proving that for small $p$, the number of missing summands is very likely to be near its expected value., Comment: 25 pages, 6 figures

The Katz-Sarnak philosophy states that statistics of zeros of $L$-function families near the central point as the conductors tend to infinity agree with those of eigenvalues of random matrix ensembles as the matrix size tends to infinity. While numerous results support this conjecture, S. J. Miller observed that for finite conductors, very different behavior can occur for zeros near the central point in elliptic curve families. This led to the excised model of Due\~{n}ez, Huynh, Keating, Miller, and Snaith, whose predictions for quadratic twists of a given elliptic curve are beautifully fit by the data. The key ingredients are relating the discretization of central values of the $L$-functions to excising matrices based on the value of the characteristic polynomials at 1 and using lower order terms (in statistics such as the one-level density and pair-correlation) to adjust the matrix size. We discuss recent successes by the authors in extending this model to a family of quadratic twists of finite conductor of a given holomorphic cuspidal newform of level an odd prime level. In particular, we predict very little repulsion for forms with weight greater than 2., Comment: 28 pages, 7 figures

The moments of the coefficients of elliptic curve L-functions are related to numerous arithmetic problems. Rosen and Silverman proved a conjecture of Nagao relating the first moment of one-parameter families satisfying Tate's conjecture to the rank of the corresponding elliptic surface over Q(T); one can also construct families of moderate rank by finding families with large first moments. Michel proved that if j(T) is not constant, then the second moment of the family is of size p^2 + O(p^(3/2)); these two moments show that for suitably small support the behavior of zeros near the central point agree with that of eigenvalues from random matrix ensembles, with the higher moments impacting the rate of convergence. In his thesis, Miller noticed a negative bias in the second moment of every one-parameter family of elliptic curves over the rationals whose second moment had a calculable closed-form expression, specifically the first lower order term which does not average to zero is on average negative. This Bias Conjecture is confirmed for many families; however, these are highly non-generic families whose resulting Legendre sums can be determined. Inspired by the recent successes by Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver, Alexey Pozdnyakov and others in investigations of murmurations of elliptic curve coefficients with machine learning techniques, we pose a similar problem for trying to understand the Bias Conjecture. As a start to this program, we numerically investigate the Bias Conjecture for a family whose bias is positive for half the primes. Since the numerics do not offer conclusive evidence that negative bias for the other half is enough to overwhelm the positive bias, the Bias Conjecture cannot be verified for the family.

Bill James' Pythagorean formula has for decades done an excellent job estimating a baseball team's winning percentage from very little data: if the average runs scored and allowed are denoted respectively by ${\rm RS}$ and ${\rm RA}$, there is some $\gamma$ such that the winning percentage is approximately ${\rm RS}^\gamma / ({\rm RS}^\gamma + {\rm RA}^\gamma)$. One important consequence is to determine the value of different players to the team, as it allows us to estimate how many more wins we would have given a fixed increase in run production. We summarize earlier work on the subject, and extend the earlier theoretical model of Miller (who estimated the run distributions as arising from independent Weibull distributions with the same shape parameter; this has been observed to describe the observed run data well). We now model runs scored and allowed as being drawn from independent Weibull distributions where the shape parameter is not necessarily the same, and then use the Method of Moments to solve a system of four equations in four unknowns. Doing so yields a predicted winning percentage that is consistently better than earlier models over the last 30 MLB seasons (1994 to 2023). This comes at a small cost as we no longer have a closed form expression but must evaluate a two-dimensional integral of two Weibull distributions and numerically estimate the solutions to the system of equations; as these are trivial to do with simple computational programs it is well worth adopting this framework and avoiding the issues of implementing the Method of Least Squares or the Method of Maximum Likelihood.

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove that the number of primes $p\equiv n \pmod m$ less than $x^{k+1}$ is asymptotic to the sum of $k$-th powers of all primes $p\equiv n \pmod m$ up to $x$. We prove that the prime power sum approximation tends to be an underestimate for positive $k$ and an overestimate for negative $k$, and quantify for different values of $k$ how well the approximation works for $x$ between $10^4$ and $10^8.$, Comment: 19 pages, 16 tables

The \textit{order of appearance} $ z(n) $ of a positive integer $ n $ in the Fibonacci sequence is defined as the smallest positive integer $ j $ such that $ n $ divides the $ j $-th Fibonacci number. A \textit{fixed point} arises when, for a positive integer $ n $, we have that the $ n^{\text{th}} $ Fibonacci number is the smallest Fibonacci that $ n $ divides. In other words, $ z(n) = n $. In 2012, Marques proved that fixed points occur only when $ n $ is of the form $ 5^{k} $ or $ 12\cdot5^{k} $ for all non-negative integers $ k $. It immediately follows that there are infinitely many fixed points in the Fibonacci sequence. We prove that there are infinitely many integers that iterate to a fixed point in exactly $ k $ steps. In addition, we construct infinite families of integers that go to each fixed point of the form $12 \cdot 5^{k}$. We conclude by providing an alternate proof that all positive integers $n$ reach a fixed point after a finite number of iterations., Comment: 10 pages, 2 figures

Zeckendorf proved that every natural number $n$ can be expressed uniquely as a sum of non-consecutive Fibonacci numbers, called its Zeckendorf decomposition. Baird-Smith, Epstein, Flint, and Miller created the Zeckendorf game, a two-player game played on partitions of $n$ into Fibonacci numbers which always terminates at a Zeckendorf decomposition, and proved that Player 2 has a winning strategy for $n\geq 3$. Since their proof was non-constructive, other authors have studied the game to find a constructive winning strategy, and lacking success there turned to related problems. For example, Cheigh, Moura, Jeong, Duke, Milgrim, Miller, and Ngamlamai studied minimum and maximum game lengths and randomly played games. We explore a new direction and introduce the reversed Zeckendorf game, which starts at the ending state of the Zeckendorf game and flips all the moves, so the reversed game ends with all pieces in the first bin. We show that Player 1 has a winning strategy for $n = F_{i+1} + F_{i-2}$ and solve various modified games., Comment: 25 Pages, 4 figures

We generalize the study of the sum and difference sets of a subset of $\mathbb{N}$ drawn from a binomial model to the following setting. Given $A \subseteq \{0, 1, \dots, N\}$, an integer $h \geq 2$, and a linear form $L: \mathbb{Z}^h \to \mathbb{Z}$ given by $$L(x_1, \dots, x_h) = u_1x_1 + \cdots + u_hx_h, \quad u_i \in \mathbb{Z}_{\neq 0} \text{ for all } i \in [h],$$ we study the size of $$L(A) = \left\{u_1a_1 + \cdots + u_ha_h : a_i \in A \right\}$$ and its complement $L(A)^c$ when each element of $\{0, 1, \dots, N\}$ is independently included in $A$ with probability $p(N)$. We identify two phase transition phenomena. The first ``global" phase transition concerns the relative sizes of $L(A)$ and $L(A)^c$, with $p(N) = N^{-\frac{h-1}{h}}$ as the threshold. Asymptotically almost surely, it holds below the threshold that almost all sums generated in $L(A)$ are distinct and almost all possible sums are in $L(A)^c$, and above the threshold that almost all possible sums are in $L(A)$. Our asymptotic formulae substantially extend work of Hegarty and Miller and completely settle, with appropriate corrections made to its statement, their conjecture from 2009. The second ``local" phase transition concerns the asymptotic behavior of the number of distinct realizations in $L(A)$ of a given value, with $p(N) = N^{-\frac{h-2}{h-1}}$ as the threshold. Specifically, it identifies (in a sharp sense) when the number of such realizations obeys a Poisson limit. Our main tools are recent results concerning the asymptotic enumeration of partitions and weak compositions, classical theorems on Poisson approximation, and the martingale machinery of Kim and Vu., Comment: 35 pages, no figures

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a nonnegative solution, and the solution is unique. Our first result gives criteria to determine which equation is used for a given pair $(a,b)$. We then use the criteria to study the sequence of equations used by the pair $(a_n/\gcd{(a_n, a_{n+1})}, a_{n+1}/\gcd{(a_n, a_{n+1})})$ from several special sequences $(a_n)_{n\geq 1}$. Finally, fixing $k \in \mathbb{N}$, we investigate the periodicity of the sequence of equations used by the pair $(k/\gcd{(k, n)}, n/\gcd{(k, n)})$ as $n$ increases., Comment: 21 pages, 2 figures

Inspired by the basic stick fragmentation model proposed by Becker et al. in arXiv:1309.5603v4, we consider three new versions of such fragmentation models, namely, continuous with random number of parts, continuous with probabilistic stopping, and discrete with congruence stopping conditions. In all of these situations, we state and prove precise conditions for the ending stick lengths to obey Benford's law when taking the appropriate limits. We introduce the aggregated limit, necessary to guarantee convergence to Benford's law in the latter two models. We also show that resulting stick lengths are non-Benford when our conditions are not met. Moreover, we give a sufficient condition for a distribution to satisfy the Mellin transform condition introduced in arXiv:0805.4226v2, yielding a large family of examples., Comment: 43 pages, 2 figures

In the literature, Benford's Law is considered for base-b expansions where b>1 is an integer. In this paper, we investigate the distribution of leading "digits" of a sequence of positive integers under other expansions such as Zeckendorf expansion, and declare what Benford's Law should be under generalized Zeckendorf expansion.

Nature and our world have a bias! Roughly $30\%$ of the time the number $1$ occurs as the leading digit in many datasets base $10$. This phenomenon is known as Benford's law and it arrises in diverse fields such as the stock market, optimizing computers, street addresses, Fibonacci numbers, and is often used to detect possible fraud. Based on previous work, we know that different forms of a one-dimensional stick fragmentation result in pieces whose lengths follow Benford's Law. We generalize this result and show that this can be extended to any finite-dimensional ``volume''. We further conjecture that even lower-dimensional volumes, under the unrestricted fragmentation process, follow Benford's Law.

Let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field with $q$ elements. For a subset $E\subseteq \mathbb{F}_q^d$ and a fixed nonzero $t\in \mathbb{F}_q$, let $\mathcal{H}_t(E)=\{h_y: y\in E\}$, where $h_y$ is the indicator function of the set $\{x\in E: x\cdot y=t\}$. Two of the authors, with Maxwell Sun, showed in the case $d=3$ that if $|E|\geq Cq^{\frac{11}{4}}$ and $q$ is sufficiently large, then the VC-dimension of $\mathcal{H}_t(E)$ is 3. In this paper, we generalize the result to arbitrary dimension and improve the exponent in the case $d=3$., Comment: 9 pages, 1 figure

An integer $n\geq 1$ is a $v$-palindrome if it is not a multiple of $10$, nor a decimal palindrome, and such that the sum of the prime factors and corresponding exponents larger than $1$ in the prime factorization of $n$ is equal to that of the integer formed by reversing the decimal digits of $n$. For example, if we take 198 and its reversal 891, their prime factorizations are $198 = 2\cdot 3^2\cdot 11$ and $891 = 3^4\cdot 11$ respectively, and summing the numbers appearing in each factorization both give 18. This means that $198$ and $891$ are $v$-palindromes. We establish a characterization of prime $v$-palindromes: they are precisely the larger of twin prime pairs of the form $(5 \cdot 10^m - 3, 5 \cdot 10^m - 1)$, and thus standard conjectures on the distribution of twin primes imply that there are only finitely many prime $v$-palindromes., Comment: 16 pages

The Katz-Sarnak philosophy predicts that the behavior of zeros near the central point in families of $L$-functions agrees with that of eigenvalues near 1 of random matrix ensembles. Under GRH, Iwaniec, Luo and Sarnak showed agreement in the one-level densities for cuspidal newforms with the support of the Fourier transform of the test function in $(-2, 2)$. They increased the support further under a square-root cancellation conjecture, showing that a ${\rm GL}(1)$ estimate led to additional agreement between number theory and random matrix theory. We formulate a two-dimensional analog and show it leads to improvements in the two-level density. Specifically, we show that a square-root cancellation of certain classical exponential sums over primes increases the support of the test functions such that the main terms in the $1$- and $2$-level densities of cuspidal newforms averaged over bounded weight $k$ (and fixed level $1$) converge to their random matrix theory predictions. We also conjecture a broad class of such exponential sums where we expect improvement in the case of arbitrary $n$-level densities, and note that the arguments in [ILS] yield larger support than claimed., Comment: 14 pages, to be submitted to Acta Arithmetica

We make progress on a conjecture made by [DM], which states that the $d$-dimensional frames of $m$-dimensional boxes resulting from a fragmentation process satisfy Benford's law for all $1 \leq d \leq m$. We provide a sufficient condition for Benford's law to be satisfied, namely that the maximum product of $d$ sides is itself a Benford random variable. Motivated to produce an example of such a fragmentation process, we show that processes constructed from log-uniform proportion cuts satisfy the maximum criterion for $d=1$., Comment: 13 pages, 3 figures, to be submitted to the Journal of Statistical Theory and Practice

Inspired by the surprising relationship (due to A. Bird) between Schreier sets and the Fibonacci sequence, we introduce Schreier multisets and connect these multisets with the $s$-step Fibonacci sequences, defined, for each $s\geqslant 2$, as: $F^{(s)}_{2-s} = \cdots = F^{(s)}_0 = 0$, $F^{(s)}_1 = 1$, and $F^{(s)}_{n} = F^{(s)}_{n-1} + \cdots + F^{(s)}_{n-s}, \mbox{ for } n\geqslant 2$. Next, we use Schreier-type conditions on multisets to retrieve a family of sequences which satisfy a recurrence of the form $a(n) = a(n-1) + a(n-u)$, with $a(n) = 1$ for $n = 1,\ldots, u$. Finally, we study nonlinear Schreier conditions and show that these conditions are related to integer decompositions, each part of which is greater than the number of parts raised to some power., Comment: 11 pages. To appear in Proceedings of the Integers Conference 2023

For a positive integer $d$, let $p_d(n) := 0^d + 1^d + 2^d + \cdots + n^d$; i.e., $p_d(n)$ is the sum of the first $d^{\mathrm{th}}$-powers up to $n$. It's well known that $p_d(n)$ is a polynomial of degree $d+1$ in $n$. While this is usually proved by induction, once $d$ is not small it's a challenge as one needs to know the polynomial for the inductive step. We show how this difficulty can be bypassed by giving a simple proof that $p_d(n)$ is a polynomial of degree $d+1$ in $n$ by using L'Hopital's rule, and show how we can then determine the coefficients by Cramer's rule. This illustrates a general principle and the point of our paper: there's more than one path to a goal, different approaches have their advantages and disadvantages, and the more techniques one knows, the more likely one can successfully attack a problem.

Becker, Greaves-Tunnell, Kontorovich, Miller, Ravikumar, and Shen determined the long term evolution of virus propagation behavior on a hub-and-spoke graph of one central node and $n$ neighbors, with edges only from the neighbors to the hub (a $2$-level starlike graph), under a variant of the discrete-time SIS (Suspectible Infected Suspectible) model. The behavior of this model is governed by the interactions between the infection and cure probabilities, along with the number $n$ of $2$-level nodes. They proved that for any $n$, there is a critical threshold relating these rates, below which the virus dies out, and above which the probabilistic dynamical system converges to a non-trivial steady state (the probability of infection for each category of node stabilizes). For $a$, the probability at any time step that an infected node is not cured, and $b$, the probability at any time step that an infected node infects its neighbors, the threshold for the virus to die out is $b \leq (1-a)/\sqrt{n}$. We extend this analysis to $k$-level starlike graphs for $k \geq 3$ (each $(k-1)$-level node has exactly $n_k$ neighbors, and the only edges added are from the $k$-level nodes) for infection rates above and below the critical threshold of $(1-a)/\sqrt{n_1+n_2+\dots+n_{k-1}}$. We do this by first analyzing the dynamics of nodes on each level of a $3$-level starlike graph, then show that the dynamics of the nodes of a $k$-level starlike graph are similar, enabling us to reduce our analysis to just $3$ levels, using the same methodology as the $3$-level case., Comment: Version 1.2: Adjusted title

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers (numbers $n$ such that the sum of the integers less than $n$ equals the sum of the $r$ integers immediately after, for some $r$ which is called the balancer of $n$; If $n$ is included in the summation, we have the cobalancing numbers, and $r$ is called the cobalancer of $n$). We generalize previous work to reciprocal sums of depth two recurrence sequences with arbitrary coefficients and the Tribonacci numbers, and show our method provides an alternative proof of some existing results. We define $(a,b)$ balancing and cobalancing numbers, where $a$ and $b$ are constants that multiply the left-hand side and right-hand side respectively, and derive recurrence relations describing these sequences. We show that for balancing numbers, the coefficients $(3,1)$ is unique such that every integer is a $(3,1)$ balancing number, and proved there does not exist an analogous set of coefficients for cobalancing numbers. We also found patterns for certain coefficients that have no balancing or cobalancing numbers., Comment: 31 pages, 2 figures, 3 tables

Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result holds for other positive linear recurrence sequences. These legal decompositions can be used to construct a game that starts with a fixed integer $n$, and players take turns using moves relating to a given recurrence relation. The game eventually terminates in a unique legal decomposition, and the player who makes the final move wins. For the Fibonacci game, Player $2$ has the winning strategy for all $n>2$. We give a non-constructive proof that for the two-player $(c, k)$-nacci game, for all $k$ and sufficiently large $n$, Player $1$ has a winning strategy when $c$ is even and Player $2$ has a winning strategy when $c$ is odd. Interestingly, the player with the winning strategy can make a mistake as early as the $c + 1$ turn, in which case the other player gains the winning strategy. Furthermore, we proved that for the $(c, k)$-nacci game with players $p \ge c + 2$, no player has a winning strategy for any $n \ge 3c^2 + 6c + 3$. We find a stricter lower boundary, $n \ge 7$, in the case of the three-player $(1, 2)$-nacci game. Then we extend the result from the multiplayer game to multialliance games, showing which alliance has a winning strategy or when no winning strategy exists for some special cases of multialliance games., Comment: 24 pages, 8 figures

Building on the work of Iwaniec, Luo and Sarnak, we use the $n$-level density to bound the probability of vanishing to order at least $r$ at the central point for families of cuspidal newforms of prime level $N \to \infty$, split by sign. There are three methods to improve bounds on the order of vanishing: optimizing the test functions, increasing the support, and increasing the $n$-level density studied. Previous work determined the optimal test functions for the $1$ and $2$-level densities in certain support ranges, leading to marginal improvements in bounds and making it not a productive avenue for further research. Similarly the support has been increased as far as possible, and further progress is shown to be related to delicate and difficult conjectures in number theory. Thus we concentrate on the third method, and study the higher centered moments (which are similar to the $n$-level densities but combinatorially easier). We find the level at each rank for which the bounds on the order of vanishing is the best, thus producing world-record bounds on the order of vanishing to rank at least $r$ for every $r > 2$ (for example, our bounds for vanishing to order at least 5 or at least 6 are less than half the previous bounds, a significant improvement). Additionally, we explicitly calculate the optimal test function for the $1$-level density from previous work and compare it to the naive test functions for higher levels. In doing so, we find that the optimal test function for certain levels are not the optimal for other levels, and some test functions may outperform others for some levels but not in others. Finally, we explicitly calculate the integrals needed to determine the bounds, doing so by transforming an $n$-dimensional integral to a $1$-dimensional integral and greatly reducing the computation cost in the process.

The German Tank Problem dates back to World War II when the Allies used a statistical approach to estimate the number of enemy tanks produced or on the field from observed serial numbers after battles. Assuming that the tanks are labeled consecutively starting from 1, if we observe $k$ tanks from a total of $N$ tanks with the maximum observed tank being $m$, then the best estimate for $N$ is $m(1 + 1/k) - 1$. We explore many generalizations. We looked at the discrete and continuous one dimensional case. We explored different estimators such as the $L$\textsuperscript{th} largest tank, and applied motivation from portfolio theory and studied a weighted average; however, the original formula was the best. We generalized the problem in two dimensions, with pairs instead of points, studying the discrete and continuous square and circle variants. There were complications from curvature issues and that not every number is representable as a sum of two squares. We often concentrated on the large $N$ limit. For the discrete and continuous square, we tested various statistics, finding the largest observed component did best; the scaling factor for both cases is $(2k+1)/2k$. The discrete case was especially involved because we had to use approximation formulas that gave us the number of lattice points inside the circle. Interestingly, the scaling factors were different for the cases. Lastly, we generalized the problem into $L$ dimensional squares and circles. The discrete and continuous square proved similar to the two dimensional square problem. However, for the $L$\textsuperscript{th} dimensional circle, we had to use formulas for the volume of the $L$-ball, and had to approximate the number of lattice points inside it. The formulas for the discrete circle were particularly interesting, as there was no $L$ dependence in the formula., Comment: Version 1.0, 47 pages

Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by $F_1 = 1, F_2 = 2, F_{n+1} = F_n + F_{n-1}$. Motivated by this result, Baird, Epstein, Flint, and Miller defined the two-player Zeckendorf game, where two players take turns acting on a multiset of Fibonacci numbers that always sums to $N$. The game terminates when no possible moves remain, and the final player to perform a move wins. Notably, studied the setting of random games: the game proceeds by choosing an available move uniformly at random, and they conjecture that as the input $N \to \infty$, the distribution of random game lengths converges to a Gaussian. We prove that certain sums of move counts is constant, and find a lower bound on the number of shortest games on input $N$ involving the Catalan numbers. The works Baird et al. and Cuzensa et al. determined how to achieve a shortest and longest possible Zeckendorf game on a given input $N$, respectively: we establish that for any input $N$, the range of possible game lengths constitutes an interval of natural numbers: every game length between the shortest and longest game lengths can be achieved. We further the study of probabilistic aspects of random Zeckendorf games. We study two probability measures on the space of all Zeckendorf games on input $N$: the uniform measure, and the measure induced by choosing moves uniformly at random at any given position. Under both measures that in the limit $N \to \infty$, both players win with probability $1/2$. We also find natural partitions of the collection of all Zeckendorf games of a fixed input $N$, on which we observe weak convergence to a Gaussian in the limit $N \to \infty$. We conclude the work with many open problems., Comment: 29 pages

Zeckendorf's Theorem implies that the Fibonacci number $F_n$ is the smallest positive integer that cannot be written as a sum of non-consecutive previous Fibonacci numbers. Catral et al. studied a variation of the Fibonacci sequence, the Fibonacci Quilt sequence: the plane is tiled using the Fibonacci spiral, and integers are assigned to the squares of the spiral such that each square contains the smallest positive integer that cannot be expressed as the sum of non-adjacent previous terms. This adjacency is essentially captured in the differences of the indices of each square: the $i$-th and $j$-th squares are adjacent if and only if $|i - j| \in \{1, 3, 4\}$ or $\{i, j\} = \{1, 3\}$. We consider a generalization of this construction: given a set of positive integers $S$, the $S$-legal index difference ($S$-LID) sequence $(a_n)_{n=1}^\infty$ is defined by letting $a_n$ to be the smallest positive integer that cannot be written as $\sum_{\ell \in L} a_\ell$ for some set $L \subset [n-1]$ with $|i - j| \notin S$ for all $i, j \in L$. We discuss our results governing the growth of $S$-LID sequences, as well as results proving that many families of sets $S$ yield $S$-LID sequences which follow simple recurrence relations., Comment: 18 pages, 4 figures

Given a domain $X$ and a collection $\mathcal{H}$ of functions $h:X\to \{0,1\}$, the Vapnik-Chervonenkis (VC) dimension of $\mathcal{H}$ measures its complexity in an appropriate sense. In particular, the fundamental theorem of statistical learning says that a hypothesis class with finite VC-dimension is PAC learnable. Recent work by Fitzpatrick, Wyman, the fourth and seventh named authors studied the VC-dimension of a natural family of functions $\mathcal{H}_t^{'2}(E): \mathbb{F}_q^2\to \{0,1\}$, corresponding to indicator functions of circles centered at points in a subset $E\subseteq \mathbb{F}_q^2$. They showed that when $|E|$ is large enough, the VC-dimension of $\mathcal{H}_t^{'2}(E)$ is the same as in the case that $E = \mathbb F_q^2$. We study a related hypothesis class, $\mathcal{H}_t^d(E)$, corresponding to intersections of spheres in $\mathbb{F}_q^d$, and ask how large $E\subseteq \mathbb{F}_q^d$ needs to be to ensure the maximum possible VC-dimension. We resolve this problem in all dimensions, proving that whenever $|E|\geq C_dq^{d-1/(d-1)}$ for $d\geq 3$, the VC-dimension of $\mathcal{H}_t^d(E)$ is as large as possible. We get a slightly stronger result if $d=3$: this result holds as long as $|E|\geq C_3 q^{7/3}$. Furthermore, when $d=2$ the result holds when $|E|\geq C_2 q^{7/4}$., Comment: 12 pages, 1 figure

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent interest has been to understand the frequencies of these type of subsets. The seventh author and Vissuet studied the problem for arbitrary finite groups $G$ and proved that almost all subsets $A\subseteq G$ are sum-difference balanced as $|G|\to\infty$. For the dihedral group $D_{2n}$, they conjectured that of the remaining sets, most are MSTD, i.e., there are more MSTD sets than MDTS sets. Some progress on this conjecture was made by Haviland et al. in 2020, when they introduced the idea of partitioning the subsets by size: if, for each $m$, there are more MSTD subsets of $D_{2n}$ of size $m$ than MDTS subsets of size $m$, then the conjecture follows. We extend the conjecture to generalized dihedral groups $D=\mathbb{Z}_2\ltimes G$, where $G$ is an abelian group of size $n$ and the nonidentity element of $\mathbb{Z}_2$ acts by inversion. We make further progress on the conjecture by considering subsets with a fixed number of rotations and reflections. By bounding the expected number of overlapping sums, we show that the collection $\mathcal S_{D,m}$ of subsets of the generalized dihedral group $D$ of size $m$ has more MSTD sets than MDTS sets when $6\le m\le c_j\sqrt{n}$ for $c_j=1.3229/\sqrt{111+5j}$, where $j$ is the number of elements in $G$ with order at most $2$. We also analyze the expectation for $|A+A|$ and $|A-A|$ for $A\subseteq D_{2n}$, proving an explicit formula for $|A-A|$ when $n$ is prime., Comment: 22 pages, 1 figure

For each positive integer $N$, define $$S'_N \ =\ \{1 < d < \sqrt{N}: d|N\}\mbox{ and }L'_N \ =\ \{\sqrt{N} < d < N : d|N\}.$$ Recently, Chentouf characterized all positive integers $N$ such that the set of small divisors $\{d\le \sqrt{N}: d|N\}$ satisfies a linear recurrence of order at most two. We nontrivially extend the result by excluding the trivial divisor $1$ from consideration, which dramatically increases the analysis complexity. Our first result characterizes all positive integers $N$ such that $S'_N$ satisfies a linear recurrence of order at most two. Moreover, our second result characterizes all positive $N$ such that $L'_N$ satisfies a linear recurrence of order at most two, thus extending considerably a recent result that characterizes $N$ with $L'_N$ being in an arithmetic progression.

In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored along with many variants, including ones that extend it into higher dimensions. Less studied but no less intriguing is Erd\H{o}s' distinct angle problem, which seeks to find point configurations in the plane that minimize the number of distinct angles. In their recent paper "Distinct Angles in General Position," Fleischmann, Konyagin, Miller, Palsson, Pesikoff, and Wolf use a logarithmic spiral to establish an upper bound of $O(n^2)$ on the minimum number of distinct angles in the plane in general position, which prohibits three points on any line or four on any circle. We consider the question of distinct angles in three dimensions and provide bounds on the minimum number of distinct angles in general position in this setting. We focus on pinned variants of the question, and we examine explicit constructions of point configurations in $\mathbb{R}^3$ which use self-similarity to minimize the number of distinct angles. Furthermore, we study a variant of the distinct angles question regarding distinct angle chains and provide bounds on the minimum number of distinct chains in $\mathbb{R}^2$ and $\mathbb{R}^3$., Comment: 16 pages, 7 figures

We study low-lying zeroes of $L$-functions and their $n$-level density, which relies on a smooth test function $\phi$ whose Fourier transform $\widehat\phi$ has compact support. Assuming the generalized Riemann hypothesis, we compute the $n^\text{th}$ centered moments of the $1$-level density of low-lying zeroes of $L$-functions associated with weight $k$, prime level $N$ cuspidal newforms as $N \to \infty$, where ${\rm supp}(\widehat\phi) \subset \left(-2/n, 2/n\right)$. The Katz-Sarnak density conjecture predicts that the $n$-level density of certain families of $L$-functions is the same as the distribution of eigenvalues of corresponding families of orthogonal random matrices. We prove that the Katz-Sarnak density conjecture holds for the $n^\text{th}$ centered moments of the 1-level density for test functions with $\widehat{\phi}$ supported in $\left(-2/n, 2/n\right)$, for families of cuspidal newforms split by the sign of their functional equations. Our work provides better bounds on the percent of forms vanishing to a certain order at the central point. Previous work handled the 1-level for support up to 2 and the $n$-level up to $\min(2/n, 1/(n-1))$; we are able to remove the second restriction on the support and extend the result to what one would expect, based on the 1-level, by finding a tractable vantage to evaluate the combinatorial zoo of terms which emerge., Comment: 57 pages, updated acknowledgements

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the plane. Recent work has introduced bounds on a wide array of variants of this problem, inspired by similar variants in the distance setting. In this short note, we improve the best known upper bound for the minimum number of distinct angles formed by $n$ points in general position from $O(n^{\log_2(7)})$ to $O(n^2)$. Before this work, similar bounds relied on projections onto a generic plane from higher dimensional space. In this paper, we employ the geometric properties of a logarithmic spiral, sidestepping the need for a projection. We also apply this configuration to reduce the upper bound on the largest integer such that any set of $n$ points in general position has a subset of that size with all distinct angles. This bound is decreased from $O(n^{\log_2(7)/3})$ to $O(n^{1/2})$., Comment: Former Corollary 4.1 upgraded to Theorem 1.2 with improved bounds

We investigate Benford's law in relation to fractal geometry. Basic fractals, such as the Cantor set and Sierpinski triangle are obtained as the limit of iterative sets, and the unique measures of their components follow a geometric distribution, which is Benford in most bases. Building on this intuition, we aim to study this distribution in more complicated fractals. We examine the Laurent coefficients of a Riemann mapping and the Taylor coefficients of its reciprocal function from the exterior of the Mandelbrot set to the complement of the unit disk. These coefficients are 2-adic rational numbers, and through statistical testing, we demonstrate that the numerators and denominators are a good fit for Benford's law. We offer additional conjectures and observations about these coefficients. In particular, we highlight certain arithmetic subsequences related to the coefficients' denominators, provide an estimate for their slope, and describe efficient methods to compute them., Comment: Updated to fix typographical errors and improve readability. Updated graphs and explanations to make them more concise and readable, and reworded interpretations of testing to make them more appropriate. Results remain unchanged from the version submitted to Fractal and Fractional for publication

An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the Fibonacci sequence. We prove that all walks starting with a Fibonacci number and the following terms are Fibonacci numbers obtained by appending exactly one digit at a time to the right have a length of at most two. In the more general case where we append at most a bounded number of digits each time, we give a formula for the length of the longest walk., Comment: arXiv admin note: substantial text overlap with arXiv:2010.14932

Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves, for the first we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group of rational solutions. Recently, Yekutieli discussed a connection between these two problems, and described the group structure of Pythagorean triples and the number of triples for a given hypotenuse. In arXiv:2112.03663 we generalized these methods and results to Pell's equation. We find a similar group structure and count on the number of solutions for a given $z$ to $x^2 + Dy^2 = z^2$ when $D$ is 1 or 2 modulo 4 and the class group of $\mathbb{Q}[\sqrt{-D}]$ is a free $\mathbb{Z}_2$ module, which always happens if the class number is at most 2. In this paper, we discuss the main results of arXiv:2112.03663 using some concrete examples in the case of $D=105$., Comment: 15 pages, 5 tables

The Katz-Sarnak Density Conjecture states that zeros of families of $L$-functions are well-modeled by eigenvalues of random matrix ensembles. For suitably restricted test functions, this correspondence yields upper bounds for the families' order of vanishing at the central point. We generalize previous results on the $n$\textsuperscript{th} centered moment of the distribution of zeros to allow arbitrary test functions. On the computational side, we use our improved formulas to obtain significantly better bounds on the order of vanishing for cuspidal newforms, setting world records for the quality of the bounds. We also discover better test functions that further optimize our bounds. We see improvement as early as the $5$\textsuperscript{th} order, and our bounds improve rapidly as the rank grows (more than one order of magnitude better for rank 10 and more than four orders of magnitude for rank 50)., Comment: 23 pages, version 2.0

The generalized gamma distribution shows up in many problems related to engineering, hydrology as well as survival analysis. Earlier work has been done that estimated the deviation of the exponential and the Weibull distribution from Benford's Law. We give a mathematical explanation for the Benfordness of the generalized gamma distribution and present a measure for the deviation of the generalized gamma distribution from the Benford distribution.

In this paper, we define a $k$-Diophantine $m$-tuple to be a set of $m$ positive integers such that the product of any $k$ distinct positive integers is one less than a perfect square. We study these sets in finite fields $\mathbb{F}_p$ for odd prime $p$ and guarantee the existence of a $k$-Diophantine m-tuple provided $p$ is larger than some explicit lower bound. We also give a formula for the number of 3-Diophantine triples in $\mathbb{F}_p$ as well as an asymptotic formula for the number of $k$-Diophantine $k$-tuples., Comment: 18 pages with 2 figure and 2 tables; comments welcome

Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves; for the first, we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group of rational solutions. Recently Yekutieli discussed a connection between these two problems and described the group structure of Pythagorean triples and the number of triples for a given hypotenuse. We generalize these methods and results to Pell's equation. We find a similar group structure and count on the number of solutions for a given $z$ to $x^2 + Dy^2 = z^2$ when $D$ is 1 or 2 modulo 4 and the class group of $\mathbb{Q}[\sqrt{-D}]$ is a free $\mathbb{Z}_2$ module, which always happens if the class number is at most 2. We give examples of when the results hold for a class number greater than 2, as well as an example with different behavior when the class group does not have this structure., Comment: 13 pages, 1 figure

A decade ago, when teaching complex analysis, the third named author posed the question on whether or not there is an analogue to the Schwarz lemma for real analytic functions. This led to the note [MT], indicating that it is possible to have a real analytic automorphism $f$ of $(-1,1)$ with $f'(0)$ arbitrarily large. In this note we provide other families with this property, and moreover show that we can always find such a function so that $f'(0)$ equals any desired real number. We end with some questions on related problems., Comment: 6 pages, 5 figures