Lucas sequences and traces of matrix products

Research output: Contribution to journalArticle

Abstract

Given two noncommuting matrices, A and B, it is well-known that AB and BA have the same trace. This extends to cyclic permutations of products of A's and B's. Thus if A and B are fixed matrices, then products of two A's and four B's can have three possible traces. For 2 × 2 matrices A and B, we show that there are restrictions on the relative sizes of these traces. For example, if M1 = AB2AB2, M2 = ABAB3, and M3 = A2B4, then it is never the case that Tr(M2) > Tr(M3) > Tr(M1), but the other five orderings of the traces can occur. By utilizing the connection between Lucas sequences and powers of a 2×2 matrix, a formula is given for the number of orderings of the traces that can occur in products of two A's and n B's.

Original languageEnglish (US)
Pages (from-to)200-211
Number of pages12
JournalFibonacci Quarterly
Volume56
Issue number3
StatePublished - Aug 1 2018

Fingerprint

Lucas sequence
Matrix Product
Trace
Permutation
Restriction

Cite this

Lucas sequences and traces of matrix products. / Greene, John R.

In: Fibonacci Quarterly, Vol. 56, No. 3, 01.08.2018, p. 200-211.

Research output: Contribution to journalArticle

@article{8618a241685344a9bdcf4d0a2a9d1118,
title = "Lucas sequences and traces of matrix products",
abstract = "Given two noncommuting matrices, A and B, it is well-known that AB and BA have the same trace. This extends to cyclic permutations of products of A's and B's. Thus if A and B are fixed matrices, then products of two A's and four B's can have three possible traces. For 2 × 2 matrices A and B, we show that there are restrictions on the relative sizes of these traces. For example, if M1 = AB2AB2, M2 = ABAB3, and M3 = A2B4, then it is never the case that Tr(M2) > Tr(M3) > Tr(M1), but the other five orderings of the traces can occur. By utilizing the connection between Lucas sequences and powers of a 2×2 matrix, a formula is given for the number of orderings of the traces that can occur in products of two A's and n B's.",
author = "Greene, {John R}",
year = "2018",
month = "8",
day = "1",
language = "English (US)",
volume = "56",
pages = "200--211",
journal = "Fibonacci Quarterly",
issn = "0015-0517",
publisher = "Fibonacci Association",
number = "3",

}

TY - JOUR

T1 - Lucas sequences and traces of matrix products

AU - Greene, John R

PY - 2018/8/1

Y1 - 2018/8/1

N2 - Given two noncommuting matrices, A and B, it is well-known that AB and BA have the same trace. This extends to cyclic permutations of products of A's and B's. Thus if A and B are fixed matrices, then products of two A's and four B's can have three possible traces. For 2 × 2 matrices A and B, we show that there are restrictions on the relative sizes of these traces. For example, if M1 = AB2AB2, M2 = ABAB3, and M3 = A2B4, then it is never the case that Tr(M2) > Tr(M3) > Tr(M1), but the other five orderings of the traces can occur. By utilizing the connection between Lucas sequences and powers of a 2×2 matrix, a formula is given for the number of orderings of the traces that can occur in products of two A's and n B's.

AB - Given two noncommuting matrices, A and B, it is well-known that AB and BA have the same trace. This extends to cyclic permutations of products of A's and B's. Thus if A and B are fixed matrices, then products of two A's and four B's can have three possible traces. For 2 × 2 matrices A and B, we show that there are restrictions on the relative sizes of these traces. For example, if M1 = AB2AB2, M2 = ABAB3, and M3 = A2B4, then it is never the case that Tr(M2) > Tr(M3) > Tr(M1), but the other five orderings of the traces can occur. By utilizing the connection between Lucas sequences and powers of a 2×2 matrix, a formula is given for the number of orderings of the traces that can occur in products of two A's and n B's.

UR - http://www.scopus.com/inward/record.url?scp=85052060298&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052060298&partnerID=8YFLogxK

M3 - Article

VL - 56

SP - 200

EP - 211

JO - Fibonacci Quarterly

JF - Fibonacci Quarterly

SN - 0015-0517

IS - 3

ER -