中文
相关论文

相关论文: An elementary proof that random Fibonacci sequence…

200 篇论文

We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…

动力系统 · 数学 2013-03-20 Bing Li , Tomas Persson , Baowei Wang , Jun Wu

Let $r=r(n)$ be a sequence of integers such that $r\leq n$ and let $X_1,\ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $\mathbb{R}^n$. Limit theorems for the…

概率论 · 数学 2017-08-03 Julian Grote , Zakhar Kabluchko , Christoph Thäle

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…

统计力学 · 物理学 2009-11-11 David S. Dean , Satya N. Majumdar

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions:…

数论 · 数学 2025-11-06 Alex Jin , Shreyas Singh , Zhuo Zhang , AJ Hildebrand

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

数论 · 数学 2021-07-01 Martin Bunder , Joseph Tonien

We prove that the generalised Fibonacci group F(r,n) is infinite for (r,n) in {(7 + 5k,5), (8 + 5k,5)} where k is greater than or equal to 0. This together with previously known results yields a complete classification of the finite F(r,n),…

群论 · 数学 2017-10-11 M. Edjvet , A. Juhasz

Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…

统计力学 · 物理学 2007-05-23 E. Ben-Naim , P. L. Krapivsky

Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…

组合数学 · 数学 2025-07-15 Boris Pittel

Characterizations of finite sequences $\beta_{1}<\cdots<\beta_{n}$ representing expected values of order statistics from a random sample of size $n$ are given. As a by-product, a characterization of binomial mixtures, when the mixing random…

概率论 · 数学 2022-05-02 A. Okolewski , N. Papadatos

This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…

组合数学 · 数学 2025-10-29 Duaa Abdullah , Jasem Hamoud

In the paper we provide measure estimates for the set of numbers whose sequence of products of continued fraction partial quotients $M_n = a_1 \ldots a_n$ has exponential growth with rate close to the one predicted by Khintchine's theorem,…

动力系统 · 数学 2019-03-04 Piotr Kamieński

We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…

概率论 · 数学 2015-09-16 Peichao Peng , J. Michael Steele

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

数论 · 数学 2010-05-21 Akos Pinter , Volker Ziegler

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

逻辑 · 数学 2018-10-16 Pierre Simon

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

We study ratio limits of the consecutive terms of weighted $n$-generalized Fibonacci sequences generated from arbitrary complex initial conditions by linear recurrences with arbitrary complex weights. We prove that if the characteristic…

数论 · 数学 2016-04-11 Igor Szczyrba

In this shortnote, a series expansion technique introduced recently by Dancs and He for generating Euler-type formulae for odd zeta values $\:\zeta{(2 k +1)}$, $\zeta{(s)}$ being the Riemann zeta function and $k$ a positive integer, is…

历史与综述 · 数学 2017-07-06 F. M. S. Lima

Let $\beta\in(1,2)$ and $x\in [0,\frac{1}{\beta-1}]$. We call a sequence $(\epsilon_{i})_{i=1}^\infty\in\{0,1\}^{\mathbb{N}}$ a $\beta$-expansion for $x$ if $x=\sum_{i=1}^{\infty}\epsilon_{i}\beta^{-i}$. We call a finite sequence…

数论 · 数学 2014-09-10 Simon Baker

Let $v_n$ be the maximum expected length of an increasing subsequence, which can be selected by an online nonanticipating policy from a random sample of size $n$. Refining known estimates, we obtain an asymptotic expansion of $v_n$ up to a…

最优化与控制 · 数学 2018-08-21 Amirlan Seksenbayev