中文
相关论文

相关论文: Sums of Ceiling Functions Solve Nested Recursions

200 篇论文

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

数论 · 数学 2014-10-21 Apoloniusz Tyszka

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

高能物理 - 理论 · 物理学 2015-06-12 C. Anzai , Y. Sumino

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

几何拓扑 · 数学 2019-06-25 Elmas Irmak

In the present paper, it is proved that all solutions are bounded for the reversible system \ddot{x}+\sum_{i=0}^{l}b_{i}(t)x^{2i+1}\dot{x}+x^{2n+1}+\sum_{i=0}^{n-1}a_{i}(t)x^{2i+1}=0, 0\leq l\leq…

动力系统 · 数学 2018-02-26 Jing Li

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

数论 · 数学 2024-11-26 Noam Kimmel , Vivian Kuperberg

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

数论 · 数学 2022-04-11 Bartosz Sobolewski , Maciej Ulas

Two classes of finite trigonometric sums, each involving only $\sin$'s, are evaluated in closed form. The previous and original proofs arise from Ramanujan's theta functions and modular equations.

数论 · 数学 2022-10-11 Bruce C. Berndt , Sun Kim , Alexandru Zaharescu

We consider a Dirichlet series $\sum_{n=1}^{\infty}a_n^{-s}$, where $a_n$ satisfies a linear recurrence of arbitrary degree with integer coefficients. Under suitable hypotheses, we prove that it has a meromorphic continuation to the complex…

数论 · 数学 2023-01-30 Álvaro Serrano Holgado , Luis Manuel Navas Vicente

Cohen-Ramanujan sum, denoted by $c_r^s(n)$, is an exponential sum similar to the Ramanujan sum $c_r(n):=\sum\limits_{\substack{h=1\\{(h,r)=1}}}^{r}e^{\frac{2\pi i n h}{r}}$. An arithmetical function $f$ is said to admit a Cohen-Ramanujan…

数论 · 数学 2024-11-20 Arya Chandran , Vishnu Namboothiri K

We show that for any integer $s \geq 2$, there are only finitely many $s$-Cullen numbers that are repunits. More precisely, for fixed $s \ge 2$, there are only finitely many integers $n$, $b$, and $q$ with $n \geq 2$, $b \geq 2$ and $q \geq…

数论 · 数学 2021-12-22 Michael Filaseta , Jon Grantham , Hester Graves

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

符号计算 · 计算机科学 2022-12-16 Antonio Jiménez-Pastor , Marko Petkovšek

We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of depth 1, where the next values are computed as rational…

形式语言与自动机理论 · 计算机科学 2022-10-05 Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki , Michał Pilipczuk

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…

数论 · 数学 2026-02-16 Meselem Karras

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

数论 · 数学 2026-05-06 Christian Táfula

The following result gives the flavor of this paper: Let $t$, $k$ and $q$ be integers such that $q\geq 0$, $0\leq t < k$ and $t \equiv k \,({\rm mod}\, 2)$, and let $s\in [0,t+1]$ be the unique integer satisfying $s \equiv q +…

组合数学 · 数学 2016-12-21 Yair Caro , Adriana Hansberg , Amanda Montejano

In this note, we derive the closed-form expression for the summation of series $\sum_{n=0}^{\infty}nJ_n(x)\partial J_n/\partial n$, which is found in the calculation of entanglement entropy in 2-d bosonic free field, in terms of $Y_0$,…

数学物理 · 物理学 2021-04-22 Yilin Chen

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

逻辑 · 数学 2021-03-10 Nathanael Ackerman , Cameron Freer , Rehana Patel

Highly oscillatory integrals, such as those involving Bessel functions, are best evaluated analytically as much as possible, as numerical errors can be difficult to control. We investigate indefinite integrals involving monomials in $x$…

经典分析与常微分方程 · 数学 2017-03-21 Jolyon K. Bloomfield , Stephen H. P. Face , Zander Moss

We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the…

交换代数 · 数学 2010-07-13 Akira Terui

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

组合数学 · 数学 2007-05-23 Mahendra Jani , Robert G. Rieper