A346686 Minimal number of generators of the monoid of n X n Boolean matrices.

2, 3, 5, 7, 13, 68, 2142, 459153

Offset

1,1

Links

Table of n, a(n) for n=1..8.

F. Hivert, J. D. Mitchell, F. L. Smith, and W. A. Wilson, Minimal generating sets for matrix monoids, arXiv:2012.10323 [math.RA], 2020, p. 7.

Tomáš Masopust and Petr Osička, On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems, arXiv:2402.17000 [cs.FL], 2024. See p. 4.

Tomáš Masopust and Petr Osička, On Algorithms verifying Initial-and-Final-State Opacity: Complexity, Special Cases, and Comparison, Palacky Univ. Olomouc (Czechia, 2024). See p. 3.

Yaroslav Shitov, Almost all boolean matrices are prime, ResearchGate (2024).

Crossrefs

Cf. A346687.

Sequence in context: A250407 A055694 A249797 * A309249 A294727 A348352

Adjacent sequences: A346683 A346684 A346685 * A346687 A346688 A346689

Keyword

nonn,more,hard

Author

James Mitchell, Jul 29 2021

Status

approved