Abstract
This paper investigates the enumerative problems of flagged skew plane partitions in which each row (column) has an upper and a lower bounds on the entries. By means of dominance technique, a direct and elementary derivation for their generating functions is presented which may be more accessible to readers.
Similar content being viewed by others
References
Andrews, G. E., The Theory of Partitions, Addison-Wesley, London, 1976.
Carlitz, L., Rectangular arrays and plane partitions,Acta Arithmetica,XIII (1967), 29–47.
Chu Wenchang, The Counting Theory of Ordered Runs and Applications, Ph.D thesis, Dalian Institute of Technology, 1987.
Goulden, I. P. & Jackson, D. M., Combinatorial Enumeration, Wiley, New York, 1983.
Knuth, D. E., Permutations, matrices and generalized Young tableaux,Pacific J. of Math.,34 (1970), 709–727.
Littlewood, D. E., The Theory of Group Characters, 2nd ed., Oxford University Press, 1950.
Macdonald, I. G., Symmetric Functions and Hall Polynomials, Clarendon Press, Oxford, 1979.
MacMahon, P. A., Combinatory Analysis, Cambridge, 1915/1916.
Mohanty, S. G., Lattice Path Counting and Applications, Academic press, New York, 1979.
Stanley, R. P., Theory and applications of plane partitions I & II,Studies in Appl. Math.,1 (1971). 167–188 &1 (1971), 259–279.
Wachs, M. L., Flagged Schur functions, Schubert polynomials and symmetrizing operators,J. of Combinatorial Theory, Series A,40 (1985), 276–289.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wenchang, C. Dominance method for plane partitions III-flagged skew plane partitions. Acta Mathematica Sinica 5, 321–328 (1989). https://doi.org/10.1007/BF02107709
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02107709