Algorithms and Properties on Balanced Permutations

DOI10.1080/02522667.1992.10699108MaRDI QIDQ4024143zbMATH OpenOpenAlexFDO

Authors

Publication date 25 February 1993

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1992.10699108

zbMATH Keywords

balanced permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

A permutation \(\sigma=x_ 1x_ 2x_ 3\dots x_ n\), when \(\sigma\in S_ n\) \((S_ n\) being the set of all permutation on \([n]=\{1,2,3,\dots,n\})\), is said to be \(x_ i\) balanced, \(x_ i\in[n- 1]\), if either \(x_ i\) and \(x_{i+1}\) are adjacent in \(\sigma\) in this order or \(x_ i\) and \(x_{i+1}\) are nonadjacent with \(x_{i+1}\) appearing to the left of \(x_ i\). This paper is concerned with studying the set of balanced permutations on \([n]\), to obtain its construction and to prove some properties of its elements.

Recommendations

• Characteristic Numbers of Permutations
• Sorted and/or sortable permutations
• scientific article; zbMATH DE number 3941545
• scientific article; zbMATH DE number 3946144
• Some considerations on permutation trees

Cites work

• On Strict Contractions
• Permutations with prescribed pattern
• Some results of black’s permutations

Cited in

(3)

• Algorithmic and algebraic aspects of unshuffling permutations
• scientific article; zbMATH DE number 3946144 (Why is no real title available?)
• Characteristic Numbers of Permutations

This page was built for publication: Algorithms and Properties on Balanced Permutations

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