1) Is it possible to have a parsimonious reduction from a #P-complete problem #A to a counting problem #B when (the decision version) A is NP-complete and the B is in P?
For example, can there be a parsimonious reduction from #SAT to #B, when B is in P?
2) If B is in P, what are the different possibilities for the complexity of #B?