Autor:	Yang Shang-jun
Rok vydání:	1992
Předmět:	Combinatorics Set (abstract data type) Numerical Analysis Matrix (mathematics) Algebra and Number Theory Integer Prime number Exponent Discrete Mathematics and Combinatorics Geometry and Topology Upper and lower bounds Mathematics
Zdroj:	Linear Algebra and its Applications. 171:187-196
ISSN:	0024-3795
DOI:	10.1016/0024-3795(92)90258-c
Popis:	We obtain a lower bound for e(n), the least integer (greater than or equal to 5) that is not the exponent of any nXn primitive, nearly reducible matrix. The main result is that under certain hypotheses about the distance between n and the nearest prime number we have that e(n)>n2⧸3.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09511ff4e3f695da4abb4ad4651191df https://doi.org/10.1016/0024-3795(92)90258-c Zobrazit plný text záznamu