The best possible integer un such that fun = 1, if f is an invertible n × n matrix with coefficients in a Boolean ring, is determined. The period of linear recursive sequences in a Boolean ring (e.g.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback