Bounds on Determinantal Complexity of Two Types of Generalized Permanents
Combinatorics
2022-03-01 v1 Computational Complexity
Algebraic Geometry
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.
Keywords
Cite
@article{arxiv.2202.13016,
title = {Bounds on Determinantal Complexity of Two Types of Generalized Permanents},
author = {Tristram Bogart and Juan Andrés Valero},
journal= {arXiv preprint arXiv:2202.13016},
year = {2022}
}
Comments
14 pages