Related papers: On the variance of the Fibonacci partition functio…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
We consider a class of non-homogeneous Markov chains, that contains many natural examples. Next, using martingale methods, we establish some deviation and moment inequalities for separately Lipschitz functions of such a chain, under moment…
We study the concatenated Fibonacci constant $\mathcal{F} := 0.F_{1}F_{2}F_{3}\cdots = 0.11235813\cdots$, obtained by concatenating the Fibonacci numbers in the fractional part, and ask whether it is normal. We show that several classical…
In this paper we prove exponential inequalities (also called Bernstein's inequality) for fractional martingales. As an immediate corollary, we will discuss weak law of large numbers for fractional martingales under divergence assumption on…
The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
We prove a discrepancy estimate related to the sequence of fractional parts of $b^n/n$. This improves an earlier result of Cilleruelo et al.
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…
We prove an analogue the Khinchin theorem for the Diophantine approximation by integer vectors lying on a quadratic variety. The proof is based on the study of a dynamical system on a homogeneous space of the orthogonal group. We show that…
An inequality for the variance of an additive function defined on random decomposable structures, called assemblies, is established. The result generalizes estimates obtained earlier in the cases of permutations and mappings of a finite set…
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…
In this paper, by using bi-periodic Fibonacci numbers, we introduce the bi-periodic Fibonacci octonions. After that, we derive the generating function of these octonions as well as investigated some properties over them. Also, as another…
Some probabilistic aspects of the number variance statistic are investigated. Infinite systems of independent Brownian motions and symmetric alpha-stable processes are used to construct new examples of processes which exhibit both divergent…
We prove a multivariate version of Hoeffding's inequality about the distribution of homogeneous polynomials of Rademacher functions. The proof is based on such an estimate about the moments of homogeneous polynomials of Rademacher functions…
Lorentz-covariant harmonic oscillator wave functions are constructed from the Lorentz-invariant oscillator differential equation of Feynman, Kislinger, and Ravndal for a two-body bound state. The wave functions are not invariant but…
We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.
We study Diophantine arithmetic properties of birational divisors in conjunction with concepts that surround $\mathrm{K}$-stability for Fano varieties. There is also an interpretation in terms of the barycentres of Newton-Okounkov bodies.…
We study a family of identities regarding a divisibility property of the Kostant partition function which first appeared in a paper of Baldoni and Vergne. To prove the identities, Baldoni and Vergne used techniques of residues and called…
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the…