Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions

100%
Hong S., Hu S., Hong S.
Open Mathematics
|
2016
|
tom 14
|
nr 1
146-155
EN
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]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime gcd-closed sets (i.e., S equals the union of S1, …, Sk with k ≥ 1 being an integer and S1, …, Sk being gcd-closed sets such that (lcm(Si), lcm(Sj)) = 1 for all 1 ≤ i ≠ j ≤ k). This extends the Bourque-Ligh, Hong’s and the Hong-Loewy formulas obtained in 1993, 2002 and 2011, respectively. It also generalizes the famous Smith’s determinant.
2
Content available remote

The k-Fibonacci matrix and the Pascal matrix

100%
Falcon S.
Open Mathematics
|
2011
|
tom 9
|
nr 6
1403-1410
EN
We define the k-Fibonacci matrix as an extension of the classical Fibonacci matrix and relationed with the k-Fibonacci numbers. Then we give two factorizations of the Pascal matrix involving the k-Fibonacci matrix and two new matrices, L and R. As a consequence we find some combinatorial formulas involving the k-Fibonacci numbers.
3
Content available remote

On the arrowhead-Fibonacci numbers

84%
Gültekin I., Deveci Ö.
Open Mathematics
|
2016
|
tom 14
|
nr 1
1104-1113
EN
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. Also, we study the arrowhead-Fibonacci sequence modulo m and we obtain the cyclic groups from the generating matrix of the arrowhead-Fibonacci numbers when read modulo m. Then we derive the relationships between the orders of the cyclic groups obtained and the periods of the arrowhead-Fibonacci sequence modulo m.
4
Content available remote

Fibonacci and Telephone Numbers in Extremal Trees

84%
Bednarz U., Włoch I.
Discussiones Mathematicae Graph Theory
|
2017
|
tom 38
|
nr 1
121-133
EN
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. We show connections between these numbers and Fibonacci numbers as well as the telephone numbers.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.