On permutations of wires and states

DOI10.1016/0166-218X(84)90001-5MaRDI QIDQ1064313zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90001-5

zbMATH Keywords

permutation networkstate-cycle periodswire-cycle periods

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Circuits, networks (94C99)

Review text

We characterize a permutation as a sequence of wire-cycle periods and a sequence of state-cycle periods. These sequences are called a wire- sequence and a state-sequence, respectively. A relation between wire- cycles and state-cycles is discussed and some combinatorial problems on cycle periods of permutations are solved. An efficient method for constructing the state-sequence corresponding to a given wire-sequence is also described.

Recommendations

• Sequences generating permutations
• On generation of permutations of \(m\) out of \(n\) items
• scientific article; zbMATH DE number 4068296
• The Number System of the Permutations Generated by Cyclic Shift
• Observations on the generation of permutations from random sequences

Cites work

• A fast parallel algorithm for routing in permutation networks
• A method and two algorithms on the theory of partitions
• A Permutation Network
• scientific article; zbMATH DE number 3904502 (Why is no real title available?)
• scientific article; zbMATH DE number 3264081 (Why is no real title available?)
• scientific article; zbMATH DE number 3083503 (Why is no real title available?)
• Linear Recurring Sequences
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Principles of combinatorics

This page was built for publication: On permutations of wires and states

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