Related papers: Central Limit Theorems for Gaps of Generalized Zec…

For each positive integer $n$, function $f$, and point $c$, the GGR Theorem states that $f$ is $n$ times Peano differentiable at $c$ if and only if $f$ is $n-1$ times Peano differentiable at $c$ and the following $n$-th generalized…

Motivated by Erd\H{o}s' ternary conjecture and by recent work of Cui--Ma--Jiang [``Geometric progressions meet Cantor sets'', \textit{Chaos Solitons Fractals} \textbf{163} (2022), 112567.] on intersections between geometric progressions and…

The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…

In arXiv:1603.03910 [math.NT] we introduced some $C_{n}$ in $Z/2[t]$ defined by a linear recurrence and showed that each $C_{n}$, $n\equiv 0 \bmod{4}$, is a sum of $C_{k}$, $k<n$. Combining this with results from arXiv:1508.07523 [math.NT]…

For integer partitions $\lambda :n=a_1+...+a_k$, where $a_1\ge a_2\ge >...\ge a_k\ge 1$, we study the sum $a_1+a_3+...$ of the parts of odd index. We show that the average of this sum, over all partitions $\lambda$ of $n$, is of the form…

Classical works of Kac, Salem and Zygmund, and Erd\H{o}s and G\'{a}l have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Carath\'eodory showed that $n$ complex numbers $c_1,...,c_n$ can uniquely be written in the form $c_p=\sum_{j=1}^m \rho_j {\epsilon_j}^p$ with $p=1,...,n$, where the $\epsilon_j$s are different unimodular complex numbers, the $\rho_j$s are…

We consider a set of generators for the space of Eisenstein series of even weight $k$ for any congruence group $\Gamma$ and study the set of all of their zeros taken for $\Gamma(1)$-conjugates of $\Gamma$ in the standard fundamental domain…

For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = {1,2,...,n}. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the…

For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…

Given a connected semisimple Lie group $G$ and an arithmetic subgroup $\Gamma$, it is well-known that each irreducible representation $\pi$ of $G$ occurs in the discrete spectrum $L^2_{\text{disc}}(\Gamma\backslash G)$ of…

We present a unified approach to extensions of Bourgain's Double Recurrence Theorem and Bourgain's Return Times Theorem to integer parts of the Kronecker sequence, emphasizing stopping times and metric entropy. Specifically, we prove the…

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

We consider the adjacency matrix $A$ of a large random graph and study fluctuations of the function $f_n(z,u)=\frac{1}{n}\sum_{k=1}^n\exp\{-uG_{kk}(z)\}$ with $G(z)=(z-iA)^{-1}$. We prove that the moments of fluctuations normalized by…

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

Fourier-Dedekind sums are a generalization of Dedekind sums - important number-theoretical objects that arise in many areas of mathematics, including lattice point enumeration, signature defects of manifolds and pseudo random number…