The Combinatorial Statistic Finder

**It is very simple to use the Statistic Finder and to add a new statistic! You can also browse through the statistics in the database.**

A **combinatorial collection** is a set $\mathcal{S}$ that has interesting combinatorial properties. A **combinatorial statistic** on $\mathcal{S}$ is a map $\operatorname{st} : \mathcal{S} \longrightarrow \mathbb{Z}$.

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**, ortest if your data can be obtained from

**known combinatorial statistics in the database**by**applying combinatorial maps**.

Our project currently supports the following combinatorial collections:

- Alternating sign matrices (wiki)
- Binary trees (wiki)
- Cores (wiki)
- Dyck paths (wiki)
- Finite Cartan types (wiki)
- Gelfand-Tsetlin patterns (wiki)
- Graphs (wiki)
- Integer compositions (wiki)
- Integer partitions (wiki)
- Ordered trees (wiki)
- Parking functions (wiki)
- Perfect matchings (wiki)
- Permutations (wiki)
- Posets (wiki)
- Semistandard tableaux (wiki)
- Set partitions (wiki)
- Standard tableaux (wiki)