Pith. sign in

REVIEW 2 major objections 1 minor 20 references

The combinatorial counting of relations among relations matches the representation-theoretic dimension for C_n^(1) standard modules at level 5 with n arbitrary and for C_3^(1) at arbitrary level k.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-26 15:16 UTC pith:EWUTKUTE

load-bearing objection This paper adds two explicit cases (level 5 arbitrary n, and C3 arbitrary k) where the existing trapezoid counting matches the dimension, but the extension assumes the prior parametrization needs no adjustment. the 2 major comments →

arxiv 2606.19994 v1 pith:EWUTKUTE submitted 2026-06-18 math.QA

Two examples of combinatorial relations among relations of C_(n)sp{(1)}-standard modules for higher levels

Tomislav \v{S}iki\' c This is my paper
classification math.QA
keywords relations among relationsGroebner-like basisaffine Lie algebrasC_n^(1)standard modulesvertex operator algebrascombinatorial parametrizationtrapezoid count
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper extends earlier constructions of relations among relations used in building Groebner-like bases for maximal ideals in universal vertex operator algebras attached to affine Lie algebras. It demonstrates that the same counting procedure succeeds in two additional infinite families of cases for type C_n^(1). The procedure counts the required relations inside a trapezoid drawn from the array of negative root vectors and checks that this count equals the known dimension coming from representation theory. A sympathetic reader would see this as evidence that the explicit basis construction can now be completed for these modules.

Core claim

The same counting method can be carried out for C_n^(1)-standard modules at the fixed level k=5 with n arbitrary, and for C_3^(1)-standard modules for arbitrary level k, by comparing the number of required relations among relations in a trapezoid of the array of negative root vectors with the corresponding representation-theoretic dimension.

What carries the argument

The trapezoid of negative root vectors, which supplies a combinatorial parametrization of the relations among relations whose cardinality is then matched to the representation dimension.

Load-bearing premise

The combinatorial parametrization developed in earlier works identifies exactly the relations needed for the Groebner-like basis construction without missing or overcounting terms.

What would settle it

An explicit computation, for the smallest new case such as C_3 at level 3, of the actual dimension of the space of quadratic relations among the generators and a direct check whether that dimension equals the number of cells inside the corresponding trapezoid.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • The Groebner-like basis construction of the maximal ideal can be completed for all C_n^(1) standard modules at level 5.
  • The same construction can be completed for all C_3^(1) standard modules at every positive integer level.
  • The number of relations among relations is given exactly by the number of positions inside the trapezoid for each of these families.
  • The method that worked for level 2 and for C_2 at higher levels extends without change to these two new families.

Where Pith is reading between the lines

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

  • Similar trapezoid counts may exist for other fixed levels with n arbitrary or for other small ranks with arbitrary level.
  • If the count always matches, explicit monomial bases for the maximal ideals become available for all these modules.
  • The same geometric counting device could be tested on affine types other than C.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 1 minor

Summary. The paper extends prior combinatorial constructions of relations among relations for affine Lie algebras of type C_n^{(1)} by exhibiting two families where the same counting method applies: C_n^{(1)}-standard modules at fixed level k=5 (n arbitrary) and C_3^{(1)}-standard modules at arbitrary level k. In each case the number of relations among relations is obtained by counting inside a trapezoid of the array of negative root vectors and is asserted to equal the independently known representation-theoretic dimension of the space of such relations.

Significance. If the claimed equalities hold, the work supplies additional concrete instances supporting the feasibility of a combinatorial Groebner-like basis construction for the maximal ideal of the universal vertex operator algebra V^k_g. It builds directly on the parametrizations developed in the cited works [PS3] and [S] and therefore contributes incremental evidence toward a general method, though it does not introduce new machinery or prove generality.

major comments (2)
  1. [Abstract] Abstract: the central claim that the prior combinatorial parametrization extends unchanged to arbitrary n at level k=5 (and to arbitrary k for C_3) is load-bearing, yet the manuscript provides no explicit verification that no additional relations appear when the root system grows or when level-dependent multiplicities change. Without such a check the equality with the representation dimension cannot be confirmed.
  2. [Abstract] Abstract: the trapezoid counting procedure is described only at the level of the abstract; the manuscript does not record the precise combinatorial rules, the definition of the trapezoid boundaries, or the explicit bijection to the basis elements used in the dimension formula, rendering the extension non-reproducible from the given text.
minor comments (1)
  1. The title refers to 'higher levels' while one family is fixed at k=5; a brief clarification of the scope would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and the constructive suggestions. We respond to each major comment below and will revise the manuscript to address the concerns about explicit verification and reproducibility.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the prior combinatorial parametrization extends unchanged to arbitrary n at level k=5 (and to arbitrary k for C_3) is load-bearing, yet the manuscript provides no explicit verification that no additional relations appear when the root system grows or when level-dependent multiplicities change. Without such a check the equality with the representation dimension cannot be confirmed.

    Authors: We agree that an explicit verification for the scaling with n and k would strengthen the manuscript. In the revision we will add a new subsection (after the abstract examples) that performs direct checks for small n (n=3 and n=4) at level k=5 and for small k (k=3 and k=4) in the C_3 case, confirming that the trapezoid count continues to match the known representation-theoretic dimension with no extra relations appearing. The combinatorial rules inherited from [PS3] and [S] are formulated so that the trapezoid boundaries automatically adjust with the root system size and level multiplicities; the added checks will make this scaling explicit. revision: yes

  2. Referee: [Abstract] Abstract: the trapezoid counting procedure is described only at the level of the abstract; the manuscript does not record the precise combinatorial rules, the definition of the trapezoid boundaries, or the explicit bijection to the basis elements used in the dimension formula, rendering the extension non-reproducible from the given text.

    Authors: The rules and trapezoid are those of the cited works [PS3] and [S], but we accept that a self-contained recap is needed. In the revised manuscript we will insert a short preliminary section that (i) recalls the precise combinatorial selection rules for admissible pairs, (ii) defines the trapezoid boundaries explicitly in terms of the negative root array and the level k (specifically, roots whose indices satisfy 1 ≤ i ≤ j ≤ n with height bounds determined by k=5 or by the C_3 root lengths), and (iii) states the explicit bijection between the counted elements and the standard monomial basis of the relation space whose dimension is given by the representation-theoretic formula. revision: yes

Circularity Check

0 steps flagged

Minor self-citation of prior combinatorial parametrization; central equality checked against independent representation dimension

full rationale

The paper cites its own prior works [PS3] and [S] for the combinatorial parametrization of relations among relations and reuses the same trapezoid counting method for the new families (Cn^(1) at k=5 and C3^(1) at arbitrary k). This is a self-citation but is not load-bearing for the central claim, which consists of verifying that the count equals the independently known representation-theoretic dimension. No equation reduces by construction to a fitted input, no ansatz is smuggled, and the dimension serves as an external benchmark rather than being derived from the same combinatorial data. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard facts from the representation theory of affine Lie algebras and on the combinatorial framework developed in the two cited papers. No new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption Standard facts about the representation theory of affine Lie algebras of type C_n^(1) and the dimension formulas for their standard modules.
    Invoked when the paper compares the combinatorial count to the representation-theoretic dimension.
  • domain assumption The combinatorial parametrization of relations among relations from the cited works [PS3] and [S] applies without modification to the new cases.
    This is the assumption that allows the counting method to be carried out for k=5 and for C_3.

pith-pipeline@v0.9.1-grok · 5702 in / 1541 out tokens · 24450 ms · 2026-06-26T15:16:24.600152+00:00 · methodology

0 comments
read the original abstract

The construction of relations among relations is one ingredient in the Groebner-like basis construction of the maximal ideal of the universal vertex operator algebra $V^k_{\mathfrak g}$ for affine Lie algebras. For affine Lie algebras of type $C_n^{(1)}$, such combinatorially parametrized relations among relations were constructed in earlier work for level $2$ standard modules \cite{PS3}, and for $C_2^{(1)}$-standard modules at higher levels \cite{S}. This article presents two further examples in which the same counting method can be carried out. The first treats $C_n^{(1)}$-standard modules at the fixed level $k=5$, with $n$ arbitrary. The second treats $C_3^{(1)}$-standard modules for arbitrary level $k$. In both cases the calculation compares the number of required relations among relations in a trapezoid of the array of negative root vectors with the corresponding representation-theoretic dimension.

Figures

Figures reproduced from arXiv: 2606.19994 by Tomislav \v{S}iki\' c.

Figure 4
Figure 4. Figure 4: Assume that π allows two embeddings of leading terms of relations for level k standard modules. Then supp π is one of the following types : (As) for s = 2, 3, 4, 5, 6, 7 (Bs ∣) for s = 1, 2, 3, 4, 5, 6 (Bs ∣∣) for s = 1, 2, 3, 4, 5 (C∣ s) for s = 1, 2, 3, 4, 5, 6 (C∣∣ s) for s = 1, 2, 3, 4, 5 (Ds ∣ t) for s, t = 1, 2, 3, 4, 5 where s + t ≤ 6 (Ds ∣∣ t) for s, t = 1, 2, 3, 4 where s + t ≤ 5. (5.1) [PITH_FUL… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 5 canonical work pages · 3 internal anchors

  1. [1]

    Bourbaki, Groupes et alg\`ebres de Lie, Chapitres VIII; Hermann, Paris, 1975

    N. Bourbaki, Groupes et alg\`ebres de Lie, Chapitres VIII; Hermann, Paris, 1975

    1975

  2. [2]

    Capparelli, A

    S. Capparelli, A. Meurman, A. Primc and M. Primc, New partition identities from C_ (1) -modules , Glas. Mat. Ser. III 57(77) (2022), 161--184

    2022

  3. [3]

    Dousse and I

    J. Dousse and I. Konan, Characters of level 1 standard modules of C_n (1) as generating functions for generalised partitions , arXiv:2212.12728 (2022)

    work page arXiv 2022

  4. [4]

    N. Jing, K. Misra, C. Savage, On Multi-Color Partitions and the Generalized Rogers–Ramanujan Identities, Communications in Contemporary Mathematics, Vol. 03, No. 04, pp. 533-548 (2001)

    2001

  5. [5]

    V. G. Kac, Infinite-dimensional Lie algebras 3rd ed, Cambridge Univ. Press, Cambridge, 1990

    1990

  6. [6]

    Classical freeness of $\widehat{\mathfrak{sl}}_n$ at level $1$ via combinatorics

    S. Kanade, Classical Freeness of sl _n at Level 1 via Combinatorics , arXiv:2606.19234 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  7. [7]

    Remarks on the conjectures of Capparelli, Meurman, Primc and Primc

    S. Kanade, M.C. Russell, S. Tsuchioka, S.O. Warnaar, Remarks on the conjectures of Capparelli, Meurman, Primc and Primc, arXiv:2404.03851 (2024)

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  8. [8]

    Lepowsky and H.-S

    J. Lepowsky and H.-S. Li, Introduction to Vertex Operator Algebras and Their Representations, Progress in Math. Vol. 227, Birkha\"user, Boston, 2003

    2003

  9. [9]

    Lepowsky and M

    J. Lepowsky and M. Primc,

  10. [10]

    Lepowsky and R

    J. Lepowsky and R. L. Wilson, The structure of standard modules, I: Universal algebras and the Rogers-Ramanujan identities, Invent. Math. 77 (1984), 199--290; II: The case A_1^ (1) , principal gradation , Invent. Math. 79 (1985), 417--442

    1984

  11. [11]

    Meurman and M

    A. Meurman and M. Primc, Annihilating fields of standard modules of sl (2, C)\, \, and combinatorial identities , Memoirs of the Amer. Math. Soc. 137, No. 652 (1999)

    1999

  12. [12]

    Meurman and M

    A. Meurman and M. Primc, A basis of the basic sl (3, C)\, \,-module , Commun. Contemp. Math. 3 (2001), 593--614

    2001

  13. [13]

    Orosi, A simple derivation of Faulhaber's formula, Applied Math

    G. Orosi, A simple derivation of Faulhaber's formula, Applied Math. E-Notes 18 (2018), 124--126

    2018

  14. [14]

    Primc, Some Combinatorial Coincidences for Standard Representations of Affine Lie Algebras, part of the book D

    M. Primc, Some Combinatorial Coincidences for Standard Representations of Affine Lie Algebras, part of the book D. Adamovi\' c, P. Papi, Affine, Vertex and W-algebras , Springer INdAM Series (SINDAMS, Vol. 37) (2019) 203-218

    2019

  15. [15]

    Primc and T

    M. Primc and T. Siki\' c, Combinatorial Bases of Basic Modules for Affine Lie Algebras C_n (1) , J. Math. Phys. 57 (9) (2016), 1–19

    2016

  16. [16]

    Primc and T

    M. Primc and T. Siki\' c, Leading terms of relations for standard modules of affine Lie algebras C_n (1) , Ramanujan J. 48 (2019), 509--543

    2019

  17. [17]

    Primc and T

    M. Primc and T. Siki\' c, Combinatorial relations among relations for level 2 standard C_ n (1) -modules , J. Math. Phys. 64 (2023), 1–14

    2023

  18. [18]

    Primc and G

    M. Primc and G. Trup cevi\' c, Linear independence for C_ (1) by using C_ 2 (1) , arXiv:2403.06881 (2024)

    work page arXiv 2024

  19. [19]

    M. C. Russell, Companions to the Andrews-Gordon and Andrews-Bressoud identities, and recent conjectures of Capparelli, Meurman, Primc, and Primc, arXiv:2306.16251 (2023)

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  20. [20]

    Šikić, Combinatorial relations among relations of C_ 2 (1) -standard modules for higher levels , Europ

    T. Šikić, Combinatorial relations among relations of C_ 2 (1) -standard modules for higher levels , Europ. J. Math. Vol 10/4/52 (2024), 1–16

    2024