Matrix semigroups with constant spectral radius
Linear Algebra and its Applications, ISSN: 0024-3795, Vol: 513, Page: 376-408
2017
- 11Citations
- 4Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized by means of irreducible ones. Each irreducible c.s.r. semigroup defines walks on Euclidean sphere, all its nonsingular elements are similar (in the same basis) to orthogonal. We classify all nonnegative c.s.r. semigroups and arbitrary low-dimensional semigroups. For higher dimensions, we describe five classes and leave an open problem on completeness of that list. The problem of algorithmic recognition of c.s.r. property is proved to be polynomially solvable for irreducible semigroups and undecidable for reducible ones.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0024379516304864; http://dx.doi.org/10.1016/j.laa.2016.10.013; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84994339637&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0024379516304864; https://api.elsevier.com/content/article/PII:S0024379516304864?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0024379516304864?httpAccept=text/plain; https://dul.usage.elsevier.com/doi/; https://dx.doi.org/10.1016/j.laa.2016.10.013
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know