中文
相关论文

相关论文: A dynamical property unique to the Lucas sequence

200 篇论文

The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…

动力系统 · 数学 2015-06-09 Cristian Ghiu , Raluca Tuliga , Constantin Udriste

A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…

数论 · 数学 2024-07-30 Brennan Benfield , Oliver Lippard

We recursively define a sequence $\{F_{n,k}\}_{n,k\in\mathbb N }$ and we prove that such sequence contains only the symbols $\{0,1\}.$ We investigate some number-theoretic properties of such sequence and of the way it can be generated. The…

数论 · 数学 2023-10-26 Niccolò Castronuovo

In this paper, we derive analytic expressions for coefficients of the equations that allow calculations of asymptotically periodic points in fractional difference maps. Numerical solution of these equations allows us to draw the bifurcation…

混沌动力学 · 物理学 2023-01-04 Mark Edelman , Avigayil Helman

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

组合数学 · 数学 2007-05-23 Mario Catalani

We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.

群论 · 数学 2016-03-22 Joshua Frisch , Omer Tamuz

MacMahon's definition of self-inverse composition is extended to $n$-colour self-inverse composition. This introduces four new sequences which satisfy the same recurrence relation with different initial conditions like the famous Fibonacci…

组合数学 · 数学 2007-05-23 Geetika Narang , A K Agarwal

In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…

历史与综述 · 数学 2015-01-27 Aimé Lachal

The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial…

组合数学 · 数学 2019-04-02 Xu Wang , Xuxu Zhao , Haiyuan Yao

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

数论 · 数学 2014-07-18 Vladimir Pletser

Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest…

离散数学 · 计算机科学 2010-11-02 L. F. Johnson

We consider accumulation of periodic points in local uniformly quasiregular dynamics. Given a local uniformly quasiregular mapping $f$ with a countable and closed set of isolated essential singularities and their accumulation points on a…

动力系统 · 数学 2015-05-20 Yûsuke Okuyama , Pekka Pankka

In this paper we study rational Collet-Eckmann maps for which the Julia set is not the whole sphere and for which the critical points are recurrent at a slow rate. In families where the orders of the critical points are fixed, we prove that…

动力系统 · 数学 2024-03-08 Magnus Aspenberg , Mats Bylund , Weiwei Cui

It is conjectured that there is a converging sequence of some generalized Fibonacci ratios, given the difference between consecutive ratios, such as the Golden Ratio, $\varphi^1$, and the next golden ratio $\varphi^2$. Moreover, the graphic…

综合数学 · 数学 2024-01-09 Arturo Ortiz Tapia

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

交换代数 · 数学 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

In this survey we describe how the so-called Dold congruence arises in topology, and how it relates to periodic point counting in dynamical systems.

动力系统 · 数学 2025-08-18 Jakub Byszewski , Grzegorz Graff , Thomas Ward

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

环与代数 · 数学 2007-05-23 Roland Bacher

In this paper, we consider a generalization of Horadam sequence fwng which is defined by the recurrence relation wn = x(n)wn-1+ cwn-2; where x(n) = a if n is even, x(n) = b if n is odd with arbitrary initial conditions w0;w1 and nonzero…

数论 · 数学 2019-10-10 Elif Tan , Ho-hon Leung

A characterization of dynamically defined zeta functions is presented. It comprises a list of axioms, natural extension of the one which characterizes topological degree, and a uniqueness theorem. Lefschetz zeta function is the main (and…

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

数论 · 数学 2009-03-25 Stefan Gerhold
‹ 上一页 1 8 9 10 下一页 ›