# Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound

Source: [Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound](<https://www.sota2.com/research/paper/68fa5ddc1e209131ce9dd6ee>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T18:28:12.247Z

Authors: K. Mahesh Krishna

Published: 2024-11-07T03:19:22.000Z

## Abstract

Pfender \\textit{\[J. Combin. Theory Ser. A, 2007\]} provided a one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes, which offers an upper bound for the celebrated (Newton-Gregory) kissing number problem. Motivated by this proof, we introduce the notion of codes in pointed metric spaces (in particular on Banach spaces) and derive a nonlinear (functional) Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender upper bound for spherical codes. We also introduce nonlinear (functional) Kissing Number Problem.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2411.05047>)

[PDF](<https://arxiv.org/pdf/2411.05047.pdf>)
