login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253949 Number of finite, negative, Archimedean, totally ordered monoids of size n (semi-groups with a neutral element that is also the top element). 2

%I #32 May 28 2021 02:51:20

%S 1,1,1,2,8,44,333,3543,54954,1297705,47542371

%N Number of finite, negative, Archimedean, totally ordered monoids of size n (semi-groups with a neutral element that is also the top element).

%C The terms have been computed using the algorithm described in the referenced papers.

%H M. Petrík, <a href="https://gitlab.com/petrikm/fntom">GitLab repository with an implementation of the algorithm in Python 3</a>

%H M. Petrík, <a href="https://gitlab.com/petrikm/fntom/-/blob/master/papers/Petrik__Habilitation_Thesis.pdf">Many-Valued Conjunctions</a>. Habilitation thesis, Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic. Submitted in 2020. Available at <a href="https://dspace.cvut.cz/handle/10467/91539">Czech Technical University Digital Library</a>.

%H M. Petrík and Th. Vetterlein, <a href="https://gitlab.com/petrikm/fntom/-/blob/master/papers/Petrik_Vetterlein__Pomonoids__preprint.pdf">Rees coextensions of finite tomonoids and free pomonoids</a>. Semigroup Forum 99 (2019) 345-367. DOI: <a href="https://doi.org/10.1007/s00233-018-9972-z">10.1007/s00233-018-9972-z</a>.

%H M. Petrík and Th. Vetterlein, <a href="https://gitlab.com/petrikm/fntom/-/blob/master/papers/Petrik_Vetterlein__Coextensions__preprint.pdf">Rees coextensions of finite, negative tomonoids</a>. Journal of Logic and Computation 27 (2017) 337-356. DOI: <a href="https://doi.org/10.1093/logcom/exv047">10.1093/logcom/exv047</a>.

%H M. Petrík and Th. Vetterlein, <a href="https://gitlab.com/petrikm/fntom/-/blob/master/papers/Petrik_Vetterlein__IPMU_2016__preprint.pdf">Algorithm to generate finite negative totally ordered monoids</a>. In: IPMU 2016: 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems. Eindhoven, Netherlands, June 20-24, 2016.

%H M. Petrík and Th. Vetterlein, <a href="https://gitlab.com/petrikm/fntom/-/blob/master/papers/Petrik_Vetterlein__SCIS_ISIS_2014__preprint.pdf">Algorithm to generate the Archimedean, finite, negative tomonoids</a>. 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: <a href="https://doi.org/10.1109/SCIS-ISIS.2014.7044822">10.1109/SCIS-ISIS.2014.7044822</a>.

%H <a href="/index/Mo#monoids">Index entries for sequences related to monoids</a>

%Y Cf. A058129, A030453, A253948, A253950.

%K nonn,hard,more

%O 1,4

%A _Milan Petrík_, Jan 20 2015

%E a(11) from _Milan Petrík_, May 09 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)