Answers are grounded in this paper and cite their sources.
We introduce the face polynomial of a ribbon graph, a generating function for face numbers under the ribbon group action. It addresses the face-count case of the Ellis--Monaghan--Moffatt question on twisted duality. We derive deletion--contraction recursions and prove that this polynomial coincides with the vertex polynomial for \(δ\), \(δτ\), and \(δ,τ\). We characterize monomial cases and obtain formulas and recursions for Euler-genus partial-twuality polynomials. For orientable graphs, we show that the partial-dual face polynomial has both parities whenever an edge exists, so the partial-dual Euler-genus polynomial has only even exponents.
No takes yet. Share an insight, caveat, or question.
Ma et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: