1-Colored Archetypal Permutations and Strings of Degree n
New notions related to permutations are introduced here. We present the string of a 1-colored permutation as a closed planar curve, the fundamental 1-colored permutation as an equivalence class related to the equivalence in strings of the 1-colored permutations. We give formulas for the number of th...
Main Author: | Gheorghe Eduard Tara |
---|---|
Format: | Article |
Language: | English |
Published: |
Publishing House of the Romanian Academy
2012-10-01
|
Series: | Memoirs of the Scientific Sections of the Romanian Academy |
Subjects: | |
Online Access: | http://mss.academiaromana-is.ro/mem_sc_st_2012/art%2001%20Tara.pdf |
Similar Items
-
2-closures of primitive permutation groups of holomorph type
by: Yu Xue, et al.
Published: (2019-07-01) -
Permutation groups /
by: Passman, Donald S., 1940-
Published: (1968) -
Algorithms for permutability in finite groups
by: Ballester-Bolinches Adolfo, et al.
Published: (2013-11-01) -
The Permutation group [kasetvideo]
Published: (1972) -
The permutation group [filem]
Published: (1972)