A binary matrix satisfies the consecutive ones property (c1p) if its columns can be permuted such that the 1s in each row of the resulting matrix are consecutive. Equivalently, a family of setsF={Q1,…,Qm}, where Qi⊆R for some universe R, satisfies the c1p if the symbols in R can be permuted such that the elements of each set Qi∈F occur consecutively, as a contiguous segment of the permutation of Rʼs symbols. Motivated by combinatorial problems on sequences with repeated symbols, we consider the c1p version on multisets and prove that counting the orderings (permutations) thus generated is #P-complete. We prove completeness results also for counting the permutations generated by PQ-trees (which are related to the c1p), thus showing that a polynomial-time algorithm is unlikely to exist when dealing with multisets and sequences with repeated symbols. To prove our results, we use a combinatorial approach based on parsimonious reductions from the Hamiltonian path problem, which enables us to prove also the hardness of approximation for these counting problems
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.