Codes and designs in multivariate $Q$-polynomial association schemes

Jing Wang; Minjia Shi; Patrick Sol\'e

arxiv: 2605.17122 · v3 · pith:FPA32OAPnew · submitted 2026-05-16 · 🧮 math.CO

Codes and designs in multivariate Q-polynomial association schemes

Minjia Shi , Jing Wang , Patrick Sol\'e This is my paper

Pith reviewed 2026-05-20 14:26 UTC · model grok-4.3

classification 🧮 math.CO MSC 05E30

keywords association schemesQ-polynomialDelsarte boundsWilson polynomialscodesdesignsRao boundsorthogonal arrays

0 comments

The pith

In weakly metric multivariate Q-polynomial association schemes, Delsarte-type bounds on codes and designs extend via Wilson polynomials.

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

The paper generalizes Delsarte's 1973 bounds on codes of given degree and designs of given strength to multivariate Q-polynomial association schemes. It assumes the scheme is weakly metric to derive upper bounds on the size of codes with a fixed degree or a fixed number of pairwise distances. Codes attaining the bounds are characterized by the match of their annihilators to the degree or distance Wilson polynomial. Two Rao-type bounds are obtained for designs of given strength, with equality cases termed degree tight or distance tight designs that force a Lloyd-like condition on the Wilson polynomial analogue. The work supplies applications to Lee distance codes, mixed level orthogonal arrays and ordered orthogonal arrays while realizing the formal duality between codes and designs inside self-dual translation schemes.

Core claim

What carries the argument

The degree and distance Wilson polynomials, which serve as annihilators that characterize codes and designs attaining the generalized bounds.

If this is right

Upper bounds apply to the cardinality of codes of any given degree.
Upper bounds also apply to codes possessing any prescribed number of pairwise distances.
Two Rao-type upper bounds hold for the size of designs of any given strength.
A design attaining either bound is degree tight or distance tight and forces a Lloyd-like condition on the Wilson polynomial analogue.
The formal duality between perfect codes and tight designs becomes concrete inside self-dual translation schemes.

Where Pith is reading between the lines

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

The new bounds supply explicit size limits for Lee-distance codes of fixed degree.
The design bounds restrict the parameters of mixed-level and ordered orthogonal arrays.
In self-dual translation schemes the existence of a perfect code directly yields a corresponding tight design.

Load-bearing premise

The association scheme is weakly metric in the sense of Solé (1989).

What would settle it

A code in a weakly metric multivariate Q-polynomial association scheme whose cardinality exceeds the derived upper bound, yet whose annihilator does not coincide with the corresponding Wilson polynomial, would disprove the bound.

Figures

Figures reproduced from arXiv: 2605.17122 by Jing Wang, Minjia Shi, Patrick Sol\'e.

read the original abstract

We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give upper bounds on the size of codes of given degree, and also on the size of codes with a given number of pairwise distances. Codes meeting these bounds are characterized by the identification of suitable annihilators with the degree (resp. distance) Wilson polynomial. We give two analogues of the Rao bound on the size of designs with given strength. Designs meeting that bound we call degree tight designs or distance tight design depending on the bound met. In both cases, the existence of a tight design implies a Lloyd-like condition on a suitable analogue of the Wilson polynomial. Applications to the Lee distance, mixed level orthogonal arrays, ordered orthogonal arrays, and more are given. The formal duality between codes and designs, connecting perfect codes and tight designs, is made concrete in self-dual translation schemes.

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

This extends Delsarte bounds to multivariate Q-polynomial schemes via the weakly metric assumption, but leaves verification of that assumption for the concrete applications unshown.

read the letter

The main takeaway is that the paper carries the classical Delsarte bounds on codes of given degree or given number of distances, plus Rao-type bounds on designs, over to the multivariate Q-polynomial association schemes introduced in Bannai et al. 2025. It does so by assuming the scheme is weakly metric in the sense of Solé 1989, which supplies the ordering on relations, the three-term recurrence, and the identification of annihilators with Wilson polynomial analogues. Tight codes and designs then satisfy Lloyd-like conditions on those polynomials. Two versions of the Rao bound appear, one for degree and one for distance, and the paper names the meeting cases degree-tight or distance-tight designs accordingly. The formal duality between codes and designs is made explicit for self-dual translation schemes. Applications are listed for Lee-metric codes, mixed-level orthogonal arrays, and ordered orthogonal arrays. That package of results is the actual new content. The work is a direct generalization rather than a reduction to fitted quantities, and the citation pattern to Delsarte, Solé, and the 2025 Bannai reference is appropriate. The central argument is coherent once the weakly metric premise is granted. The soft spot is exactly where the stress-test note flags it. The paper states the assumption but does not derive or cite a check that the specific schemes in the applications satisfy Solé's intersection-number relations. If any of those schemes fails the condition, the polynomial identification and the resulting size bounds do not follow from the classical argument. The abstract presents the generalizations without derivations or error analysis, so the full text would need to supply those steps for the claims to land. This is for people already working in association schemes and combinatorial coding theory who follow the multivariate extensions. A reader focused on bounds in non-standard metrics or mixed-level designs will find the applications and the tight-design characterizations useful. The paper shows clear engagement with the literature and is internally consistent on its own terms. It deserves a serious referee. I would recommend sending it to peer review, with the referee asked to confirm whether the weakly metric property holds in the listed examples.

Referee Report

2 major / 1 minor

Summary. The paper generalizes Delsarte's 1973 bounds on codes of given degree and designs of given strength to the setting of multivariate Q-polynomial association schemes (Bannai et al. 2025), under the assumption that the scheme is weakly metric in the sense of Solé (1989). It derives upper bounds on code sizes for given degree or given number of pairwise distances, characterizes equality cases by identifying annihilators with degree or distance Wilson polynomial analogues, and provides two Rao-type bounds for designs (degree-tight and distance-tight), with Lloyd-like conditions on the polynomials. Applications are discussed for the Lee metric, mixed-level orthogonal arrays, ordered orthogonal arrays, and self-dual translation schemes, where the code-design duality is made explicit.

Significance. If the central claims hold, the work would extend classical coding-theoretic bounds to a new multivariate framework, offering a unified approach to bounding codes and designs across several metrics and combinatorial objects. The explicit treatment of tight designs and the concrete duality in self-dual schemes would be a useful addition to the literature on association schemes.

major comments (2)

[Applications section] The extension of the Delsarte and Rao bounds relies on the weakly metric assumption (Solé 1989) to guarantee the three-term recurrence and the identification with Wilson polynomial analogues, yet the manuscript provides no derivation or citation verifying that the concrete schemes in the applications (Lee metric, mixed-level orthogonal arrays, ordered orthogonal arrays, self-dual translation schemes) satisfy the required intersection-number relations. This verification is load-bearing for the polynomial conditions and resulting size bounds.
[Main results] The abstract and introduction present the generalizations and characterizations as following directly from the weak metric assumption, but the text does not include explicit step-by-step derivations showing how the bounds are obtained without post-hoc restrictions on the parameters, nor does it contain error analysis or verification steps for the Lloyd-type conditions.

minor comments (1)

[Introduction] The notation for the multivariate Q-polynomial scheme and the Wilson polynomial analogues should be introduced with a brief reminder of the relevant definitions from Bannai et al. (2025) to improve readability for readers not immediately familiar with the 2025 framework.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their detailed and constructive report. We address each major comment below and indicate the revisions we plan to make to the manuscript.

read point-by-point responses

Referee: [Applications section] The extension of the Delsarte and Rao bounds relies on the weakly metric assumption (Solé 1989) to guarantee the three-term recurrence and the identification with Wilson polynomial analogues, yet the manuscript provides no derivation or citation verifying that the concrete schemes in the applications (Lee metric, mixed-level orthogonal arrays, ordered orthogonal arrays, self-dual translation schemes) satisfy the required intersection-number relations. This verification is load-bearing for the polynomial conditions and resulting size bounds.

Authors: We agree that explicit verification of the weakly metric property and intersection numbers for the applications is essential. In the revised version, we will add a new subsection in the Applications section that provides the necessary citations and brief derivations confirming that the Lee metric, mixed-level orthogonal arrays, ordered orthogonal arrays, and self-dual translation schemes satisfy the required relations under the weakly metric assumption. This will ensure the bounds apply directly to these cases. revision: yes
Referee: [Main results] The abstract and introduction present the generalizations and characterizations as following directly from the weak metric assumption, but the text does not include explicit step-by-step derivations showing how the bounds are obtained without post-hoc restrictions on the parameters, nor does it contain error analysis or verification steps for the Lloyd-type conditions.

Authors: The derivations of the bounds and characterizations follow directly from the general theory for weakly metric multivariate Q-polynomial association schemes, without additional restrictions beyond the assumption. To improve clarity, we will include more explicit step-by-step outlines of the proofs in the main results section, detailing how the upper bounds are derived and how the equality cases lead to the identification with Wilson polynomial analogues. We will also add verification steps and discussion for the Lloyd-like conditions on the polynomials. No error analysis is needed as the results are exact under the stated assumptions. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained under explicit external assumption

full rationale

The paper explicitly states the weakly metric assumption from Solé (1989) and proceeds to generalize Delsarte-type bounds and Rao analogues via annihilator identification with Wilson polynomial analogues in the Bannai et al. (2025) multivariate Q-polynomial setting. No equation or step reduces a claimed prediction or bound to a fitted parameter or self-defined quantity by construction. The cited 1989 definition supplies the three-term recurrence and ordering needed for the classical argument to carry over; this is an independent prior reference rather than a self-referential loop internal to the present manuscript. Applications to Lee metric, orthogonal arrays, and self-dual schemes are presented as instances satisfying the stated hypothesis, without any renaming of known results or smuggling of ansatzes via citation chains that would collapse the derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on the weak metric property of the association scheme and on the existence of suitable Wilson polynomial analogues in the multivariate Q-polynomial setting. No explicit free parameters or invented entities are stated in the abstract.

axioms (1)

domain assumption The scheme is weakly metric in the sense of (Solé, 1989)
Invoked to generalize Delsarte bounds and obtain Lloyd-like conditions on Wilson polynomials.

pith-pipeline@v0.9.0 · 5724 in / 1378 out tokens · 41694 ms · 2026-05-20T14:26:23.760018+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We assume the scheme is weakly metric in the sense of (Solé, 1989). ... identification of suitable annihilators with the degree (resp. distance) Wilson polynomial.
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean embed_injective unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We give two analogues of the Rao bound on the size of designs with given strength. ... Lloyd-like condition on a suitable analogue of the Wilson polynomial.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.