scientific article; zbMATH DE number 177149
[For the entire collection see Zbl 0755.00019.] The authors deal with the forcing relation induced on cyclic permutations of finite ordered sets. The permutation \(\theta\) of \(\{1,\dots,m\}\) forces the permutation \(\pi\) of \(\{1,\dots,n\}\) if every continuous map of the interval which has a representative of \(\theta\) also has a representative of \(\pi\). The forcing relation is a partial order. The authors extend the geometric version of Jungreis' algorithm [\textit{I. Jungreis}, Trans. Am. Math. Soc. 325, No. 1, 319-344 (1991; Zbl 0715.58028)], and the authors with \textit{M. Misiurewicz} and \textit{I. Mulvey} [ibid. 333, No. 2, 701-707 (1992; Zbl 0764.58026)] for deciding whether \(\theta\) forces \(\pi\) for arbitrary \(\theta\) and \(\pi\).
- scientific article; zbMATH DE number 221381
- A geometric algorithm to decide the forcing relation on cycles
- On a greedy algorithm to construct universal cycles for permutations
- Solving a permutation problem by a fully polynomial-time approximation scheme
- Permutations with Restricted Cycle Structure and an Algorithmic Application
- On the cycle structure of permutation polynomials
- scientific article; zbMATH DE number 3937382
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- On exact algorithms for the permutation CSP
- A Linear In-situ Algorithm for the Power of Cyclic Permutation
- On the existence of fundamental representatives of cyclic permutations in maps of an interval
- Symbolic representation for a class of unimodal cycles
- A geometric algorithm to decide the forcing relation on cycles
- Comparing Periodic Orbits of Maps of the Interval
- On the ordering of 𝑛-modal cycles
- On the structure of the totally ordered set of unimodal cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036996)
