[Paper Review] ZZ Polynomials of Regular $m$-tier Benzenoid Strips as Extended Strict Order Polynomials of Associated Posets -- Part 1. Proof of Equivalence

Johanna Langner, Henryk A. Witek|arXiv (Cornell University)|Mar 10, 2021

Advanced Differential Equations and Dynamical Systems4 citations

TL;DR

This paper establishes a rigorous mathematical equivalence between the Zhang-Zhang (ZZ) polynomial of regular m-tier benzenoid strips and the extended strict order polynomial of an associated partially ordered set (poset). By proving a one-to-one correspondence between Kekulé structures and strictly order-preserving maps on the poset, the authors show that computing the ZZ polynomial reduces to enumerating linear extensions of the poset and analyzing their descent and fixed-label statistics, enabling a compact closed-form expression for the ZZ polynomial.

ABSTRACT

In Part 1 of the current series of papers, we demonstrate the equivalence between the Zhang-Zhang polynomial $\ ext{ZZ}(\\boldsymbol{S},x)$ of a Kekul\\'ean regular $m$-tier strip $\\boldsymbol{S}$ of length $n$ and the extended strict order polynomial $\ ext{E}_{\\mathcal{S}}^{\\circ}(n,x+1)$ of a certain partially ordered set (poset) $\\mathcal{S}$ associated with $\\boldsymbol{S}$. The discovered equivalence is a consequence of the one-to-one correspondence between the set $\\left\\{ K\ ight\\}$ of Kekul\\'e structures of $\\boldsymbol{S}$ and the set $\\left\\{ \\mu:\\mathcal{S}\\supset\\mathcal{A}\ ightarrow\\left[\\,n\\,\ ight]\ ight\\}$ of strictly order-preserving maps from the induced subposets of $\\mathcal{S}$ to the interval $\\left[\ hinspace n\ hinspace\ ight]$. As a result, the problems of determining the Zhang-Zhang polynomial of $\\boldsymbol{S}$ and of generating the complete set of Clar covers of $\\boldsymbol{S}$ reduce to the problem of constructing the set $\\mathcal{L}(\\mathcal{S})$ of linear extensions of the corresponding poset $\\mathcal{S}$ and studying their basic properties. In particular, the Zhang-Zhang polynomial of $\\boldsymbol{S}$ can be written in a compact form as $\ ext{ZZ}(\\boldsymbol{S},x)=\\sum_{k=0}^{\\left|\\mathcal{S}\ ight|}\\sum_{w\\in\\mathcal{L}(\\mathcal{S})}\\binom{\\left|\\mathcal{S}\ ight|-\ ext{fix}_{\\mathcal{S}}(w)}{\\,\\,k\\,\\,\\hspace{1pt}-\ ext{fix}_{\\mathcal{S}}(w)}\\binom{n+\ ext{des}(w)}{k}\\left(1+x\ ight)^{k}$, where $\ ext{des}(w)$ and $\ ext{fix}_{\\mathcal{S}}(w)$ denote the number of descents and the number of fixed labels, respectively, in the linear extension $w\\in\\mathcal{L}(\\mathcal{S})$.

Motivation & Objective

• To establish a rigorous mathematical equivalence between the ZZ polynomial of regular m-tier benzenoid strips and extended strict order polynomials of associated posets.
• To demonstrate that the set of Kekulé structures of a benzenoid strip corresponds bijectively to the set of strictly order-preserving maps on a derived poset.
• To reduce the computation of the ZZ polynomial to the enumeration and analysis of linear extensions of the associated poset.
• To provide a foundation for an automated, algorithmic approach to computing ZZ polynomials for all regular m-tier strips with m = 1 to 6 and arbitrary length n.

Proposed method

• Construct a partially ordered set (poset) 𝒮 from the structure of a regular m-tier benzenoid strip 𝕊.
• Define a one-to-one correspondence between Kekulé structures of 𝕊 and strictly order-preserving maps from induced subposets of 𝒮 to the integer interval [n].
• Express the ZZ polynomial as a sum over all linear extensions w of 𝒮, incorporating descent count des(w) and fixed-label count fix𝒮(w).
• Derive a closed-form formula for the ZZ polynomial using binomial coefficients and powers of (1+x), based on the combinatorial properties of linear extensions.
• Leverage the equivalence to develop a four-step, fully automatable algorithm for computing the extended strict order polynomial E𝒮°(n,x+1), which equals the ZZ polynomial.
• Validate the framework by computing ZZ polynomials for all regular m-tier strips with m = 1 to 6 and arbitrary n in subsequent parts of the series.

Experimental results

Research questions

• RQ1 Can the Zhang-Zhang polynomial of a regular m-tier benzenoid strip be expressed as an extended strict order polynomial of an associated poset?
• RQ2 Is there a bijective correspondence between the Kekulé structures of the strip and the strictly order-preserving maps on the derived poset?
• RQ3 Does the ZZ polynomial computation reduce to analyzing the linear extensions of the associated poset and their descent and fixed-label statistics?
• RQ4 Can the derived equivalence be used to construct a fully automatable algorithm for ZZ polynomial computation across all m-tier strips with m = 1 to 6?
• RQ5 What is the precise closed-form expression for the ZZ polynomial of regular m-tier benzenoid strips in terms of poset linear extensions?

Key findings

• The ZZ polynomial of a regular m-tier benzenoid strip 𝕊 is mathematically equivalent to the extended strict order polynomial E𝒮°(n,x+1) of its associated poset 𝒮.
• The equivalence arises from a bijective mapping between Kekulé structures of 𝕊 and strictly order-preserving maps from subposets of 𝒮 to [n].
• The ZZ polynomial is expressed in closed form as ∑ₖ₌₀^|𝒮| ∑_{w∈ℒ(𝒮)} binom(|𝒮|−fix𝒮(w), k−fix𝒮(w)) × binom(n+des(w), k) × (1+x)^k.
• The number of descents des(w) and fixed labels fix𝒮(w) in each linear extension w of 𝒮 fully determine the polynomial coefficients.
• The framework enables a complete, automated computation of ZZ polynomials for all regular m-tier strips with m = 1 to 6 and arbitrary n, as detailed in Parts 2 and 3 of the series.
• This approach represents a novel, unprecedented connection between chemical graph theory and advanced order theory, offering a new pathway for computing ZZ polynomials.