Systems of Generators of Matrix Incidence Algebras over Finite Fields

The paper studies two numerical characteristics of matrix incidence algebras over finite fields associated with generating sets of such algebras: the minimal cardinality of a generating set and the length of an algebra. Generating sets are understood in the usual sense, the identity of the algebra b...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2019-08, Vol.240 (6), p.783-798
Main Authors: Kolegov, N. A., Markova, O. V.
Format: Article
Language:English
Subjects:
Algebra
Fields (mathematics)
Generators
Incidence
Mathematics
Mathematics and Statistics
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper studies two numerical characteristics of matrix incidence algebras over finite fields associated with generating sets of such algebras: the minimal cardinality of a generating set and the length of an algebra. Generating sets are understood in the usual sense, the identity of the algebra being considered a word of length 0 in generators, and also in the strict sense, where this assumption is not used. A criterion for a subset to generate an incidence algebra in the strict sense is obtained. For all matrix incidence algebras, the minimum cardinality of a generating set and a generating set in the strict sense are determined as functions of the field cardinality and the order of the matrices. Some new results on the lengths of such algebras are obtained. In particular, the length of the algebra of “almost” diagonal matrices is determined, and a new upper bound for the length of an arbitrary matrix incidence algebra is obtained.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-019-04396-6