J. Korean Math. Soc. 2001; 38(4): 793-806
Printed July 1, 2001
Copyright © The Korean Mathematical Society.
Suk-Geun Hwang
Kyungpook University
In this paper we consider the enumeration problem of permutations with partially forbidden positions, generalizing the notion of permutations with forbidden positions. As an alternative approach to this problem, we investigate the permanent maximization problem over some classes of $(0,1)$-matrices which have a given number of $1$'s some of which lie in prescribed positions.
Keywords: permutation, permanent, $(0,1)$-matrix
MSC numbers: 15A05
1998; 35(2): 423-432
1999; 36(5): 1009-1020
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd