中文
相关论文

相关论文: Factorizations of the Fibonacci Infinite Word

200 篇论文

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

环与代数 · 数学 2014-09-04 Sophie Frisch

The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…

数论 · 数学 2018-11-19 Burak Kurt , Yilmaz Simsek

Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…

We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…

组合数学 · 数学 2018-02-26 Caius Wojcik

We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered…

形式语言与自动机理论 · 计算机科学 2013-03-19 Hamoon Mousavi , Jeffrey Shallit

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…

动力系统 · 数学 2018-02-26 Carlos Gustavo Moreira , Christian Mauduit

Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Pascal Weil

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist…

形式语言与自动机理论 · 计算机科学 2018-05-28 Gabriele Fici , Antonio Restivo , Laura Rizzo

We present a proof of a conjecture of Goh and Wildberger on the factorization of the spread polynomials. We indicate how the factors can be effectively calculated and exhibit a connection to the factorization of Fibonacci numbers into…

数论 · 数学 2024-12-30 Johann Cigler , Hans-Christian Herbig

The aim of this paper is to further study some properties and identities on the degenerate Fubini and the degenerate Bell polynomials which are degenerate versions of the Fubini and the Bell polynomials, respectively. Especially, we find…

数论 · 数学 2022-03-02 Taekyun Kim , Dae san Kim

We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.

组合数学 · 数学 2007-05-23 S. Kitaev , T. Mansour

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

组合数学 · 数学 2022-08-03 Harold R. Parks , Dean C. Wills

The article shows how the factorization of an arbitrary Lorentz transformation is performed. That is, representation of an arbitrary Lorentz transformation as a sequence of spatial rotation and boost or boost and spatial rotation. Relations…

经典物理 · 物理学 2023-02-07 Konstantin Karplyuk , Myroslav Kozak , Oleksandr Zhmudskyy

Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.

环与代数 · 数学 2007-05-23 Mario Catalani

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

数论 · 数学 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

组合数学 · 数学 2008-05-06 Johann Cigler

In this thesis we examined mathematical properties of Fibonacci numbers and applications of this numbers in the nature,geometry and economy.We obtained Golden section and proved some mathematical identities using Golden section. Infinity of…

历史与综述 · 数学 2013-01-29 Erdoğan Şen

The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…

综合数学 · 数学 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

In this paper we focus on finding all the factorials expressible as a product of a fixed number of $2k$-nacci numbers with $k \geq 2$. We derive the 2-adic valuation of the $2k$-nacci sequence and use it to establish bounds on the solutions…

数论 · 数学 2017-02-21 Bartosz Sobolewski