Entropy and polynomial entropy of derived autoequivalences of derived discrete algebras

TL;DR

This paper calculates entropy and polynomial entropy of derived autoequivalences in derived discrete algebras, providing insights into their complexity and dynamical behavior.

Contribution

It introduces explicit calculations of entropy and polynomial entropy for derived autoequivalences of derived discrete algebras, advancing understanding of their dynamical properties.

Findings

Entropy and polynomial entropy are explicitly computed for derived autoequivalences.

Results reveal the dynamical complexity of derived discrete algebras.

The work connects algebraic autoequivalences with dynamical invariants.

Abstract

The aim of this paper is to calculate entropy in the sense of Dimitrov-Haiden-Katzarkov-Kontsevich and polynomial entropy as defined by Fan-Fu-Ouchi of derived autoequivalences of derived discrete algebras over an algebraically closed field.