Systems of generators of matrix incidence algebras over finite fields

DOI10.1007/s10958-019-04396-6zbMath1428.16028OpenAlexW2955359602MaRDI QIDQ2278183

N. A. Kolegov, O. V. Markova

Publication date: 3 December 2019

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-019-04396-6

zbMATH Keywords

generating setsmatrix incidence algebras

Mathematics Subject Classification ID

Endomorphism rings; matrix rings (16S50)

Related Items

The lengths of matrix incidence algebras over small finite fields, On the lengths of group algebras of finite abelian groups in the semi-simple case, An example of length computation for a group algebra of a noncyclic abelian group in the modular case, On the lengths of matrix incidence algebras with radicals of square zero, On generators of incidence rings over finite posets, On real algebras generated by positive and nonnegative matrices, Upper bounds for the length of non-associative algebras

Cites Work

• The effect of assuming the identity as a generator on the length of the matrix algebra
• Lengths of quasi-commutative pairs of matrices
• Reducibility theorems for pairs of matrices as rational criteria
• A resolution of Paz's conjecture in the presence of a nonderogatory matrix
• Burnside's theorem for matrix rings over division rings
• The simplest proof of Burnside's theorem on matrix algebras
• Length realizability for pairs of quasi-commuting matrices
• On the relationship between the length of an algebra and the index of nilpotency of its Jacobson radical.
• Incidence functions as generalized arithmetic functions. I
• On the lengths of irreducible pairs of complex matrices
• An application of the Cayley-Hamilton theorem to matrix polynomials in several variables
• Isomorphisms of formal matrix incidence rings
• Upper bound for the length of commutative algebras
• Minimal generating sets of groups, rings, and fields
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item