ProbXiv
Explorersign in
Problem archiveProblem record

Statement

  1. Racks We do not know whether the following Question could be answered. Question 3. Classify the pairs (G, V ) where G is a finite group and V \in CG CG YD satisfies dim B(V ) < \infty and compute the relations of B(V ). If G is abelian, then both problems are solved by Heckenberger and Angiono respectively, see the talk of the latter. Next, one may focus on finite simple groups (see the talk of Vendramin), or, in the language of racks [4], on V ’s with supp V a simple rack [3]. Simple racks, classified in [4, 11], are of two kinds: those with pn elements (p prime) and the rest (including conjugacy classes in finite simple groups that were studied intensively). Here is a recent progress for the former: Theorem 1. [9] If V has dim B(V ) < \infty and supp V is a simple rack with p elements (p prime), then V belongs to a short list (and p \leq 7). Based on unpublished calculations we dare to claim that the techniques of [9] could be adapted to simple racks with pn elements (p prime). Conjecture 1 makes sense for Hopf algebras whose coradical is a Hopf subal- gebra; Questions 1 and 2 are valid replacing CG by a semisimple Hopf algebra. Finally, the previous considerations could be adapted to Hopf algebras with finite GK-dimension; see [1] and the talk by Angiono. 3. Finite-generation of cohomology A well-known conjecture by Etingof and Ostrik was positively answered in [2] for finite-dimensional pointed Hopf algebras with abelian group, using the structure as stated in Conjecture 1, that is a Theorem in this case, as already said. We shall outline the corresponding strategy.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.