Related papers: Partitions of primes by Chebyshev polynomials
In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
We study a stochastic Hamiltonian system of $N$ particles with many particles interacting through a potential whose range is large in comparison with the typical distance between neighbouring particles. It is shown that the empirical…
Simple divisibility rules are given for the 1st 1000 prime numbers.
We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…
The classical congruences satisfied by the Fibonacci and Lucas sequences are reflected with the decomposition of primes in the ring generated by the gold number. This generalizes to establish a correspondence that we hope will be new…
In these notes, we refine Mitsui's Prime Number Theorem from 1957, which for a number field $K$ predicts how many prime elements there are in bounded convex sets in $K \otimes_{\mathbf Q} \mathbf R$, by incorporating potential Siegel zeros…
The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…
We give sharp lower bounds for the degree of the syzygies involving the partial derivatives of a homogeneous polynomial defining a nodal hypersurface. The result gives information on the position of the singularities of a nodal hypersurface…
Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…
Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…
We study the existence of primes and of primitive divisors in classical divisibility sequences defined over function fields. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…