Strong duality is proved for the Turán and Delsarte problems on compact Gelfand pairs by casting them as infinite-dimensional linear programs.
Delsarte,Bounds for unrestricted codes by linear programming, Philips Res
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Duality for Delsarte's extremal problem on compact Gelfand pairs
Strong duality is proved for the Turán and Delsarte problems on compact Gelfand pairs by casting them as infinite-dimensional linear programs.