English
Related papers

Related papers: On monotonicity of some combinatorial sequences

200 papers

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

Number Theory · Mathematics 2011-10-27 Steven J. Miller , Yinghui Wang

We introduce a new family of meta-Fibonacci sequences $(f(n))_{n\in\mathbb{N}}$, governed by the recurrence relation $$f(n)=af(n-u_{n}-1)+bf(n-u_{n}-2),$$ where $\mathbf{u}=(u_{n})_{n\in \mathbb{N}}$ is a sequence with values $0,1$. Our…

Number Theory · Mathematics 2025-05-14 Piotr Miska , Bartosz Sobolewski , Maciej Ulas

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…

Combinatorics · Mathematics 2019-01-08 Pierre Bonardo , Anna E. Frid , Jeffrey Shallit

The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…

Probability · Mathematics 2016-11-11 Arulalan Rajan , R. Vittal Rao , Ashok Rao , H. S. Jamadagni

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

Number Theory · Mathematics 2022-02-22 Pagdame Tiebekabe , Ismaïla Diouf

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

Number Theory · Mathematics 2019-01-01 Douglas Bowman , James Mc Laughlin

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

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

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Combinatorics · Mathematics 2010-03-05 Milan Janjic

We study finite but growing principal square submatrices $A_n$ of the one- or two-sided infinite Fibonacci Hamiltonian $A$. Our results show that such a sequence $(A_n)$, no matter how the points of truncation are chosen, is always stable…

Mathematical Physics · Physics 2017-11-28 Marko Lindner , Hagen Söding

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…

Combinatorics · Mathematics 2018-02-28 Guo-Niu Han , Jing-Yi Liu

In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…

General Mathematics · Mathematics 2015-10-06 Maya Mohsin Ahmed

For a finite set $A\subset\mathbb{N}$ and $k\in \mathbb{N}$, let $\omega_k(A) = \sum_{i\in A, i\neq k}1$. For each $n\in \mathbb{N}$, define $$a_{k, n}\ =\ |\{E\subset \mathbb{N}\,:\, E = \emptyset\mbox{ or } \omega_k(E) < \min E\leqslant…

Combinatorics · Mathematics 2024-05-31 Hung Viet Chu , Zachary Louis Vasseur

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

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…

Combinatorics · Mathematics 2025-10-29 Duaa Abdullah , Jasem Hamoud

For any posotive integer $m$, let $[m]:=\{1,\ldots,m\}$. Let $n,k,t$ be positive integers. Aharoni and Howard conjectured that if, for $i\in [t]$, $\mathcal{F}_i\subset[n]^k:= \{(a_1,\ldots,a_k): a_j\in [n] \mbox{ for } j\in [k]\}$ and…

Combinatorics · Mathematics 2016-11-08 Hongliang Lu , Xingxing Yu

In algebraic, topological, and geometric combinatorics inequalities among the coefficients of combinatorial polynomials are frequently studied. Recently a notion called the alternatingly increasing property, which is stronger than…

Combinatorics · Mathematics 2020-01-14 Petter Brändén , Liam Solus

We consider the spherical complementary series of rank one Lie groups $H_n=\SO_0(n, 1; \mathbb F)$ for $\mathbb F=\mathbb R, \mathbb C, \mathbb H$. We prove that there exist finitely many discrete components in its restriction under the…

Representation Theory · Mathematics 2013-04-11 Birgit Speh , Genkai Zhang

We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…

Optimization and Control · Mathematics 2025-08-05 Ahmad Al-Sulami , Hamza Fawzi , Shengding Sun