Affordable Access

Publisher Website

A note on the exponent set of primitive minimally strong digraphs

Authors
Journal
Linear Algebra and its Applications
0024-3795
Publisher
Elsevier
Publication Date
Volume
171
Identifiers
DOI: 10.1016/0024-3795(92)90258-c

Abstract

Abstract We obtain a lower bound for e( n), the least integer (greater than or equal to 5) that is not the exponent of any nX n 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)> n 2⧸3.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

The local exponent sets of primitive digraphs

on Linear Algebra and its Applica... Jan 01, 2000

On the exponent of a primitive, minimally strong d...

on Linear Algebra and its Applica... Jan 01, 1988

Bounds on the local bases of primitive, non-powerf...

on Linear Algebra and its Applica... Jan 01, 2009

Primitive digraphs with smallest large exponent

on Linear Algebra and its Applica... Jan 01, 2008
More articles like this..