RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive
Avtomat. i Telemekh., 2009 Issue 2, Pages 142–152 (Mi at424)
This article is cited in 2 papers

Automata

Generating ordered set of symmetric group for solving commutation problems

S. A. Kalinchuka, Yu. L. Sagalovichb

a Moscow Institute of Physics and Technology, Moscow, Russia
b Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: In this paper, the recurrent algorithms for construction of generating ordered set of symmetric group are suggested. The bounds of transpositions' numbers in such sets are found.

PACS: 02.20.-a

Presented by the member of Editorial Board: P. P. Parkhomenko

Received: 10.06.2008


 English version: Automation and Remote Control, 2009, 70:2, 301–311

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024