English
Related papers

Related papers: On Isomorphism Classes of Generalized Fibonacci Cu…

200 papers

In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…

Combinatorics · Mathematics 2010-09-17 Milan Janjic

The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…

Combinatorics · Mathematics 2019-09-17 C. Dalfó , M. A. Fiol

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

Combinatorics · Mathematics 2025-03-27 Carmelo Cisto , Francesco Navarra

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Combinatorics · Mathematics 2018-03-29 M. R. Emamy-K. , Bahman Kalantari , Tatiana Correa

The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…

Combinatorics · Mathematics 2021-02-09 Michel Mollard

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien

Let $k\geq2$. Then the $k$-th order Fibonacci cube $\Gamma^{(k)}_{n}$ is the subgraph of the hypercube $Q_{n}$ induced by vertices without $k$ consecutive $1$s. The case $k=2$ corresponds to the classic Fibonacci cube $\Gamma_{n}$. There…

Combinatorics · Mathematics 2026-01-27 Jianxin Wei , Yujun Yang

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…

Combinatorics · Mathematics 2013-07-30 Tewodros Amdeberhan , Xi Chen , Victor H. Moll , Bruce E. Sagan

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

Rings and Algebras · Mathematics 2020-09-14 Samuel A. Lopes , Farrokh Razavinia

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 have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…

History and Overview · Mathematics 2017-07-31 Merve Özvatan , Oktay K. Pashaev

For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…

Combinatorics · Mathematics 2015-08-11 Christian Jäkel

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

Commutative Algebra · Mathematics 2021-09-08 Eszter Gselmann

We present a method for tabulating all cubic function fields over $\mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $\mathbb{F}_{q}^*$, up to a given bound…

Number Theory · Mathematics 2011-07-20 Pieter Rozenhart , Michael Jacobson , Renate Scheidler

Let $G$ be a connected reductive algebraic group defined over the finite field $\F_q$, where $q$ is a power of a good prime for $G$, and let $F$ denote the corresponding Frobenius endomorphism, so that $G^F$ is a finite reductive group. Let…

Representation Theory · Mathematics 2011-08-09 Matthew C. Clarke

The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…

Number Theory · Mathematics 2015-05-21 Stéphane Legendre

Let X $\subseteq$ {0, 1} n. Then the daisy cube Q n (X) is introduced as the sub-graph of Q n induced by the intersection of the intervals I(x, 0 n) over all x $\in$ X. Daisy cubes are partial cubes that include Fibonacci cubes, Lucas…

Combinatorics · Mathematics 2017-05-25 Sandi Klavžar , Michel Mollard

Daisy cubes are a recently introduced class of isometric subgraphs of hypercubes $Q_n$. They are induced with intervals between chosen vertices of $Q_n$ and the vertex $0^n\in V(Q_n)$. In this paper we characterize daisy cubes in terms of…

Combinatorics · Mathematics 2019-05-20 Andrej Taranenko

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Algebraic Geometry · Mathematics 2015-01-20 Vladimir L. Popov

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

Number Theory · Mathematics 2021-07-01 Martin Bunder , Joseph Tonien