Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

PanSkanderaWangAllSplitsWord

Abstract

ListOfFn lists the function values in increasing Fin order.

Definition 1.1 (word).

Formalization. D5/S3/Combinatorics/Permanental/PanSkanderaWangAllSplitsWord.word (✓ std3).

Source. Repository-derived.

Acknowledgement. Sihong Pan, Mark Skandera, Jiayuan Wang (2026). Permanental Inequalities and Unit Interval Orders. DOI: 10.4204/EPTCS.445.17. URL: https://arxiv.org/abs/2606.13162v1.

Commentary.

ListOfFn lists the function values in increasing Fin order. Adding one converts the zero-based permutation to the paper’s one-based word.

Definition 1.2 (ofWord).

Formalization. D5/S3/Combinatorics/Permanental/PanSkanderaWangAllSplitsWord.ofWord (✓ std3).

Source. Repository-derived.

Acknowledgement. Sihong Pan, Mark Skandera, Jiayuan Wang (2026). Permanental Inequalities and Unit Interval Orders. DOI: 10.4204/EPTCS.445.17. URL: https://arxiv.org/abs/2606.13162v1.

Commentary.

ofWord is Equiv.ofBijective of the function i mapped to the Fin n value x[val i] - 1. The displayed equation is its defining value expression; getElem uses the index bound obtained from hx. Permutation membership gives positive bounded entries and verifies injectivity and surjectivity. Subtraction on natural numbers is truncated.

References