Long mutation cycles

Abstract A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $$n\ge 4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> , we describe arbitrarily long mutation cycles involving n -vertex quivers. Each of these mutation cycles allows for an arbitrary choice of $$\left( {\begin{array}{c}n\\ 2\end{array}}\right) $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfenced> <mml:mrow> <mml:mtable> <mml:mtr> <mml:mtd> <mml:mi>n</mml:mi> </mml:mtd> </mml:mtr> <mml:mtr> <mml:mtd> <mml:mrow> <mml:mrow/> <mml:mn>2</mml:mn> </mml:mrow> </mml:mtd> </mml:mtr> </mml:mtable> </mml:mrow> </mml:mfenced> </mml:math> positive integer parameters. None of the mutation cycles we construct can be paved by short mutation cycles.

Authors

Institutions

Publication Details

Journal
Selecta Mathematica
Published
2025-10-29
DOI
https://doi.org/10.1007/s00029-025-01090-1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Long mutation cycles

Sergey Fomin, Scott Neville
Selecta Mathematica
Graph theory and applications
article

Long mutation cycles

Sergey Fomin, Scott Neville
article en

Abstract

Abstract A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $$n\ge 4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> , we describe arbitrarily long mutation cycles involving n -vertex quivers. Each of these mutation cycles allows for an arbitrary choice of $$\left( {\begin{array}{c}n\\ 2\end{array}}\right) $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfenced> <mml:mrow> <mml:mtable> <mml:mtr> <mml:mtd> <mml:mi>n</mml:mi> </mml:mtd> </mml:mtr> <mml:mtr> <mml:mtd> <mml:mrow> <mml:mrow/> <mml:mn>2</mml:mn> </mml:mrow> </mml:mtd> </mml:mtr> </mml:mtable> </mml:mrow> </mml:mfenced> </mml:math> positive integer parameters. None of the mutation cycles we construct can be paved by short mutation cycles.

Selecta MathematicaVol. 31(5)
University of Michigan (US)
Openalex Percentile: Top 63%
Graph theory and applications
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.