Related papers: Note on a Fibonacci Parity Sequence

Lascoux, Leclerc and Thibon\cite{LLT} introduced a family of symmetric polynomials, called LLT polynomials. We prove a $q$-multinomial expansion of the coefficients of LLT polynomials in the case where $ \boldsymbol{\mu} =…

Letting $w$ denote a finite, nonempty word, let $\text{red}(w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc \cdots c$ for a given character $c$ (such that there is no character immediately to the…

Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

A beautiful theorem of Thomas Price links the Fibonacci numbers and the Lucas polynomials to the plane geometry of an ellipse, generalizing a classic problem about circles. We give a brief history of the circle problem, an account of…

The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…

In this paper, we prove that a Thue equation F(x,y) = h, where h is an integer and F is a polynomial of degree n with integer coefficients and without repeated roots, has at most 2n^3 - 2n - 3 solutions provided that the Mordell-Weil rank…

We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

Let $A,\;B$ be the positive semidefinite matrices. A matrix version of the famous Powers-St{\o}rmer's inequality $$2Tr(A^\alpha B^{1-\alpha})\geq Tr(A+B-|A-B|),\;\;\;0\leq\alpha\leq 1,$$ was proven by Audenaert et. al. We establish a…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

We use discrete Morse theory to provide another proof of Bernini, Ferrari, and Steingrimson's formula for the Mobius function of the consecutive pattern poset. In addition, we are able to determine the homotopy type of this poset. Earlier,…

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…

Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…