Metraipolis › archive › dc_80c5c9fb6dfd

Irreducibility of Full Multivariate Partial-Twuality Polynomials — arXiv:2611.01445

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01445
License (as archived)
CC0-1.0
Archived
2026-11-03T18:49:42.808Z
SHA-256 of the archived text
baef9ee077a5ea442609fd00ddc475f9dba9178673a9a33f31578d3ee7d33257
Stable URL of this page
https://metraipolis.com/documento/dc_80c5c9fb6dfd

How to cite

Irreducibility of Full Multivariate Partial-Twuality Polynomials — arXiv:2611.01445 — arXiv (en), https://arxiv.org/abs/2611.01445 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_80c5c9fb6dfd (Metraipolis archive dc_80c5c9fb6dfd, sha256 baef9ee077a5ea442609fd00ddc475f9dba9178673a9a33f31578d3ee7d33257)
BibTeX
@misc{dc80c5c9fb6dfd,
  title = {Irreducibility of Full Multivariate Partial-Twuality Polynomials — arXiv:2611.01445},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01445},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_80c5c9fb6dfd; sha256 baef9ee077a5ea442609fd00ddc475f9dba9178673a9a33f31578d3ee7d33257},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01445. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For each nonempty finite simple graph, we study five full multivariate partial-twuality polynomials defined using matrix ranks and coranks over $\mathbb{F}_2$. Over an arbitrary coefficient field $K$, we give a necessary and sufficient criterion for nontrivial factorization in the Laurent polynomial ring by additive separation of the exponent function across a nontrivial vertex partition. For $\bullet\in\{\tau,\delta\tau,\tau\delta,\delta\tau\delta\}$, the full multivariate partial-$\langle\bullet\rangle$ polynomial is irreducible in $K[z^{\pm1},\mathbf{u},\mathbf{v}]$ if and only if the graph is connected. For $\delta$, we characterize the connected graphs whose polynomials are reducible by a condition on the parities of vertex degrees and of the numbers of common neighbors, and determine their irreducible factors. For each operation, the corresponding polynomial is irreducible in $K[z,\mathbf{u},\mathbf{v}]$ if and only if the graph is connected and at least one state has zero $z$-exponent. In particular, the full multivariate partial-$\langle\delta\rangle$ polynomial is irreducible in $K[z,\mathbf{u},\mathbf{v}]$ if and only if the graph is connected and bipartite.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01445 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.069Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).