Equivalence of Carter diagrams

We introduce the equivalence relation ρ on the set of Carter diagrams and construct an explicit transformation of any Carter diagram containing l-cycles with l>4 to an equivalent Carter diagram containing only 4-cycles. Transforming one Carter diagram Γ₁ to another Carter diagram Γ₂ we can get a...

Повний опис

Збережено в:
Бібліографічні деталі
Опубліковано в: :Algebra and Discrete Mathematics
Дата:2017
Автор: Stekolshchik, R.
Формат: Стаття
Мова:English
Опубліковано: Інститут прикладної математики і механіки НАН України 2017
Онлайн доступ:https://nasplib.isofts.kiev.ua/handle/123456789/155936
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати:Equivalence of Carter diagrams / R. Stekolshchik // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 1. — С. 138-179. — Бібліогр.: 8 назв. — англ.

Репозитарії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
id nasplib_isofts_kiev_ua-123456789-155936
record_format dspace
spelling Stekolshchik, R.
2019-06-17T15:36:30Z
2019-06-17T15:36:30Z
2017
Equivalence of Carter diagrams / R. Stekolshchik // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 1. — С. 138-179. — Бібліогр.: 8 назв. — англ.
1726-3255
2010 MSC:20F55.
https://nasplib.isofts.kiev.ua/handle/123456789/155936
We introduce the equivalence relation ρ on the set of Carter diagrams and construct an explicit transformation of any Carter diagram containing l-cycles with l>4 to an equivalent Carter diagram containing only 4-cycles. Transforming one Carter diagram Γ₁ to another Carter diagram Γ₂ we can get a certain intermediate diagram Γ′ which is not necessarily a Carter diagram. Such an intermediate diagram is called a connection diagram. The relation ρ is the equivalence relation on the set of Carter diagrams and connection diagrams. The properties of connection and Carter diagrams are studied in this paper. The paper contains an alternative proof of Carter's classification of admissible diagrams.
en
Інститут прикладної математики і механіки НАН України
Algebra and Discrete Mathematics
Equivalence of Carter diagrams
Article
published earlier
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
collection DSpace DC
title Equivalence of Carter diagrams
spellingShingle Equivalence of Carter diagrams
Stekolshchik, R.
title_short Equivalence of Carter diagrams
title_full Equivalence of Carter diagrams
title_fullStr Equivalence of Carter diagrams
title_full_unstemmed Equivalence of Carter diagrams
title_sort equivalence of carter diagrams
author Stekolshchik, R.
author_facet Stekolshchik, R.
publishDate 2017
language English
container_title Algebra and Discrete Mathematics
publisher Інститут прикладної математики і механіки НАН України
format Article
description We introduce the equivalence relation ρ on the set of Carter diagrams and construct an explicit transformation of any Carter diagram containing l-cycles with l>4 to an equivalent Carter diagram containing only 4-cycles. Transforming one Carter diagram Γ₁ to another Carter diagram Γ₂ we can get a certain intermediate diagram Γ′ which is not necessarily a Carter diagram. Such an intermediate diagram is called a connection diagram. The relation ρ is the equivalence relation on the set of Carter diagrams and connection diagrams. The properties of connection and Carter diagrams are studied in this paper. The paper contains an alternative proof of Carter's classification of admissible diagrams.
issn 1726-3255
url https://nasplib.isofts.kiev.ua/handle/123456789/155936
citation_txt Equivalence of Carter diagrams / R. Stekolshchik // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 1. — С. 138-179. — Бібліогр.: 8 назв. — англ.
work_keys_str_mv AT stekolshchikr equivalenceofcarterdiagrams
first_indexed 2025-12-07T20:28:00Z
last_indexed 2025-12-07T20:28:00Z
_version_ 1850882686569152512