scholarly journals Matrix Manipulations for Properties of Pell p-Numbers and their Generalizations

2020 ◽  
Vol 28 (3) ◽  
pp. 89-102
Author(s):  
Özgür Erdağ ◽  
Ömür Deveci ◽  
Anthony G. Shannon
Keyword(s):  
Binet Formula ◽  
Generating Matrix ◽  
Combinatorial Representation

AbstractIn this paper, we define the Pell-Pell p-sequence and then we discuss the connection of the Pell-Pell p-sequence with Pell and Pell p-sequences. Also, we provide a new Binet formula and a new combinatorial representation of the Pell-Pell p-numbers by the aid of the nth power of the generating matrix the Pell-Pell p-sequence. Furthermore, we obtain an exponential representation of the Pell-Pell p-numbers and we develop relationships between the Pell-Pell p-numbers and their permanent, determinant and sums of certain matrices.

scholarly journals On the connections between Pell numbers and Fibonacci p-numbers

2021 ◽  
Vol 27 (1) ◽  
pp. 148-160
Author(s):  
Anthony G. Shannon ◽  
◽  
Özgür Erdağ ◽  
Ömür Deveci ◽  
◽  
...  
Keyword(s):  
Pell Numbers ◽  
Binet Formula ◽  
Generating Matrix ◽  
Combinatorial Representation

In this paper, we define the Fibonacci–Pell p-sequence and then we discuss the connection of the Fibonacci–Pell p-sequence with the Pell and Fibonacci p-sequences. Also, we provide a new Binet formula and a new combinatorial representation of the Fibonacci–Pell p-numbers by the aid of the n-th power of the generating matrix of the Fibonacci–Pell p-sequence. Furthermore, we derive relationships between the Fibonacci–Pell p-numbers and their permanent, determinant and sums of certain matrices.

scholarly journals Perrin’s bivariate and complex polynomials

2021 ◽  
Vol 27 (2) ◽  
pp. 70-78
Author(s):  
Renata Passos Machado Vieira ◽  
Milena Carolina dos Santos Mangueira ◽  
Francisco Regis Vieira Alves ◽  
Paula Maria Machado Cruz Catarino
Keyword(s):  
Generating Function ◽  
Complex Polynomials ◽  
Bivariate Polynomials ◽  
Binet Formula ◽  
Generating Matrix ◽  
Definition Of

In this article, a study is carried out around the Perrin sequence, these numbers marked by their applicability and similarity with Padovan’s numbers. With that, we will present the recurrence for Perrin’s polynomials and also the definition of Perrin’s complex bivariate polynomials. From this, the recurrence of these numbers, their generating function, generating matrix and Binet formula are defined.

scholarly journals Generating matrix of the bi-periodic Lucas numbers

2017 ◽  
Author(s):  
Arzu Coskun ◽  
Necati Taskara
Keyword(s):  
Lucas Numbers ◽  
Generating Matrix

scholarly journals Combinatorial Expansions in $K$-Theoretic Bases

10.37236/2320 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Jason Bandlow ◽  
Jennifer Morse
Keyword(s):  
Generating Functions ◽  
Symmetric Functions ◽  
Schur Functions ◽  
Geometric Information ◽  
Combinatorial Description ◽  
Littlewood Polynomials ◽  
Stanley Symmetric Functions ◽  
K Theory ◽  
Combinatorial Representation

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape.  Included in this class are the Hall-Littlewood polynomials, $k$-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur functions represent the cohomology of the Grassmannian variety of $GL_n$, Grothendieck functions $\{G_\lambda\}$ represent the $K$-theory of the same space.  In this paper, we give a combinatorial description of the coefficients when any element of $\mathcal C$ is expanded in the $G$-basis or the basis dual to $\{G_\lambda\}$.

scholarly journals Symmetric Functions for the Generating Matrix of the Yangian of $\mathfrak{gl}_n({\Bbb C})$

10.37236/217 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Natasha Rozhkovskaya
Keyword(s):  
Symmetric Functions ◽  
Combinatorial Identities ◽  
Schur Polynomials ◽  
Generating Matrix

Analogues of classical combinatorial identities for elementary and homogeneous symmetric functions with coefficients in the Yangian are proved. As a corollary, similar relations are deduced for shifted Schur polynomials.

scholarly journals On Generalization of Fibonacci, Lucas and Mulatu Numbers

2020 ◽  
Vol 1 (3) ◽  
pp. 112-122
Author(s):  
Agung Prabowo
Keyword(s):  
Continued Fraction ◽  
Golden Ratio ◽  
Fibonacci Numbers ◽  
Lucas Numbers ◽  
Binet Formula

Fibonacci numbers, Lucas numbers and Mulatu numbers are built in the same method. The three numbers differ in the first term, while the second term is entirely the same. The next terms are the sum of two successive terms. In this article, generalizations of Fibonacci, Lucas and Mulatu (GFLM) numbers are built which are generalizations of the three types of numbers. The Binet formula is then built for the GFLM numbers, and determines the golden ratio, silver ratio and Bronze ratio of the GFLM numbers. This article also presents generalizations of these three types of ratios, called Metallic ratios. In the last part we state the Metallic ratio in the form of continued fraction and nested radicals.

COMBINATORIAL APPROACH TO COMPUTING COMPONENT IMPORTANCE INDEXES IN COHERENT SYSTEMS

2011 ◽  
Vol 26 (1) ◽  
pp. 117-128 ◽  
Author(s):  
Ilya B. Gertsbakh ◽  
Yoseph Shpungin
Keyword(s):  
System Reliability ◽  
Simple Formula ◽  
Analytic Formula ◽  
Importance Measure ◽  
Coherent Systems ◽  
Joint Reliability ◽  
Component Importance ◽  
Definition Of ◽  
Combinatorial Parameter ◽  
Combinatorial Representation

We consider binary coherent systems with independent binary components having equal failure probability q. The system DOWN probability is expressed via its signature's combinatorial analogue, the so-called D-spectrum. Using the definition of the Birnbaum importance measure (BIM), we introduce for each component a new combinatorial parameter, so-called BIM-spectrum, and develop a simple formula expressing component BIM via the component BIM-spectrum. Further extension of this approach allows obtaining a combinatorial representation for the joint reliability importance (JRI) of two components. To estimate component BIMs and JRIs, there is no need to know the analytic formula for system reliability. We demonstrate how our method works using the Monte Carlo approach. We present several examples of estimating component importance measures in a network when the DOWN state is defined as the loss of terminal connectivity.

Sign in / Sign up

Export Citation Format

Share Document