A duality for permutations

DOI10.1016/0012-365X(88)90105-7MaRDI QIDQ1114702zbMATH OpenFDO

Authors Saul Stahl

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90105-7

zbMATH Keywords

dualitypermutation pairsemicycleseparation

Mathematics Subject Classification ID

Review text

The concept of separation of an ordered pair of permutations is introduced and a discrete analogue of Jordan curve theorem, based on this separation, is proved. As the author mentions, his result provides an elementary though somewhat involved proof of the original topological version of this theorem.

Recommendations

• scientific article; zbMATH DE number 605346
• scientific article; zbMATH DE number 3747124
• A Jordan-Brouwer separation theorem for polyhedral pseudomanifolds
• Permutations in two dimensions that maximally separate neighbors
• Two Discrete Forms of the Jordan Curve Theorem

Cites work

• A combinatorial analog of the Jordan Curve Theorem
• Cubic combinatorial maps
• Discrete Jordan curve theorems
• How many ways can a permutation be factored into two n-cycles?
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3298598 (Why is no real title available?)

Cited in

(4)

• scientific article; zbMATH DE number 3747124 (Why is no real title available?)
• Permutable pairs of quasi-uniformities
• scientific article; zbMATH DE number 7771747 (Why is no real title available?)
• Pre-signed graphs: a reformulation of signed graphs and their embeddings

This page was built for publication: A duality for permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114702)