English
Related papers

Related papers: Crouching AGM, Hidden Modularity

200 papers

A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…

Numerical Analysis · Mathematics 2021-05-31 W. A. Gunarathna , H. M. Nasir , W. B. Daundasekera

Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…

Classical Analysis and ODEs · Mathematics 2018-02-22 Eszter Gselmann , Gergely Kiss , Csaba Vincze

It is shown that if a function defined on the segment [-1,1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$,…

Number Theory · Mathematics 2010-08-31 Sergei N. Preobrazhenskii

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…

Number Theory · Mathematics 2024-12-31 Madhuparna Das

Using the theory of Stienstra and Beukers, we prove various elementary congruences for the numbers \sum \binom{2i_1}{i_1}^2\binom{2i_2}{i_2}^2...\binom{2i_k}{i_k}^2, where k,n \in N, and the summation is over the integers i_1, i_2, ...i_k…

Number Theory · Mathematics 2013-01-16 Matija Kazalicki

We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…

Classical Analysis and ODEs · Mathematics 2025-05-01 Vitaly Alekseev , Tom Cuchta , Alexander Lyapin

Properties of the mappings \begin{align*} C&\mapsto\frac1{(2\pi i)^2}\int_{\Gamma_1}\int_{\Gamma_2}f(\lambda,\mu)\,R_{1,\,\lambda}\,C\, R_{2,\,\mu}\,d\mu\,d\lambda, C&\mapsto\frac1{2\pi i}\int_{\Gamma}g(\lambda)R_{1,\,\lambda}\,C\,…

Functional Analysis · Mathematics 2016-04-27 V. G. Kurbatov , I. V. Kurbatova , M. N. Oreshina

Let $a(z)=\sum_{i\in\mathbb Z}a_iz^i$ be a complex valued continuous function, defined for $|z|=1$, such that $\sum_{i=-\infty}^{+\infty}|ia_i|<\infty$. Consider the semi-infinite Toeplitz matrix $T(a)=(t_{i,j})_{i,j\in\mathbb Z^+}$…

Numerical Analysis · Mathematics 2021-01-25 Dario A. Bini , Stefano Massei , Beatrice Meini

Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…

Functional Analysis · Mathematics 2014-10-24 Jianlian Cui , Chi-Kwong Li , Yiu-Tung Poon

Using the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer…

Combinatorics · Mathematics 2013-02-12 Dmitry Kruchinin , Vladimir Kruchinin

For each prime $\ell$, let $|\cdot|_\ell$ be an extension to $\bar \Q$ of the usual $\ell$-adic absolute value on $\Q$. Suppose $g(z) = \sum_{n=0}^\infty c(n)q^n \in M_{k+\half}(N)$ is an eigenform whose Fourier coefficients are algebraic…

Number Theory · Mathematics 2008-02-03 Ken Ono , Christopher Skinner

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

Symbolic Computation · Computer Science 2015-07-16 Sébastien Maulat , Bruno Salvy

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Number Theory · Mathematics 2015-10-30 Jakob Ablinger

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

Holonomic functions play an essential role in Computer Algebra since they allow the application of many symbolic algorithms. Among all algorithmic attempts to find formulas for power series, the holonomic property remains the most important…

Symbolic Computation · Computer Science 2022-04-18 Bertrand Teguia Tabuguia , Wolfram Koepf

We discover a non-trivial relation between the mock modular generating functions of the level $1$ and level $N$ Hurwitz class numbers. This relation yields a holomorphic modular form of weight $\frac{3}{2}$ and level $4N$, where $N > 1$ is…

Number Theory · Mathematics 2026-03-03 Olivia Beckwith , Andreas Mono

For a purely $N$-periodic continued fraction $\xi=[\overline{a_0,a_1,\dots,a_{N-1}}]=[a_0,a_1,\cdots]$, with $a_k=a_{k+N}$ for all $k\ge 0$, and convergents $h_n/k_n=[a_0,a_1,\dots,a_n]$, we obtain explicit expressions for the weighted…

Number Theory · Mathematics 2026-01-14 Kevin Calderon , Nikita Kalinin

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

Number Theory · Mathematics 2026-04-28 Maxie Dion Schmidt

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

Number Theory · Mathematics 2026-02-16 Meselem Karras