Bounds on Determinantal Complexity of Two Types of Generalized Permanents
arXiv:2202.13016
Abstract
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing permutations by signed permutations, and the other by replacing permutations by surjective functions with preimages of prescribed sizes.
14 pages