126 search results - page 2 / 26 » Decreasing Diagrams II |
104
Voted
COMBINATORICS
2007
15 years 19 days ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
110
Voted
DCG
2007
15 years 18 days ago
2007
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...
CORR
2010
Springer
15 years 22 days ago
2010
Springer
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
SIGCSE
2000
ACM
15 years 5 months ago
2000
ACM
87
Voted
TSE
2002
15 years 8 days ago
2002