A Formula for Khovanov Type Link Homology of Pretzel Knots

Let G be a finite group. A nonempty subset X of G is said to be noncommuting if xy≠yx for any x, y ∈ X with x≠y. If |X| ≥ |Y| for any other non-commuting set Y in G, then X is said to be a maximal non-commuting set. In this paper, we determine upper and lower bounds on the cardinality of a maximal n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:数学研究通讯:英文版 2016, Vol.32 (3), p.198-206
1. Verfasser: Zhang Mei-li Lei Feng-chun Li Feng-ling Wang Dong-xu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let G be a finite group. A nonempty subset X of G is said to be noncommuting if xy≠yx for any x, y ∈ X with x≠y. If |X| ≥ |Y| for any other non-commuting set Y in G, then X is said to be a maximal non-commuting set. In this paper, we determine upper and lower bounds on the cardinality of a maximal non-commuting set in a finite p-group with derived subgroup of prime order.
ISSN:1674-5647