2000 character limit reached
Periodicity shadows II. Computational aspects (2411.19682v3)
Published 29 Nov 2024 in math.RT
Abstract: This article provides the second part of the research initiated in arXiv:2411.17381, where we introduced and investigated so called periodicity shadows, which are special skew-symmetric matrices related to symmetric algebras with periodic simple modules. In arXiv:2411.17381 we focused on theoretical aspects, whereas here we present complementary cosiderations concerning computational issues. Namely, we discuss an algorithm, which computes all tame periodicity shadows of given size (see Section 2), and then present lists of all tame periodicity shadows of small sizes, that is at most 6.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.