scientific article; zbMATH DE number 177149

MaRDI QIDQ4036996zbMATH OpenFDO

Authors Chris Bernhardt, Ethan Coven

Publication date 18 May 1993

zbMATH Keywords

cyclic permutationsfinite ordered setsforcing relation

Mathematics Subject Classification ID

Topological dynamics (37B99) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25)

Recommendations

• 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

Cited in

(6)

• 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)