Searcharxiv⌕ Search

arXiv subjects

Cristian-Silviu Radu

Publications and source records attributed to Cristian-Silviu Radu.

7 recordsLinked to original sources

Asymptotics for the reciprocal and shifted quotient of the partition function

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition function, namely $p(n+k)/p(n)$ with $k\in \mathbb{N}$, which generalizes a result of Gomez, Males, and Rolen. In order to do so, we derive asymptotic expansions with error bounds for the shifted version $p(n+k)$ and the multiplicative inverse $1/p(n)$, which is of independent interest.

math.NT↗

Parity of 3-regular partition numbers and Diophantine equations

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime } : \exists \, j\in \{1,4,8\},\, x, y \in \mathbb Z,\, \gcd(x,y)=1 \text { with } x^2+216y^2=jp\}$ whose Dirichlet density is $1/6$. As a key ingredient in our proof we show that of the number of primitive solutions for $x^2+216y^2=pm$, $p \in \mathcal P$, $p\nmid m$ and $pm\equiv 1\pmod{24}$, is divisible by $8$. Here, the difficulty arises from the fact that $216$ is not idoneal. We also give a conjectural exact formula for the number of solutions for this Diophantine equation. In the second part of the article, we study reversals of Euler-type identities. These are motivated by recent work of the second author on a reversal of Schur's identity which involves $3$-regular partitions weighted by the parity of their length.

math.NT↗

Error bounds for the asymptotic expansion of the partition function

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion for $p(n)$ with an explicit error bound is not known. Recently O'Sullivan studied the asymptotic expansion of $p^{k}(n)$-partitions into $k$th powers, initiated by Wright, and consequently obtained an asymptotic expansion for $p(n)$ along with a concise description of the coefficients involved in the expansion but without any estimation of the error term. Here we consider a detailed and comprehensive analysis on an estimation of the error term obtained by truncating the asymptotic expansion for $p(n)$ at any positive integer $n$. This gives rise to an infinite family of inequalities for $p(n)$ which finally answers to a question proposed by Chen. Our error term estimation predominantly relies on applications of algorithmic methods from symbolic summation.

math.NT↗

Infinite product formulae for generating functions for sequences of squares

We state and prove product formulae for several generating functions for sequences $(a_n)_{n\ge0}$ that are defined by the property that $Pa_n+b^2$ is a square, where $P$ and $b$ are given integers. In particular, we prove corresponding conjectures of the second author. We show that, by means of the Jacobi triple product identity, all these generating functions can be reduced to a linear combination of theta function products. The proof of our formulae then consists in simplifying these linear combinations of theta products into single products. We do this in two ways: (1) by using modular function theory, and (2) by applying the Weierstraßaddition formula for theta products.

math.NT↗

A Method of Verifying Partition Congruences by Symbolic Computation

Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed to efficiently check a very large number of cases of such conjectures. This allows substantial evidence to be collected for a given conjecture, before a complete proof is attempted.

math.NT↗

Computing an order complete basis for $M^{\infty}(N)$ and Applications

This paper gives a quick way to construct all modular functions for the group $Γ_0(N)$ having only a pole at $τ= i \infty$. We assume that we are given two modular functions $f,g$ for $Γ_0(N)$ with poles only at $i \infty$ and coprime pole orders. As an application we obtain two new identities from which one can derive that $p(11n+6)\equiv 0\pmod{11}$, here $p(n)$ is the usual partition function.

math.NT↗

Inverse Inequality Estimates with Symbolic Computation

In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as accurately as possible. We apply symbolic computation methods to the situation of square elements and are able to improve the previously known upper bound, given in "p- and hp-finite element methods" (Schwab, 1998), by a factor of 8. More precisely, we try to evaluate the corresponding determinant using the holonomic ansatz, which is a powerful tool for dealing with determinants, proposed by Zeilberger in 2007. However, it turns out that this method does not succeed on the problem at hand. As a solution we present a variation of the original holonomic ansatz that is applicable to a larger class of determinants, including the one we are dealing with here. We obtain an explicit closed form for the determinant, whose special form enables us to derive new and tight upper resp. lower bounds on the maximal eigenvalue, as well as its asymptotic behaviour.

cs.SC↗