Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
View through CrossRef
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.
Title: Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
Description:
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.
Related Results
On Goethals and Seidel Array
On Goethals and Seidel Array
Objectives: In this article, we aim to find a series of Hadamard matrices by suitable selection of the special class of matrices given in the Goethals and Seidel array and study th...
A note on the Seidel and Seidel Laplacian matrices
A note on the Seidel and Seidel Laplacian matrices
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph. We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix...
Serial Computations of Levenshtein Distances
Serial Computations of Levenshtein Distances
In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. Th...
Seidel Equienergetic Graphs
Seidel Equienergetic Graphs
The Seidel matrix S(G) of a graph G is the square matrix with diagonal entries zeroes and off diagonal entries are – 1 or 1 corresponding to the adjacency and non-adjacency. The Se...
Seidel Switching and Graph Energy
Seidel Switching and Graph Energy
The energy of a graph T is the sum of the absolute values of the eigenvalues of the adjacency matrix of T. Seidel switching is an operation on the edge set of T. In some special ca...
Quantitative Research Methods for Sub-dialect Division of Jeollanam-do: Using Levenshtein Distance and Phonological Network Analysis
Quantitative Research Methods for Sub-dialect Division of Jeollanam-do: Using Levenshtein Distance and Phonological Network Analysis
The purpose of our study is to divide the sub-dialects of Jeollanam-do using Levenshtein distance and network analysis. For the first time, we measured the Levenshtein distance on ...
PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE
PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE
Typographical errors are commonly found in text. Many applications implement a spell checking feature to detect and correct typographical errors. Spell checking requires an algorit...
Robust and Efficient Reduced Newton (Seidel) Methods Based on Residual Ordering
Robust and Efficient Reduced Newton (Seidel) Methods Based on Residual Ordering
Abstract
The Sequential Fully Implicit formulation for reservoir simulation allows for specialized solution methods for the flow and transport subproblems. The trans...