Related papers: Generating Trees and Fibonacci Polyominoes

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this chapter we generalize that result. Let a p-column polyomino be a polyomino whose columns…

In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…

A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…

In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…

We establish new connection formulae between Fibonacci polynomials and Chebyshev polynomials of the first and second kinds. These formulae are expressed in terms of certain values of hypergeometric functions of the type 2F1. Consequently,…

In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. Moreover, we associate to this family of words a family of curves, which have fractal properties, in…

Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

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…

We prove a Faa di Bruno formula for the Green function in the bialgebra of P-trees, for any polynomial endofunctor P. The formula appears as relative homotopy cardinality of an equivalence of groupoids.

This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…