English
Related papers

Related papers: On the variance of the Fibonacci partition functio…

200 papers

We present a new method for proving Correa-Jofr\'e-Thibault theorem that monotonicity of subdifferential implies convexity of the function. This new method is based on barrier functions. Barrier functions help overcome some of the main…

Functional Analysis · Mathematics 2024-08-05 Milen Ivanov , Nadia Zlateva

The metrical theory of the product of consecutive partial quotients is associated with the uniform Diophantine approximation, specifically to the improvements to Dirichlet's theorem. Achieving some variant forms of metrical theory in…

Number Theory · Mathematics 2023-09-19 Bo Tan , Qing-Long Zhou

Let (F_n)_{n} be the classical Fibonacci sequence. It is well-known that it satisfies F_{n}^2 + F_{n+1}^2 = F_{2n+1}. In this study, we explore generalizations of this Diophantine equation in several directions. First, we solve the…

Number Theory · Mathematics 2025-01-16 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

Combinatorics · Mathematics 2016-08-02 Aram Tangboonduangjit , Thotsaporn Thanatipanonda

We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…

Number Theory · Mathematics 2026-04-20 Katie Anders , Madeline L. Dawsey , Joseph Vandehey

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

Classical Analysis and ODEs · Mathematics 2026-03-12 Vitaly M. Khamitov , Dmitriy Dmitrishin , Alexander Stokolos , Daniel Gray

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

Combinatorics · Mathematics 2015-10-01 Soumyabrata Pal , Shankar M. Venkatesan

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

General Mathematics · Mathematics 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

Practical methods for quantitative analysis of radial and angular coordinates of leafy organs of vascular plants are presented and applied to published phyllotactic patterns of various real systems from young leaves on a shoot tip to…

Biological Physics · Physics 2012-12-17 Takuya Okabe

The Fibonacci word is the fixed point beginning with the letter $a$ of morphism $\sigma(a)=ab$, $\sigma(b)=a$ defined over the alphabet $\{a,b\}$. In this paper, we get explicit expression of the number of distinct fractional powers in each…

Dynamical Systems · Mathematics 2018-11-29 Yu-ke Huang , Zhi-ying Wen

The main purpose of this paper is to propose a variance-based Bregman extragradient algorithm with line search for solving stochastic variational inequalities, which is robust with respect an unknown Lipschitz constant. We prove the almost…

Optimization and Control · Mathematics 2022-08-31 Xian-Jun Long , Yue-Hong He , Nan-Jing Huang

In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…

Optimization and Control · Mathematics 2019-08-27 Rui A. C. Ferreira

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…

Number Theory · Mathematics 2023-08-25 Sam Chow , Niclas Technau

We study the distribution of spacings between the fractional parts of $n^d\alpha$. For $\alpha$ of high enough Diophantine type we prove a necessary and sufficient condition for $n^d\alpha\mod 1, 1\leq n\leq N,$ to be Poissonian as $N\to…

Number Theory · Mathematics 2020-04-13 Martino Fassina , Sun Kim , Alexandru Zaharescu

We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…

Classical Analysis and ODEs · Mathematics 2023-08-21 Chao Min , Yuan Cheng , Yang Chen

In this paper we consider the sequence of Kakutani's $\alpha$-refinements corresponding to the inverse of golden ratio (which we call Kakutani-Fibonacci sequence of partitions) and associate to it an ergodic interval exchange (which we call…

Dynamical Systems · Mathematics 2015-01-30 Ingrid Carbone , Maria Rita Iacò , Aljoša Volčič

We introduce a variational structure for the Fourier-Cattaneo (FC) system which is a second-order hyperbolic system. This variational structure is inspired by the large-deviation rate functional for the Kac process which is closely linked…

Analysis of PDEs · Mathematics 2022-11-15 Alberto Montefusco , Upanshu Sharma , Oliver Tse

The phenomena that cause a value of a polynomial function to be a bifurcation one are yet to be described when the fibers have dimension higher than $1$. In this note, the main result is the construction of a polynomial submersion function…

Algebraic Geometry · Mathematics 2025-08-05 Francisco Braun , Filipe Fernandes

We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…

Number Theory · Mathematics 2021-12-22 Jeroen van de Graaf