Systems of Generators of Matrix Incidence Algebras over Finite Fields


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

N. Kolegov

Lomonosov Moscow State University

编辑信件的主要联系方式.
Email: na.kolegov@ya.ru
俄罗斯联邦, Moscow

O. Markova

Lomonosov Moscow State University; Moscow Institute of Physics and Technology (State University)

Email: na.kolegov@ya.ru
俄罗斯联邦, Moscow; Dolgoprudny, Moscow Region

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2019