English
Related papers

Related papers: Random ordering in modulus of consecutive Hecke ei…

200 papers

For each of the functions $f \in \{\phi, \sigma, \omega, \tau\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for…

Number Theory · Mathematics 2014-08-07 Paul Pollack , Lola Thompson

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Number Theory · Mathematics 2013-04-18 Zhi-Wei Sun

First we introduce the two tau-functions which appeared either as the $\tau$-function of the integrable hierarchy governing the Riemann mapping of Jordan curves or in conformal field theory and the universal Grassmannian. Then we discuss…

Mathematical Physics · Physics 2019-03-18 Takafumi Amaba , Roland Friedrich

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee

Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…

Dynamical Systems · Mathematics 2024-05-07 Tomas Persson

The famous Rogers-Ramanujan and Andrews--Gordon identities are embedded in a doubly-infinite family of Rogers-Ramanujan-type identities labelled by positive integers m and n. For fixed m and n the product side corresponds to a specialised…

Combinatorics · Mathematics 2013-11-06 S. Ole Warnaar

We present examples of Maass forms on Hecke congruence groups, giving low eigenvalues on $\Gamma_0(p)$ for small prime $p$, and the first 1000 eigenvalues for $\Gamma_0(11)$. We also present calculations of the $L$-functions associated to…

Number Theory · Mathematics 2007-05-23 David W. Farmer , Stefan Lemurell

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

General Mathematics · Mathematics 2018-02-08 Richard Williamson

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

Logic in Computer Science · Computer Science 2008-08-06 Paul Tarau

Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…

Number Theory · Mathematics 2018-12-21 Trevor Wine

We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish…

Number Theory · Mathematics 2016-02-16 Christian Elsholtz , Niclas Technau , Robert Tichy

A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations,…

Combinatorics · Mathematics 2010-01-23 Einar Steingrimsson , Bridget Eileen Tenner

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

Let $f$ and $g$ be two Hecke-Maass cusp forms of weight zero for $SL_2(\mathbb Z)$ with Laplacian eigenvalues $\frac{1}{4}+u^2$ and $\frac{1}{4}+v^2$, respectively. Then both have real Fourier coefficients say, $\lambda_f(n)$ and…

Number Theory · Mathematics 2020-03-17 Moni Kumari , Jyoti Sengupta

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

Number Theory · Mathematics 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

This note shows that the prime values of the Ramanujan tau function $\tau(n)=\pm p$ misses every prime $p\leq 8.0\times 10^{25}$.

Number Theory · Mathematics 2025-07-25 N. A. Carella

Let m be a fixed positive integer. It is well-known that a permutation $\sigma$ may have one, many, or no mth roots. In this note we provide an explicit expression and a generating function for the number of mth roots of \sigma. Let p_m(n)…

Combinatorics · Mathematics 2012-01-26 Jesús Leaños , Rutilo Moreno , Luis Manuel Rivera-Martínez

Let $\phi = \sum_{r^{2} \leq 4mn}c(n,r)q^{n}\zeta^{r}$ be a Jacobi form of weight $k$ (with $k > 2$ if $\phi$ is not a cusp form) and index $m$ with integral algebraic coefficients which is an eigenfunction of all Hecke operators $T_{p},…

Number Theory · Mathematics 2020-10-14 Markus Schwagenscheidt

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Combinatorics · Mathematics 2018-11-21 Kedar Karhadkar

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

Number Theory · Mathematics 2025-09-17 Anay Aggarwal