Partial-Twuality Polynomials of Paired Matrices

Abstract

Gross, Mansour, and Tucker~[European Journal of Combinatorics, 95 (2021): 103329] introduced the \emph{partial-twuality polynomials} of ribbon graphs. Recently, Deng, Jin, and Yan generalized the partial-twuality polynomials to the framework of matrix algebra and investigated several of their basic properties. They asked whether there exist matrix operations, called partial duality $δ$ and partial Petrie duality $τ$, on pairs $(M,A)$, where $M$ is a square matrix whose rows and columns are indexed by a finite set $V$ and $A\subseteq V$, such that $δ^2=τ^2=(δτ)^3=id$ and the exponent of the partial-twuality polynomials coincides with some parameter of the matrix obtained by applying \(\bullet\) to \((M, A)\). In this paper, we introduce a paired-matrix framework for partial-twuality polynomials over the binary field $\mathbb{GF}(2)$. We prove that there exist two local operations \(δ\) and \(τ\) on \(\bigl((M,I_{|V|}),A\bigr)\) satisfying $δ^2=τ^2=(δτ)^3=id$ and $P_{\langle \bullet \rangle}((M,I_{|V|}),z)=P_{\langle \bullet \rangle}(M,z)$ for $\bullet \in \{δ, τ, δτ, τδ, δτδ\}$, thereby answering their question affirmatively. Finally, we establish a recurrence relation for the partial \(\langleδτδ\rangle\)-polynomial with respect to an edge. This recurrence enables the computation of the partial \(\langleδτδ\rangle\)-polynomial for certain bouquets, simple graphs, and simple signed graphs.