Results 1 to 10 of about 52 (51)
Given a real number a ≥ 1, let Kn(a) be the set of all n × n unit lower triangular matrices with each element in the interval [−a, a]. Denoting by λn(·) the smallest eigenvalue of a given matrix, let cn(a) = min {λ n(YYT) : Y ∈ Kn(a)}.
Altınışık Ercan
doaj +1 more source
Enumeration of weighted paths on a digraph and block hook determinant
In this article, we evaluate determinants of “block hook” matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely.
Bera Sudip
doaj +1 more source
Determinants of some Hessenberg matrices with generating functions
In this paper, we derive some relationships between the determinants of some special lower Hessenberg matrices whose entries are the terms of certain sequences and the generating functions of these sequences.
Leerawat Utsanee, Daowsud Katthaleeya
doaj +1 more source
On identities involving generalized harmonic, hyperharmonic and special numbers with Riordan arrays
In this paper, by means of the summation property to the Riordan array, we derive some identities involving generalized harmonic, hyperharmonic and special numbers.
Koparal Sibel, Ömür Neşe, Duran Ömer
doaj +1 more source
Generating functions for a lattice path model introduced by Deutsch
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size −3, −5, −7, . . . . For such paths, we find the generating functions of them, according to length, ending at level i, both, when ...
Prodinger Helmut
doaj +1 more source
On Generalized Jacobsthal and Jacobsthal–Lucas Numbers
Jacobsthal numbers and Jacobsthal–Lucas numbers are some of the most studied special integer sequences related to the Fibonacci numbers. In this study, we introduce one parameter generalizations of Jacobsthal numbers and Jacobsthal–Lucas numbers.
Bród Dorota, Michalski Adrian
doaj +1 more source
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S= {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]
Hong Siao, Hu Shuangnian, Hong Shaofang
doaj +1 more source
On Generalized Jacobsthal and Jacobsthal-Lucas polynomials
In this paper we introduce a generalized Jacobsthal and Jacobsthal-Lucas polynomials, Jh,n and jh,n, respectively, that consist on an extension of Jacobsthal's polynomials Jn(𝑥) and Jacobsthal-Lucas polynomials jn(𝑥).
Catarino Paula, Morgado Maria Luisa
doaj +1 more source
Fibonacci and Telephone Numbers in Extremal Trees
In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particular we determine the successive extremal graphs in the class of trees with respect to the number of (A, 2B)-edge colourings.
Bednarz Urszula, Włoch Iwona
doaj +1 more source
On the arrowhead-Fibonacci numbers
In this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties.
Gültekin Inci, Deveci Ömür
doaj +1 more source

