Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hayashi property for conjugation quandles over finite Coxeter groups

Published 4 Jul 2026 in math.GR | (2607.03922v1)

Abstract: In this article, we show that for all finite irreducible Coxeter groups GG with a conjugation closed subset CC, the conjugation quandle Conj(G,C)\rm{Conj}(G,C) satisfies the Hayashi property.

Summary

  • The paper demonstrates that conjugation quandles over finite Coxeter groups satisfy the Hayashi property, ensuring that every right translation map is a regular permutation.
  • It employs both combinatorial arguments and computational group theory (using GAP) to verify the property across classical families and exceptional types.
  • The study extends the analysis to unions of conjugacy classes, revealing deeper structural implications and prompting further group-theoretic classifications.

Hayashi Property for Conjugation Quandles over Finite Coxeter Groups

Introduction and Motivation

This paper investigates the Hayashi property for conjugation quandles constructed from finite irreducible Coxeter groups. Quandles, introduced to encode algebraic invariants of knots and links, form a class of idempotent, right self-distributive, right quasigroups whose automorphisms capture essential symmetries in various algebraic and geometric settings. The profile of a quandle, defined via the cycle types of its right translation maps, is a combinatorial invariant closely tied to both group structure and applications in the study of solutions to the Yang-Baxter equations and invariants in Hopf algebra and knot theory.

The Hayashi property generalizes the Hayashi conjecture, stating that for finite quandles, every right translation map is a regular permutation—meaning all cycle lengths in its decomposition divide the length of the largest cycle. The focus here is on conjugation quandles Conj(G,C)\mathrm{Conj}(G, C), where GG is a finite irreducible Coxeter group and CC is a conjugation-closed subset. Establishing the Hayashi property across all such cases resolves an important structural question at the intersection of algebra, combinatorics, and group theory.

Preliminaries: Quandles and the Hayashi Property

Formally, a quandle (X,▹)(X, \triangleright) is a set XX with a binary operation satisfying idempotence and the property that each right translation map Rx:y↦y▹xR_x: y \mapsto y \triangleright x is an automorphism of the structure. The main construction of interest is the conjugation quandle Conj(G,C)\mathrm{Conj}(G, C), with CC a conjugation-closed subset of the group GG, and operation x▹y=yxy−1x \triangleright y = y x y^{-1}. The profile of a quandle is the multiset of cycle lengths in the right translation map GG0 (for GG1), which for connected quandles becomes uniform across all GG2.

The Hayashi property asserts that for every right translation map GG3, all cycle lengths divide the maximal cycle length (i.e., GG4 is a regular permutation). This property can be characterized combinatorially via group-theoretic intersections: for GG5, requiring GG6 suffices for GG7 to be regular in GG8.

Results for Finite Coxeter Groups

The core of the paper is devoted to a systematic verification of the Hayashi property for conjugation quandles over all finite irreducible Coxeter groups, including both the classical families (GG9, CC0, CC1, CC2, CC3) and the exceptional types (CC4, CC5, CC6, CC7, CC8, CC9).

Symmetric Groups ((X,â–¹)(X, \triangleright)0) and Dihedral Groups ((X,â–¹)(X, \triangleright)1)

For (X,â–¹)(X, \triangleright)2, explicit combinatorial arguments show that for any conjugacy class (X,â–¹)(X, \triangleright)3, there exist (X,â–¹)(X, \triangleright)4 such that (X,â–¹)(X, \triangleright)5 is trivial or central, guaranteeing the regularity of (X,â–¹)(X, \triangleright)6 in (X,â–¹)(X, \triangleright)7. Similarly, dihedral groups (X,â–¹)(X, \triangleright)8, being well-understood, are handled by explicit computations distinguishing between rotational and reflectional conjugacy classes.

Types XX2 and XX3 correspond to the wreath product XX4, and the analysis hinges on the combinatorial data of signed partitions. The order of a conjugation element and the structure of its centralizer in XX5 is characterized using the cycle product formalism. The key technical results (Lemmas \ref{lc1}, \ref{lc2}, \ref{lc3}) give, for each possible cycle type, explicit witnesses XX6 certifying the Hayashi property as demanded.

Type XX7 is addressed by reduction from XX8 using the subgroup relation and properties of index two subgroups. In all these cases, the arguments are robust for XX9 (with small values checked computationally).

Exceptional Coxeter Groups (Rx:y↦y▹xR_x: y \mapsto y \triangleright x0)

For the exceptional types, the paper employs computational group theory (using GAP) to conduct exhaustive searches for suitable Rx:y↦y▹xR_x: y \mapsto y \triangleright x1 as witnesses for the property Rx:y↦y▹xR_x: y \mapsto y \triangleright x2. For all cases except Rx:y↦y▹xR_x: y \mapsto y \triangleright x3, this search is computationally trivial; for Rx:y↦y▹xR_x: y \mapsto y \triangleright x4, a more sophisticated subset search suffices. In all cases considered, witnesses are found, confirming the Hayashi property for all exceptional types and all conjugation-closed subsets.

Unions of Conjugacy Classes and Structural Properties

A significant aspect of the work is the extension from single conjugacy classes to arbitrary unions of conjugacy classes Rx:y↦y▹xR_x: y \mapsto y \triangleright x5. The analysis makes crucial use of properties of centralizers and centers of normal subgroups generated by these unions. Lemmas demonstrate that if Rx:y↦y▹xR_x: y \mapsto y \triangleright x6 is regular for each Rx:y↦y▹xR_x: y \mapsto y \triangleright x7 and Rx:y↦y▹xR_x: y \mapsto y \triangleright x8, regularity extends to Rx:y↦y▹xR_x: y \mapsto y \triangleright x9 acting on Conj(G,C)\mathrm{Conj}(G, C)0. The property is further generalized for unions of Conj(G,C)\mathrm{Conj}(G, C)1-conjugate classes.

The paper also catalogs the normal subgroups generated by conjugacy classes in Conj(G,C)\mathrm{Conj}(G, C)2, identifying precisely when the center inclusion needed for regularity holds.

Implications and Directions for Future Research

The principal implication is that all finite Coxeter groups are "good" in the sense of Filip. This sharply delineates the structural class of groups (at least, all direct products of finite irreducible Coxeter groups) where the Hayashi property holds robustly.

The existence of finite groups (such as Conj(G,C)\mathrm{Conj}(G, C)3 with certain conjugation-closed subsets) failing the property asserts that goodness is nontrivial and warrants further group-theoretic and combinatorial classification. The posed open problem is the classification of all finite groups Conj(G,C)\mathrm{Conj}(G, C)4 such that Conj(G,C)\mathrm{Conj}(G, C)5 satisfies the property for all conjugation-closed Conj(G,C)\mathrm{Conj}(G, C)6. This challenges group theorists to uncover new algebraic characterizations, possibly connecting to broader theory around permutation group profiles and quandle automorphisms.

From a practical perspective, the results ensure that algebraic invariants derived from conjugation quandles associated to Coxeter groups retain regular profile properties, facilitating further work in topological, combinatorial, and representation-theoretic applications involving Coxeter symmetries.

Conclusion

The paper establishes that, for all finite irreducible Coxeter groups and all conjugation-closed subsets, the corresponding conjugation quandles satisfy the Hayashi property. The argument combines explicit combinatorial reasoning, group-theoretic classification, and computational verifications, covering both classical and exceptional Coxeter groups, and generalizes to unions of conjugacy classes under verifiable center conditions. This comprehensive structural result solidifies the connection between the algebraic profiles of quandles and the deep symmetries encoded by finite Coxeter groups, with broad implications for algebraic combinatorics and knot theory. Further classification of "good" groups remains an open line of inquiry.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.