Exact rotation diameters of double-star associahedra

We determine the diameter of the graph associahedron of every double star, the tree obtained by attaching a and b leaves to the ends of an edge. For 1 ≤ a < b and b ≥ 5, the diameter is 2(a + b) + 2 + min{2a, a(a − 1)/2}. For a = b ≥ 5 it is 6a + 1. The ten smaller cases are evaluated by exhaustive breadth-first search. For the lower bounds we compare orders of leaves across the central edge with a matrix whose change under a rotation has rank at most one. Binding intervals detect when independent rows or columns vanish. Counting pairs of disjoint intervals recovers the cost of same-colour swaps and gives sharp bounds even when very few leaves lie on one side.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24371680
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact rotation diameters of double-star associahedra

Zihuan Xu
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Exact rotation diameters of double-star associahedra

Zihuan Xu
preprint en

Abstract

We determine the diameter of the graph associahedron of every double star, the tree obtained by attaching a and b leaves to the ends of an edge. For 1 ≤ a < b and b ≥ 5, the diameter is 2(a + b) + 2 + min{2a, a(a − 1)/2}. For a = b ≥ 5 it is 6a + 1. The ten smaller cases are evaluated by exhaustive breadth-first search. For the lower bounds we compare orders of leaves across the central edge with a matrix whose change under a rotation has rank at most one. Binding intervals detect when independent rows or columns vanish. Counting pairs of disjoint intervals recovers the cost of same-colour swaps and gives sharp bounds even when very few leaves lie on one side.

Zenodo (CERN European Organization for Nuclear Research)
Capital Normal University (CN)
Advanced Combinatorial Mathematics
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.

Laika access coming soon