English
Related papers

Related papers: Note on a Fibonacci Parity Sequence

200 papers

Recently, Chu studied some properties of the partial sums of the sequence $P^k(F_n)$, where $P(F_n)=\big(\sum_{i=1}^nF_i\big)_{n\geq1}$ and $(F_n)_{n\geq1}$ is the Fibonacci sequence, and gave its combinatorial interpretation. We generalize…

Combinatorics · Mathematics 2021-09-09 Pankaj Jyoti Mahanta

In this paper, we study inequalities involving polynomials and quasimodular forms. More precisely, we focus on the monotonicity of the functions of the form $t \mapsto t^m F(it)$ where $F$ is a quasimodular form and $m > 0$. As an…

Number Theory · Mathematics 2026-02-12 Seewoo Lee

We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…

General Mathematics · Mathematics 2015-02-25 Masum Billal

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

In this paper, we study the additive complexity $\rho^{+}_{\mathbf{t}}(n)$ of a Thue-Morse like sequence $\mathbf{t}=\sigma^{\infty}(0)$ with the morphism $\sigma: 0\to 01, 1\to 12, 2\to 20$. We show that…

Combinatorics · Mathematics 2018-07-16 Jin Chen , Zhixiong Wen , Wen Wu

We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…

History and Overview · Mathematics 2007-12-04 Brian A. Benson

The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…

Combinatorics · Mathematics 2007-05-23 Pieter Moree

In this paper, we will provide a mathematically rigorous computer aided estimation for the exact values and robustness for Gelfond exponent of weighted Thue-Morse sequences. This result improves previous discussions on Gelfond exponent by…

Dynamical Systems · Mathematics 2018-06-26 Yiwei Zhang , Ke Yin , Wanquan Wu

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

In this paper we prove an explicit version of a function field analogue of a classical result of Odoni about norms in number fields in the case of a cyclic Galois extensions. In the particular case of a quadratic extension, we recover the…

Number Theory · Mathematics 2020-10-26 Vlad Matei

If $x$ is a non-empty string then the repetition $xx$ is called a tandem repeat. Similarly, a tandem in a two dimensional array $X$ is a configuration consisting of a same primitive block $W$ that touch each other with one side or corner.…

Combinatorics · Mathematics 2022-05-06 Sivasankar M , Rama R

Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…

Combinatorics · Mathematics 2011-12-06 Joseph P. S. Kung

Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…

Number Theory · Mathematics 2016-02-02 Ying-jun Guo , Zhi-xiong Wen , Jie-meng Zhang

We estimate the covariance in counts of almost-primes in $\mathbb{F}_q[T]$, weighted by higher-order von Mangoldt functions. The answer takes a pleasant algebraic form. This generalizes recent work of Keating and Rudnick that estimates the…

Number Theory · Mathematics 2016-06-07 Brad Rodgers

An infinite $\pm 1$-sequence is called {\it Apwenian} if its Hankel determinant of order $n$ divided by $2^{n-1}$ is an odd number for every positive integer $n$. In 1998, Allouche, Peyri\`ere, Wen and Wen discovered and proved that the…

Number Theory · Mathematics 2016-01-19 Hao Fu , Guo-Niu Han

This paper analyzes the concept of orthogonality in second-order polynomial sequences that have Binet formula similar to that of the Fibonacci and Lucas numbers, referred to as Generalized Fibonacci Polynomials (GFP). We give a technique to…

Combinatorics · Mathematics 2025-10-14 Cristian F. Coletti , Rigoberto Flórez , Robinson A. Higuita , Sandra Z. Yepes

We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…

Numerical Analysis · Mathematics 2016-08-05 Hans-Rudolf Thomann

Let $a, b\in \mathbb{N}$ be relatively prime. We consider $(a-1)(b-1)/2$, which arises in the study of the $pq$-th cyclotomic polynomial, where $p,q$ are distinct primes. We prove two possible representations of $(a-1)(b-1)/2$ as…

Number Theory · Mathematics 2020-01-23 Hung Viet Chu

Let $S_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. For two permutations $u, v\in S_n$ such that $u\leq v$ in the Bruhat order, let $R_{u,v}(q)$ and $\R_{u,v}(q)$ denote the Kazhdan-Lusztig $R$-polynomial and $\R$-polynomial,…

Combinatorics · Mathematics 2013-12-10 William Y. C. Chen , Neil J. Y. Fan , Peter L. Guo , Michael X. X. Zhong

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

Combinatorics · Mathematics 2013-02-12 Milan Janjic
‹ Prev 1 3 4 5 6 7 10 Next ›