The Combinatorial Statistic Finder
The FindStat project has two main aims (see also the project description in pdf):
- Providing a platform to gather information about combinatorial collections and statistics and their relations. This includes
- adding new combinatorial statistics to the database, and
- filling the wiki with information.
- Providing a web interface to
- test if your data is a known combinatorial statistics in the database, or
- test if your data can be obtained from known combinatorial statistics by applying combinatorial maps.
A combinatorial collection is a set $\mathcal{S}$ with interesting combinatorial properties.
A combinatorial map is a combinatorially interesting map $\phi : \mathcal{S} \longrightarrow \mathcal{S'}$ between combinatorial collections.
A combinatorial statistic is a combinatorially interesting map $\operatorname{st} : \mathcal{S} \longrightarrow \mathbb{Z}$.
A combinatorial map is a combinatorially interesting map $\phi : \mathcal{S} \longrightarrow \mathcal{S'}$ between combinatorial collections.
A combinatorial statistic is a combinatorially interesting map $\operatorname{st} : \mathcal{S} \longrightarrow \mathbb{Z}$.
We would appreciate if you add your favourite statistic and sign up for quarterly FindStat news.