How do random Fibonacci sequences grow?

We study the random Fibonacci sequences defined by ${F_1 = F_2 = \widetilde F_1 = \widetilde F_2 = 1}$ and for n ≥ 1, F _n+2 = F _n+1 ± F _n (linear case) and ${\widetilde F_{n+2} = |\widetilde F_{n+1} \pm \widetilde F_{n}|}$ (non-linear case), where each ± sign is independent and either + with probability p or ? with probability 1 ? p (0 < p ≤ 1). Our main result is that the exponential growth of F _n for 0 < p ≤ 1, and of ${\widetilde F_{n}}$ for 1/3 ≤ p ≤ 1 is almost surely given by $${\int \limits _0^\infty \log x\, d\nu_\alpha (x),}$$ where α is an explicit function of p depending on the case we consider, and ν _α is an explicit probability distribution on ${\mathbb{R}_+}$ defined inductively on Stern–Brocot intervals. In the non-linear case, the largest Lyapunov exponent is not an analytic function of p, since we prove that it is equal to zero for 0 < p ≤ 1/3. We also give some results about the variations of the largest Lyapunov exponent, and provide a formula for its derivative.     

The dual difference Aleksandrov–Fenchel inequality

Recently, a dual Minkowski inequality and a dual Brunn–Minkowski inequality for volume differences were established. Following this, in this paper we establish a dual Aleksandrov–Fenchel inequality for dual mixed volume differences which generalizes several recent results.     

尾数恰含k个零的正Fibonacci数

根据正Fibonacci数Fn的标准分解式中,因子2和因子5的指数的性质,利用初等数论的知识,讨论了尾数恰含k个零的正Fibonacci数Fn的下标n的特征,并证明了:对于任意大的正整数k,都存在着尾数恰含k个零的正Fibonacci数.     

关于Fibonacci三角形猜想k=6的证明

运用初等方法,证明k=6时Fibonacci三角形不存在.     

Auslander–Reiten sequences on schemes

Auslander–Reiten sequences are the central item of Auslander–Reiten theory, which is one of the most important techniques for the investigation of the structure of abelian categories. This note considers X, a smooth projective scheme of dimension at least 1 over the field k, and , an indecomposable coherent sheaf on X. It is proved that in the category of quasi-coherent sheaves on X, there is an Auslander–Reiten sequence ending in .     

The numerical analysis of two linearized difference schemes for the Benjamin–Bona–Mahony–Burgers equation

In the article, two linearized finite difference schemes are proposed and analyzed for the Benjamin–Bona–Mahony–Burgers (BBMB) equation. For the construction of the two-level scheme, the nonlinear term is linearized via averaging k and k + 1 floor, we prove unique solvability and convergence of numerical solutions in detail with the convergence order O(τ² + h²) . For the three-level linearized scheme, the extrapolation technique is utilized to linearize the nonlinear term based on ψ function. We obtain the conservation, boundedness, unique solvability and convergence of numerical solutions with the convergence order O(τ² + h²) at length. Furthermore, extending our work to the BBMB equation with the nonlinear source term is considered and a Newton linearized method is inserted to deal with it. The applicability and accuracy of both schemes are demonstrated by numerical experiments.     

The invariance principle for ϕ-mixing sequences

Summary In this paper we investigate the invariance principle for -mixing sequences, satisfying restrictions on the variances which are a weak form of stationarity. No mixing rate is assumed. For -mixing strictly stationary sequences we give a necessary and sufficient condition for the invariance principle.     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

The life and work of Zbyněk Šidák (1933–1999)

Zbynk idák, the chief editor of the Applications of Mathematics, an outstanding Czech statistician and probabilist, died on November 12, 1999, aged 66 years. This article is devoted to memory of him and outlines his life and scientific work.     

The Pell equation over the Fibonacci ∘-ring

The paper considers the Pell equation

Limits of locally–globally convergent graph sequences

The colored neighborhood metric for sparse graphs was introduced by Bollobás and Riordan [BR11]. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm [BS01]. We prove that even in this refined sense, the limit of a convergent graph sequence (with uniformly bounded degree) can be represented by a graphing. We study various topics related to this convergence notion such as: Bernoulli graphings, factor of i.i.d. processes and hyperfiniteness.     

“魔（n,k）方”与广义Fibonacci数列

文 [1 ]讨论“魔八方”问题 ,证明了符合条件的ｎ等于ｘ ｙ ,ｘ,ｙ为满足不定方程ｘ2 ｘｙ-ｙ2 1 =0的任一组正整数解 ,并找到了方程的Ｆｉｂｏｎａｃｃｉ解 .结束时提出方程是否只有Ｆｉｂｏｎａｃｃｉ解的问题 .本文将Ｆｉｂｏｎａｃｃｉ数列与“魔八方”问题进行了推广 ,在此基础上对该文作者的问题作了彻底的回答 .1　Ｆｉｂｏｎａｃｃｉ数列的推广Ｆｉｂｏｎａｃｃｉ数列是指下面的数列1 ,1 ,2 ,3,5,8,1 3,2 1 ,34,55,89,1 44 ,…… .此数列可以用递推公式表示如下ａ1 =1 ,ａ2 =1ａｎ =ａｎ- 1 ａｎ- 2 ,ｎ≥ 3. (1 )为了本文的讨…