中文
相关论文

相关论文: A note on recurrence sequences

200 篇论文

This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…

数论 · 数学 2019-01-07 Muhammed Hüsrev Cilasun

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

数论 · 数学 2025-06-04 Ritesh Dwivedi , Rohit Yadav

We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…

离散数学 · 计算机科学 2013-07-09 Deepak Ponvel Chermakani

The purpose of this note is to provide a gentle introduction to basic universal algebra and (abstract) clones.

历史与综述 · 数学 2020-04-24 Soichiro Fujii

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…

符号计算 · 计算机科学 2015-07-16 Sébastien Maulat , Bruno Salvy

These are notes for a graduate-level introductory course on singularity categories.

表示论 · 数学 2026-04-24 Matt Booth

The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.

泛函分析 · 数学 2007-05-23 Lorenzo D'Ambrosio , Elisabetta Mangino

We rewrite Riemann Zeta function as a sum over the primes. Each term of the sum is a product that depends only on the summation index (a prime) and the primes following it.

历史与综述 · 数学 2007-05-23 Riccardo Poli , William B. Langdon

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

范畴论 · 数学 2025-12-29 Takuo Matsuoka

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

符号计算 · 计算机科学 2013-06-19 Marc Mezzarobba , Bruno Salvy

In this paper we propose a definition of a recurrence relation homomorphism and illustrate our definition with a few examples. We then define the period of a k-th order of linear recurrence relation and deduce certain preliminary results…

数论 · 数学 2014-09-24 Alexandre Laugier , Manjil P. Saikia

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

组合数学 · 数学 2007-05-23 Jason P. Bell , Stefan Gerhold

We present a generalization of a formula of higher order derivatives and give a short proof.

经典分析与常微分方程 · 数学 2016-06-28 Ulrich Abel

A constant term sequence is a sequence of rational numbers whose $n$-th term is the constant term of $P^n(\boldsymbol{x}) Q(\boldsymbol{x})$, where $P(\boldsymbol{x})$ and $Q(\boldsymbol{x})$ are multivariate Laurent polynomials. While the…

数论 · 数学 2023-07-19 Alin Bostan , Armin Straub , Sergey Yurkevich

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

组合数学 · 数学 2026-04-28 Zixian Yang , Jianchao Bai

In \cite {kl1}, we extended various notions of recurrence for the generalized semigroup analogous to their counterpart in the classical theory of dynamics. In this paper, we shall address the alternative definition of chain recurrent set in…

动力系统 · 数学 2019-10-02 Kushal Lalwani

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

数论 · 数学 2022-04-25 Roudy El Haddad

In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth notions introduced in complexity theory so far. We review most…

计算复杂性 · 计算机科学 2009-06-18 Philippe Moser

This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…

数论 · 数学 2025-08-26 Hongshen Chua

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

数论 · 数学 2021-12-01 Taekyun Kim , Dae San Kim , Hyunseok Kwon , Jongkyum Kwon