Mutation Cycles from Reddening Sequences

Abstract Given two quivers, each with a reddening sequence, we show how to construct a plethora of mutation cycles. We give several examples, including a generalization of the construction of long mutation cycles in earlier work by the second author. We also give new results on the reddening sequences of certain mutation-acyclic quivers and forks, classifying them in some cases.

Authors

Institutions

Publication Details

Journal
Annals of Combinatorics
Published
2026-09-07
DOI
https://doi.org/10.1007/s00026-026-00849-3
Primary Topic
Algebraic structures and combinatorial models
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mutation Cycles from Reddening Sequences

Tucker J. Ervin, Scott Neville
Annals of Combinatorics
Algebraic structures and combinatorial models
article

Mutation Cycles from Reddening Sequences

Tucker J. Ervin, Scott Neville
article en

Abstract

Abstract Given two quivers, each with a reddening sequence, we show how to construct a plethora of mutation cycles. We give several examples, including a generalization of the construction of long mutation cycles in earlier work by the second author. We also give new results on the reddening sequences of certain mutation-acyclic quivers and forks, classifying them in some cases.

Annals of Combinatorics
University of Alabama (US), University of Michigan (US)
National Science Foundation, Division of Mathematical Sciences
Openalex Percentile: Top 87%
Algebraic structures and combinatorial models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.