Finite posets and ferrers shapes

Advances in Mathematics

Volumn 158, Issue 1, 2001, Pages 86-127

  Britz, Thomas ^a   Fomin, Sergey ^b,c  

^a AARHUS UNIVERSITY   (Denmark)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Antichain; Chain; Ferrers shape; Finite poset; Tableau

Indexed keywords

EID: 0035285139     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1006/aima.2000.1966     Document Type: Article

References (37)

1. 1. R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950), 161-166.
2. 2. K. Engel, "Spencer Theory," Cambridge Univ. Press, Cambridge, UK, 1997.
3. 3. S. Felsner, Orthogonal structures in directed graphs, J. Combin. Theory Ser. B 57 (1993), 309-321.
4. 4. S. V. Fomin, Finite partially ordered sets and Young tableaux, Soviet Math. Dokl. 19 (1978), 1510-1514.
5. 5. S. V. Fomin, Generalized Robinson-Schensted-Knuth correspondence, J. Soviet Math. 41 (1988), 979-991.
6. 6. S. V. Fomin, Duality theorem for posets: Algorithms, in "Mathematical Methods of Design and Analysis of Algorithms," pp. 190-199, Nauka, Leningrad, 1990. [In Russian]
7. 7. S. Fomin, Knuth equivalence, jeu de taquin, and the Littlewood-Richardson rule, in "Enumerative Combinatorics," Vol. 2, Appendix 1, Cambridge Univ. Press, Cambridge, UK, 1999.
8. 8. S. Fomin and C. Greene, A Littlewood-Richardson miscellany, European J. Combin. 14 (1993), 191-212.
9. 9. L. R. Ford, Jr. and D. R. Fulkerson, "Flows in Networks," Princeton Univ. Press, Princeton, NJ, 1962.
10. 10. A. Frank, On chain and antichain families of a partially ordered set, J. Combin. Theory Ser. B 29 (1980), 176-184.
11. 11. E. R. Gansner, Acyclic digraphs, Young tableaux and nilpotent matrices, SIAM J. Algebraic Discrete Methods 2 (1981), 429-440.
12. 12. C. Greene, An extension of Schensted's theorem, Adv. Math. 14 (1974), 254-265.
13. 13. C. Greene, Some partitions associated with a partially ordered set, J. Combin. Theory Ser. A 20 (1976), 69-79.
14. 14. C. Greene and D. J. Kleitman, The structure of Sperner k-families, J. Combin. Theory Ser. A 20 (1976), 41-68.
15. 15. I. Ben-Arroyo Hartman, F. Saleh, and D. Hershkowitz, On Green's theorem for digraphs, J. Graph Theory 18 (1994), 169-175.
16. 16. M. A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, an elementary approach, Electron J. Combin. 3 (1996).
17. 17. M. A. van Leeuwen, Flag varieties and interpretations of Young tableau algorithms, J. Algebra 224 (2000), 397-426.
18. 18. M. A. van Leeuwen, "A Robinson-Schensted Algorithm in the Geometry of Flags for Classical Groups," Ph.D. thesis, Rijksuniversiteit, Utrecht, 1989.
19. 19. N. Linial, Extending the Greene-Kleitman theorem to directed graphs, J. Combin. Theory Ser. A 30 (1981), 331-334.
20. 20. J. H. Lint and R. M. Wilson, "A Course in Combinatorics," Cambridge Univ. Press, Cambridge, UK, 1992.
21. 21. L. Mirsky, A dual of Dilworth's decomposition theorem, Amer. Math. Monthly 78 (1971), 876-877.
22. 22. H. Perfect, Addendum to "A short proof of the existence of k-saturated partitions of partially ordered sets" [Adv. Math. 33 (1979), 207-211] by M. Saks, Glasgow Math. J. 25 (1984), 31-33.
23. 22. H. Perfect, Addendum to "A short proof of the existence of k-saturated partitions of partially ordered sets" [Adv. Math. 33 (1979), 207-211] by M. Saks, Glasgow Math. J. 25 (1984), 31-33.
24. 23. S. Poljak, Maximum rank of powers of a matrix of a given pattern, Proc. Amer. Math. Soc. 106 (1989), 1137-1144.
25. 24. T. Roby, "Applications and Extensions of Fomin's Generalization of the Robinson-Schensted Correspondence to Differential Posets," Ph.D. thesis, Massachusetts Institute of Technology, 1991.
26. 25. G.-C. Rota, On the foundations of combinatorial theory. I. Theory of Möbius functions, Z. Wahrsch. 2 (1964), 340-368.
27. 26. M. Saks, A short proof of the existence of k-saturated partitions of partially ordered sets, Adv. Math. 33 (1979), 207-211.
28. 27. M. Saks, Dilworth numbers, incidence maps and product partial orders, SIAM J. Algebraic Discrete Methods 1 (1980), 211-215.
29. 28. M. Saks, Some sequences associated with combinatorial structures, Discrete Math. 59 (1986), 135-166.
30. 29. C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961), 179-191.
31. 30. M. P. Schützenberger, Quelques remarques sur une construction de Schensted, Math. Scand. 12 (1963), 117-128.
32. 31. G. E. Shilov, "Linear Algebra," Dover, New York, 1977.
33. 32. R. P. Stanley, "Enumerative Combinatorics," Vol. 1, Cambridge Univ. Press, Cambridge, UK, 1997.
34. 33. R. P. Stanley, "Enumerative Combinatorics," Vol. 2, Cambridge Univ. Press, Cambridge, UK, 1999.
35. 34. R. Steinberg, An occurrence of the Robinson-Schensted correspondence, J. Algebra 113 (1988), 523-528.
36. 35. I. Terada, Brauer diagrams, updown tableaux, and nilpotent matrices, preprint, 1999.
37. 36. D. B. West, Parameters of partial orders and graphs: packing, covering and representation, in "Graphs and Order" (I. Rival, Ed.), pp. 267-350, Reidel, Dordrecht/Boston, 1985.