Some formulas for the smallest number of generators for finite direct sums of matrix algebras

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages. We found the generating function for gen_{m,2}(q), and we added an appendix containing a 2-generator presentation fo

Scientific paper

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also obtain an exact formula for the smallest number of generators for a finite direct sum of 2-by-2 matrix algebras with entries in a finite field and as a consequence obtain a formula for a similar quantity for a finite direct sum of 2-by-2 integer matrix rings. We remark that a generating set the ring $\bigoplus_{i=1}^k M_{n_i}(\mathbb{Z})^{n_i}$ may be used as a generating set of any matrix algebra $\bigoplus_{i=1}^k M_{n_i}(R)^{n_i}$ where $R$ is an associative ring with a two-sided 1.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Some formulas for the smallest number of generators for finite direct sums of matrix algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some formulas for the smallest number of generators for finite direct sums of matrix algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some formulas for the smallest number of generators for finite direct sums of matrix algebras will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-368718

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.