FindStat
CollectionsDatabase
Login
Navigation
All Collections
All Maps
All Statistics
Contribute Map
Contribute Statistic
Usage
Contributors
Citations
Interface
Login
Close
There are
24 collections
in the database:
Alternating sign matrices
Binary trees
Binary words
Cores
Decorated permutations
Dyck paths
Finite Cartan types
Gelfand-Tsetlin patterns
Graphs
Integer compositions
Integer partitions
Lattices
Ordered set partitions
Ordered trees
Parking functions
Perfect matchings
Permutations
Plane partitions
Posets
Semistandard tableaux
Set partitions
Signed permutations
Skew partitions
Standard tableaux
size
number
database
partitions
permutation
set
called
graph
diagram
permutations
represented
example
examples
partition
definition
pattern
vertices
references
dyck
finite
sage
row
technical
usage
list
graded
length
bijection
tableaux
integer
cardinality
parking
additional
boxes
elements
uniquely
young
binary
standard
sum
order
patterns
ordered
path
lattice
paths
posets
root
shape
trees
polynomials
functions
properties
type
group
graphs
code
first
tree
matrix
cores
sign
vertex
plane
skew
semistandard
system
function
statistic
empty
rows
symmetric
isomorphic
simple
gelfand
tsetlin
edges
lie
decorated
rothe
words
graphically
parts
irreducible
perfect
alternating
integral
notation
fixed
points
column
sequence
formula
steps
canonical
cells
equal
unlabelled
maximal
entries
cycle
lehmer
proved
form
pair
schubert
linear
distinct
known
compositions
tableau
increasing
hook
numbers
internal
defined
sorted
core
adjacent
polytope
yield
collection
classes
types
remarks
semilength
word
systems
whose
poset
representation
return
edge
walk
connected
algebras
algebra
outer
lattices
line
major
index
particular
further
schur
positive
tba
node
nodes
free
matchings
associated
cover
comparable
closed
enumeration
symmetry
monotone
top
semi
polytopes
cartan
spot
signed
way
used
generating
subset
important
conditions
grassmannian
columns
exactly
representations
integers
down
equivalently
bracket
point
quiver
denoted
product
box
lists
blocks
correspondence
case
labelling
entry
dimension
circuit
roots
labelled
introduced
euler
mahonian
bistatistic
special
counted
positions
consecutive
mesh
satisfying
dominant
equivalent
polynomial
groups
combinatorial
natural
pairs
crossing
leaf
add
bts
matching
corresponding
open
parameters
partial
implies
exists
relations
totally
ideal
triangles
certain
objects
representing
weight
tiles
faces
tile
reduced
nonempty
nontrivial
weyl
semisimple
car
park
tau
denotes
drawing
right
align
both
bruhat
statistics
satisfies
recurrence
eulerian