Abstract
Let pn be the maximal sum of the entries of A2, where A is a square matrix of size n, consisting of the numbers 1, 2, . . ., n2, each appearing exactly once. We prove that pn = Θ(n7). More precisely, we show that n(240n6 + 28n5 + 364n4 + 210n2 − 28n + 26 − 105((−1)n + 1))/840 ≤ pn ≤ n3(n2 + 1)(7n2 + 5)/24.
Original language | English |
---|---|
Journal | Art of Discrete and Applied Mathematics |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 University of Primorska. All rights reserved.
Keywords
- Matrix power
- maximal entries sum
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics