A253950
Number of finite, negative, totally ordered monoids of size n (semigroups with a neutral element that is also the top element).
Original entry on oeis.org
1, 1, 2, 8, 44, 308, 2641, 27120, 332507, 5035455
Offset: 1
- Eric Babson, Moon Duchin, Annina Iseli, Pietro Poggi-Corradini, Dylan Thurston, and Jamie Tucker-Foltz, Models of random spanning trees, arXiv:2407.20226 [cs.DM], 2024. See p. 9.
- M. Petrík, GitLab repository with an implementation of the algorithm in Python 3
- M. Petrík, Many-Valued Conjunctions. Habilitation thesis, Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic. Submitted in 2020. Available at Czech Technical University Digital Library.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite tomonoids and free pomonoids. Semigroup Forum 99 (2019) 345-367. DOI: 10.1007/s00233-018-9972-z.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite, negative tomonoids. Journal of Logic and Computation 27 (2017) 337-356. DOI: 10.1093/logcom/exv047.
- M. Petrík and Th. Vetterlein, Algorithm to generate finite negative totally ordered monoids. In: IPMU 2016: 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems. Eindhoven, Netherlands, June 20-24, 2016.
- M. Petrík and Th. Vetterlein, Algorithm to generate the Archimedean, finite, negative tomonoids. In: Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems. Kitakyushu, Japan, Dec. 3-6, 2014. DOI: 10.1109/SCIS-ISIS.2014.7044822.
- Index entries for sequences related to monoids
A253948
Number of finite, negative, Archimedean, commutative, totally ordered monoids of size n (semi-groups with a neutral element that is also the top element).
Original entry on oeis.org
1, 1, 1, 2, 6, 22, 95, 471, 2670, 17387, 131753, 1184059, 12896589
Offset: 1
- M. Petrík, GitLab repository with an implementation of the algorithm in Python 3
- M. Petrík, Many-Valued Conjunctions. Habilitation thesis, Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic. Submitted in 2020. Available at Czech Technical University Digital Library.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite tomonoids and free pomonoids. Semigroup Forum 99 (2019) 345-367. DOI: 10.1007/s00233-018-9972-z.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite, negative tomonoids. Journal of Logic and Computation 27 (2017) 337-356. DOI: 10.1093/logcom/exv047.
- M. Petrík and Th. Vetterlein, Algorithm to generate finite negative totally ordered monoids. In: IPMU 2016: 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems. Eindhoven, Netherlands, June 20-24, 2016.
- M. Petrík and Th. Vetterlein, Algorithm to generate the Archimedean, finite, negative tomonoids. In: Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems. Kitakyushu, Japan, Dec. 3-6, 2014. DOI: 10.1109/SCIS-ISIS.2014.7044822.
- Index entries for sequences related to monoids
A253949
Number of finite, negative, Archimedean, totally ordered monoids of size n (semi-groups with a neutral element that is also the top element).
Original entry on oeis.org
1, 1, 1, 2, 8, 44, 333, 3543, 54954, 1297705, 47542371
Offset: 1
- M. Petrík, GitLab repository with an implementation of the algorithm in Python 3
- M. Petrík, Many-Valued Conjunctions. Habilitation thesis, Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic. Submitted in 2020. Available at Czech Technical University Digital Library.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite tomonoids and free pomonoids. Semigroup Forum 99 (2019) 345-367. DOI: 10.1007/s00233-018-9972-z.
- M. Petrík and Th. Vetterlein, Rees coextensions of finite, negative tomonoids. Journal of Logic and Computation 27 (2017) 337-356. DOI: 10.1093/logcom/exv047.
- M. Petrík and Th. Vetterlein, Algorithm to generate finite negative totally ordered monoids. In: IPMU 2016: 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems. Eindhoven, Netherlands, June 20-24, 2016.
- M. Petrík and Th. Vetterlein, Algorithm to generate the Archimedean, finite, negative tomonoids. In: Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems. Kitakyushu, Japan, Dec. 3-6, 2014. DOI: 10.1109/SCIS-ISIS.2014.7044822.
- Index entries for sequences related to monoids
A034786
Number of linearly ordered Girard monoids of size n; number of t-norms on an n-chain inducing an involutive residual negator.
Original entry on oeis.org
1, 1, 1, 2, 3, 7, 12, 31, 59, 161, 329, 944, 2067, 6148, 14558, 44483, 116372
Offset: 1
Bernard De Baets (Bernard.DeBaets(AT)rug.ac.be), Mike Nachtegael (mike.nachtegael(AT)rug.ac.be)
- M. Nachtegael, The Dizzy Number of Fuzzy Implication Operators on Finite Chains, in "Fuzzy Logic and Intelligent Technologies for Nuclear Science and Industry", ed. Ruan D., Abderrahim H., D'hondt P., Kerre E., 1998, pp. 29-35.
Showing 1-4 of 4 results.
Comments