The Combinatorial Statistic Finder
Contents
This project was initiated in August 2011 by Chris Berg, Franco Saliola and Christian Stump. We are grateful to all contributors, and to LaCIM for hosting the web page. For questions and comments email us at info@findstat.org.
This project is still in an early stage, see the todo and bug lists — enjoy and help collecting information! For remarks, comments, ideas, suggestions, use the comments page.
It has two main aims:
Providing a platform to gather information about combinatorial collections and statistics, and about their relations. This includes
filling the wiki with information, and
adding new combinatorial statistics to the database.
- Providing a web interface to
test if your data can be linearly obtained from implemented combinatorial statistics,
test if your data is a known combinatorial statistics in the database, or
test if your data can be obtained from known combinatorial statistics in the database by applying combinatorial maps.
1. What is a combinatorial statistic?
We assume a combinatorial collection to be a set $\mathcal{S}$, for which the elements admit a combinatorial description. A combinatorial statistic on a set $\mathcal{S}$ is a map $\operatorname{st} : \mathcal{S} \longrightarrow M$ where $M$ is a module over some ring $R$. For this project, we assume this module to be the integers $\mathbb{Z}$ over itself.
2. Which combinatorial collections are provided?
For a list of all combinatorial collections currently considered in this project, see Combinatorial collections.
3. Interesting system pages