English
Related papers

Related papers: Legendre-signed partition numbers

200 papers

We study the asymptotical behavior of the $p$-adic singular Fourier integrals $$ J_{\pi_{\alpha},m;\phi}(t) =\bigl< f_{\pi_{\alpha};m}(x)\chi_p(xt), \phi(x)\bigr> =F\big[f_{\pi_{\alpha};m}\phi\big](t), \quad |t|_p \to \infty, \quad t\in…

Mathematical Physics · Physics 2008-08-26 A. Yu. Khrennikov , V. M. Shelkovich

Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…

Number Theory · Mathematics 2024-12-24 Steven Charlton

Let $\mathcal{C}_n =\left [\chi_{\lambda}(\mu)\right]_{\lambda, \mu}$ be the character table for $S_n,$ where the indices $\lambda$ and $\mu$ run over the $p(n)$ many integer partitions of $n.$ In this note we study $Z_{\ell}(n),$ the…

Number Theory · Mathematics 2023-06-01 Eleanor McSpirit , Ken Ono

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Combinatorics · Mathematics 2026-02-13 William Craig , Madeline Locus Dawsey , Guo-Niu Han

Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-11-04 Liuquan Wang

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

Combinatorics · Mathematics 2010-06-29 William Y. C. Chen , Kathy Q. Ji , Albert J. W. Zhu

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

Number Theory · Mathematics 2023-10-02 Xiaotian Li , Wenguang Zhai , Jinjiang Li

Let $p>3$ be a prime. We investigate Legendre symbol of $\displaystyle \prod_{0<i<j<p/2 \atop p\nmid f(i,j) } f(i,j) \ $, where $i,j\in \Bbb Z, f(i,j)$ is a linear or quadratic form with integer coefficients. When $f=ai^2+bij+cj^2$ and…

Number Theory · Mathematics 2020-08-25 Chao Huang

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

Number Theory · Mathematics 2021-02-16 Kota Saito , Yuuya Yoshida

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

Number Theory · Mathematics 2020-12-15 Zhi-Wei Sun

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions:…

Number Theory · Mathematics 2025-11-06 Alex Jin , Shreyas Singh , Zhuo Zhang , AJ Hildebrand

We prove an asymptotic formula for primes of the shape $f(a,b^2)$ with $a,b$ integers and of the shape $f(a,p^2)$ with $p$ prime. Here $f$ is a binary quadratic form with integer coefficients, irreducible over $\mathbb{Q}$ and has no local…

Number Theory · Mathematics 2024-09-25 Stanley Yao Xiao

We study paths in the p-Bratteli diagram associated with hook partitions, where p is an odd prime. By comparing blocks along a path, we define inversions and descents. We prove that the sign balance derived from inversions vanishes at every…

Combinatorics · Mathematics 2026-03-05 M. Parvathi , A. Tamilselvi , D. Hepsi

For a fixed prime $p$, let $e_p(n!)$ denote the order of $p$ in the prime factorization of $n!$. Chen and Liu (2007) asked whether for any fixed $m$, one has $\{e_p(n^2!) \bmod m:\; n\in\mathbb{Z}\}=\mathbb{Z}_m$ and $\{e_p(q!) \bmod m:\; q…

Number Theory · Mathematics 2011-10-24 Johannes F. Morgenbesser , T. Stoll

Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We show that $\mid\Sigma_{2n}\mid\sim 2n^2/\log^2{n}$ as $n\to\infty$. We also assume that a partition is…

Number Theory · Mathematics 2015-01-13 Ljuben Mutafchiev

Let $f$ be a real-valued function of a single variable such that it is positive over the primes. In this article, we construct a factorial, $n!_f$, associated to $f$, called the associated Legendre formula, or $f$-factorial, and show,…

Number Theory · Mathematics 2021-08-12 Maiyu Diaz

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Combinatorics · Mathematics 2007-11-12 Robert P. Boyer , William M. Y. Goh

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

Number Theory · Mathematics 2007-05-23 Gert Almkvist

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…

Cryptography and Security · Computer Science 2019-01-30 Zhixiong Chen , Qiuyan Wang

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire
‹ Prev 1 3 4 5 6 7 10 Next ›