Invariants of derived equivalences for admissible fractional Brauer graph algebras

Bohan Xing

arxiv: 2604.06557 · v2 · pith:JEN2UI5Vnew · submitted 2026-04-08 · 🧮 math.RT

Invariants of derived equivalences for admissible fractional Brauer graph algebras

Bohan Xing This is my paper

Pith reviewed 2026-05-10 18:36 UTC · model grok-4.3

classification 🧮 math.RT

keywords derived equivalencesBrauer graph algebrasgentle algebrasrepetitive algebrastrivial extensionsspecial biserial algebrasself-injective algebras

0 comments

The pith

Admissible fractional Brauer graph algebras have combinatorial invariants preserved under derived equivalences.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines admissible fractional Brauer graph algebras as a subclass of self-injective special biserial algebras. It identifies several combinatorial features of these algebras that stay the same whenever two algebras are derived equivalent. The work further shows that the algebras arise as repetitive algebras of gentle algebras and as r-fold trivial extensions of gentle algebras. These two realizations give direct combinatorial ways to compare algebras.

Core claim

Admissible fractional Brauer graph algebras admit several easily checkable combinatorial invariants for derived equivalences between them. In particular these algebras can be viewed as repetitive algebras and r-fold trivial extensions of gentle algebras.

What carries the argument

Combinatorial invariants attached to the underlying graphs together with the realizations as repetitive algebras and r-fold trivial extensions of gentle algebras.

If this is right

Mismatch in any invariant immediately shows that two algebras are not derived equivalent.
The derived equivalence relation on this class respects the graph data and extension parameters.
Properties known for gentle algebras transfer to the self-injective setting via the repetitive and trivial-extension constructions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The invariants may separate all derived equivalence classes inside the family once small examples are checked.
The same style of graph-based invariants could apply to other families of special biserial algebras.
Explicit low-dimensional examples would let one test whether the invariants are complete.

Load-bearing premise

The combinatorial invariants remain unchanged for any two derived equivalent algebras in this class.

What would settle it

A pair of admissible fractional Brauer graph algebras that are derived equivalent yet differ in one of the listed combinatorial invariants.

read the original abstract

Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial algebras, and provide several easily checkable combinatorial invariants for derived equivalences between them. In particular, we show that these algebras can be viewed as repetitive algebras and $r$-fold trivial extensions of gentle algebras.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper carves out a narrow new subclass of self-injective special biserial algebras and supplies combinatorial invariants for derived equivalences by realizing them explicitly as repetitive algebras and r-fold trivial extensions of gentle algebras.

read the letter

The main thing here is a concrete, checkable set of graph-theoretic invariants for derived equivalence inside one specific family. The authors define admissible fractional Brauer graph algebras via a combinatorial condition on the underlying graph, then exhibit functors that present them as repetitive algebras and as r-fold trivial extensions of gentle algebras. They verify that quantities such as cycle lengths, multiplicities, and the fractional parameters stay the same under these realizations and under known derived equivalences for special biserial algebras. That gives a practical test for when two such algebras are derived equivalent without having to compute the full derived category each time. The realizations themselves are the clearest part of the work; they turn an abstract question into something that can be read off the graph data. The class is deliberately restricted, so the invariants stay inside this corner of representation theory rather than applying to all self-injective special biserial algebras. That keeps the claims manageable but also limits how far the results travel. The stress-test note shows no hidden circularity or unstated finiteness assumptions, and the argument chain looks direct once the definitions are in place. A reader who already works with Brauer graph algebras or gentle algebras will find the explicit functors and the list of preserved quantities useful for quick checks. Someone outside that niche will see mostly a specialized extension of existing techniques. The paper is solid enough on its own terms to deserve referee time; the claims are narrow but the evidence presented for them is the kind that can be examined directly.

Referee Report

0 major / 3 minor

Summary. The manuscript introduces admissible fractional Brauer graph algebras as a new subclass of self-injective special biserial algebras, defined via a combinatorial condition on graphs. It shows that these algebras arise as repetitive algebras and as r-fold trivial extensions of gentle algebras, and supplies several combinatorial invariants (cycle lengths, multiplicities, fractional parameters) that are preserved under derived equivalences.

Significance. The explicit realizations as repetitive algebras and r-fold trivial extensions of gentle algebras allow the authors to transfer known results on gentle algebras to this new class. The combinatorial invariants are checkable and directly tied to the graph data, which strengthens the utility for classification problems in the derived category of special biserial algebras.

minor comments (3)

The definition of 'admissible fractional Brauer graph algebra' in §2 should include an explicit statement of the finiteness and admissibility conditions on the underlying graph to make the subclass relation to special biserial algebras immediate.
In the proof that the invariants are preserved under the functor realizing the algebra as an r-fold trivial extension (likely §4), the argument relies on the standard derived equivalence for trivial extensions; a short reference to the precise theorem used would clarify the reduction.
Notation for the fractional parameters and cycle multiplicities is introduced in §3 but used without re-statement in the invariance statements of §5; a small table summarizing the invariants would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our work on admissible fractional Brauer graph algebras, including the combinatorial invariants and the realizations as repetitive algebras and r-fold trivial extensions of gentle algebras. The recommendation for minor revision is noted. However, the report does not list any specific major comments, so we have no point-by-point responses to address.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines admissible fractional Brauer graph algebras via explicit combinatorial graph conditions ensuring they form a subclass of self-injective special biserial algebras, then provides explicit functors realizing them as repetitive algebras and r-fold trivial extensions of gentle algebras. The claimed combinatorial invariants (cycle lengths, multiplicities, fractional parameters) are shown preserved by direct verification of invariance under these functors and under known derived equivalences for special biserial algebras. No load-bearing step reduces to a self-definition, fitted input renamed as prediction, or unverified self-citation chain; all central claims rest on explicit constructions and external results for the broader class, rendering the derivation self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract supplies no explicit free parameters, background axioms, or newly postulated entities; all claims rest on standard notions of derived equivalence and gentle algebras from the existing literature.

pith-pipeline@v0.9.0 · 5347 in / 1036 out tokens · 49116 ms · 2026-05-10T18:36:42.531959+00:00 · methodology

Invariants of derived equivalences for admissible fractional Brauer graph algebras

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)