Twice-marked banana graphs & Brill–Noether generality

We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz–Brill–Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill–Noether general. These are the first such examples since the analysis of chains of loops by Cools, Draisma, Payne and Robeva. The graphs constructed are chains of loops and “theta graphs,” which are banana graphs of genus <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>2</mml:mn> </mml:math> . We also demonstrate that almost all banana graphs of genus at least <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>3</mml:mn> </mml:math> cannot be used for this purpose, due either to failure of a submodularity condition or to the presence of far too many inversions, in certain permutations associated to divisors called transmission permutations.

Authors

Publication Details

Journal
Algebraic Combinatorics
Published
2025-10-31
DOI
https://doi.org/10.5802/alco.443
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Twice-marked banana graphs & Brill–Noether generality

Nathan Pflueger, Noah M. Solomon
Algebraic Combinatorics
Advanced Combinatorial Mathematics
article

Twice-marked banana graphs & Brill–Noether generality

Nathan Pflueger, Noah M. Solomon
article en

Abstract

We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz–Brill–Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill–Noether general. These are the first such examples since the analysis of chains of loops by Cools, Draisma, Payne and Robeva. The graphs constructed are chains of loops and “theta graphs,” which are banana graphs of genus <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>2</mml:mn> </mml:math> . We also demonstrate that almost all banana graphs of genus at least <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>3</mml:mn> </mml:math> cannot be used for this purpose, due either to failure of a submodularity condition or to the presence of far too many inversions, in certain permutations associated to divisors called transmission permutations.

Algebraic CombinatoricsVol. 8(5)
Openalex Percentile: Top 61%
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.