<--- Back to Details
First PageDocument Content
Symmetric functions / Representation theory of finite groups / Algebraic combinatorics / Enumerative combinatorics / Catalan number / Young tableau / Permutation / Binary tree / Robinson–Schensted–Knuth correspondence / Mathematics / Combinatorics / Algebra
Date: 2014-04-30 04:42:48
Symmetric functions
Representation theory of finite groups
Algebraic combinatorics
Enumerative combinatorics
Catalan number
Young tableau
Permutation
Binary tree
Robinson–Schensted–Knuth correspondence
Mathematics
Combinatorics
Algebra

Parking functions to non-decreasing parking function

Add to Reading List

Source URL: www.findstat.org

Download Document from Source Website

File Size: 47,94 KB

Share Document on Facebook

Similar Documents

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

DocID: 1uCBo - View Document

Computer programming / Software engineering / Computing / Quadtree / B-tree / Knowledge representation / Tree / Linked list / Trie / Redblack tree / Binary tree

TREE STRUCTURES FOR REGION REPRESENTATION Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

DocID: 1rrxI - View Document

Abstract data types / Mathematics / Software engineering / Computer programming / Analysis of algorithms / Asymptotic analysis / Binary trees / Binomial heap / Priority queue / Minimum spanning tree / Big O notation / Heap

Programming Techniques S.L. Graham, R.L. Rivest Editors

DocID: 1rm4m - View Document

Graph theory / Mathematics / Model checking / Theoretical computer science / Graph / Binary decision diagram / Tree / Circuit / Symbolic trajectory evaluation / Signal-flow graph / Topology

Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c

DocID: 1riqj - View Document

Graph theory / Binary trees / Computer programming / Software engineering / Tree traversal / Linked list / B-tree / T-tree / Trie / Tree / Redblack tree

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

DocID: 1r7j1 - View Document