Powers of a Matrix with Coefficients in a Boolean Ring
Copyright policy )Powers of a Matrix with Coefficients in a Boolean Ring
The best possible integer u n {u_n} such that f u n = 1 {f^{{u_n}}} = 1 , if f f is an invertible n × n n \times n matrix with coefficients in a Boolean ring, is determined. The period of linear recursive sequences in a Boolean ring (e.g. the trace sequence { Tr f k } 1 ∞ \{ \operatorname {Tr} {f^k}\} _1^\infty ) is computed.
Matrices over special rings (quaternions, finite fields, etc.), Matrix equations and identities, Structure theory of Boolean algebras
Matrices over special rings (quaternions, finite fields, etc.), Matrix equations and identities, Structure theory of Boolean algebras
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!