Component-cluster cardinality and rigidity conjecture for basic algebras
Statement
Let be a basic algebra with vertices. A component cluster of is the set of vertices of a maximal complete subgraph of the graph of strongly reduced irreducible components. It is -rigid if for every component in the cluster.
Component-cluster conjecture. For any basic algebra :
The paper notes that this may be too optimistic, although it holds for the path algebra of an acyclic quiver. The conjecture concerns the size and rigidity of component clusters in the general theory of Caldero–Chapoton algebras.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.