Findstat – a database and search engine for combinatorial statistics and maps. (English) Zbl 1442.62004

Summary: FindStat is a collaborative online database of combinatorial statistics on combinatorial collections and of maps between such collections. A search engine allows users to identify statistics and maps given a few known values, using for example the web interface. As of April 2019, the database contains 1387 statistics and 146 maps on 18 collections by 70 contributors.


62-04 Software, source code, etc. for problems pertaining to statistics
05-04 Software, source code, etc. for problems pertaining to combinatorics


OEIS; FindStat
Full Text: Link


[1] S. C. Billey and B. E. Tenner. “Fingerprint databases for theorems”.Notices Amer. Math. Soc. 60.8 (2013), pp. 1034-1039.Link. · Zbl 1322.68252
[2] T. Kahle and C. Stump. “Counting inversions and descents of random elements in finite Coxeter groups”.Math. Comp.(2019). to appear. · Zbl 1480.20093
[3] R. Marczinzik, M. Rubey, and C. Stump. “A combinatorial classification of 2-regular simple modules for Nakayama algebras”. 2018.arXiv:1811.05846. · Zbl 1458.16011
[4] N. J. A. Sloane. “The On-Line Encyclopedia of Integer Sequences”.Notices Amer. Math. Soc. 50.8 (2003).http://www.ams.org/notices/200308/200308-toc.html, pp. 912-915. · Zbl 1044.11108
[5] R.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.