scholarly journals Matrix Representation of Bi-Periodic Jacobsthal Sequence

Author(s):  
Sukran Uygun ◽  
Evans Owusu

In this paper, we bring into light the matrix representation of bi-periodic Jacobsthal sequence, which we shall call the bi-periodic Jacobsthal matrix sequence. We dene it as with initial conditions J0 = I identity matrix, . We obtained the nth general term of this new matrix sequence. By studying the properties of this new matrix sequence, the well-known Cassini or Simpson's formula was obtained. We then proceed to find its generating function as well as the Binet formula. Some new properties and two summation formulas for this new generalized matrix sequence were also given.

Author(s):  
Sukran Uygun ◽  
Evans Owusu

In this study, we bring into light a new generalization of the Jacobsthal Lucas numbers, which shall also be called the bi-periodic Jacobsthal Lucas sequence as   with initial conditions $$\ \hat{c}_{0}=2,\ \hat{c}_{1}=a.$$ The Binet formula as well as the generating function for this sequence are given. The convergence property of the consecutive terms of this sequence is examined after which the well known Cassini, Catalan and the D'ocagne identities as well as some related summation formulas are also given.


1979 ◽  
Vol 101 (3) ◽  
pp. 488-494 ◽  
Author(s):  
T. S. Mruthyunjaya ◽  
M. R. Raghavan

A method based on Bocher’s formulae has been presented for determining the characteristic coefficients (which have recently been suggested [19] as an index of isomorphism) of the matrix associated with the kinematic chain. The method provides an insight into the physical meaning of these coefficients and leads to a possible way of arriving at the coefficients by an inspection of the chain. A modification to the matrix notation is proposed with a view to permit derivation of all possible mechanisms from a kinematic chain and distinguishing the structurally distinct ones. Algebraic tests are presented for determining whether a chain possesses total, partial or fractionated freedom. Finally a generalized matrix notation is proposed to facilitate representation and analysis of multiple-jointed chains.


2021 ◽  
Vol 21 (1) ◽  
pp. 29-38
Author(s):  
MUSTAFA ASCI ◽  
SULEYMAN AYDINYUZ

In this paper, we define and study another interesting generalization of the Fibonacci quaternions is called k-order Fibonacci quaternions. Then we obtain for Fibonacci quaternions, for Tribonacci quaternions and for Tetranacci quaternions. We give generating function, the summation formula and some properties about k-order Fibonacci quaternions. Also, we identify and prove the matrix representation for k-order Fibonacci quaternions. The matrix given for k-order Fibonacci numbers is defined for k-order Fibonacci quaternions and after the matrices with the k-order Fibonacci quaternions is obtained with help of auxiliary matrices, important relationships and identities are established.


2020 ◽  
Vol 35 (1) ◽  
pp. 073
Author(s):  
Arzu Özkoç Öztürk ◽  
Faruk Kaplan

In this work, we introduce bivariate Fibonacci quaternion polynomials andbivariate Lucas quaternion polynomials. We present generating function,Binet formula, matrix representation, binomial formulas and some basicidentities for the bivariate Fibonacci and Lucas quaternion polynomialsequences. Moreover we give various kinds of sums for these quaternionpolynomials.


2021 ◽  
Vol 37 ◽  
pp. 370-386
Author(s):  
Paola Ferrari ◽  
Isabella Furci ◽  
Stefano Serra-Capizzano

In recent years,  motivated by computational purposes, the singular value and spectral features of the symmetrization of Toeplitz matrices generated by a Lebesgue integrable function have been studied. Indeed, under the assumptions that $f$ belongs to $L^1([-\pi,\pi])$ and it has real Fourier coefficients, the spectral and singular value distribution of the matrix-sequence $\{Y_nT_n[f]\}_n$ has been identified, where $n$ is the matrix size, $Y_n$ is the anti-identity matrix, and $T_n[f]$ is the Toeplitz matrix generated by $f$. In this note, the authors consider the multilevel Toeplitz matrix $T_{\bf n}[f]$ generated by $f\in L^1([-\pi,\pi]^k)$, $\bf n$ being a multi-index identifying the matrix-size, and they prove spectral and singular value distribution results for the matrix-sequence $\{Y_{\bf n}T_{\bf n}[f]\}_{\bf n}$ with $Y_{\bf n}$ being the corresponding tensorization of the anti-identity matrix.


2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jorge Luis Arroyo Neri ◽  
Armando Sánchez-Nungaray ◽  
Mauricio Hernández Marroquin ◽  
Raquiel R. López-Martínez

We introduce the so-called extended Lagrangian symbols, and we prove that the C ∗ -algebra generated by Toeplitz operators with these kind of symbols acting on the homogeneously poly-Fock space of the complex space ℂ n is isomorphic and isometric to the C ∗ -algebra of matrix-valued functions on a certain compactification of ℝ n obtained by adding a sphere at the infinity; moreover, the matrix values at the infinity points are equal to some scalar multiples of the identity matrix.


2010 ◽  
Vol 21 (02) ◽  
pp. 145-155 ◽  
Author(s):  
P. ROMÁN ◽  
S. SIMONDI

The matrix valued analog of the Euler's hypergeometric differential equation was introduced by Tirao in [4]. This equation arises in the study of matrix valued spherical functions and in the theory of matrix valued orthogonal polynomials. The goal of this paper is to extend naturally the number of parameters of Tirao's equation in order to get a generalized matrix valued hypergeometric equation. We take advantage of the tools and strategies developed in [4] to identify the corresponding matrix hypergeometric functions nFm. We prove that, if n = m + 1, these functions are analytic for |z| < 1 and we give a necessary condition for the convergence on the unit circle |z| = 1.


Sign in / Sign up

Export Citation Format

Share Document