2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/218733We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds.15 pages, (v2) referee comments and suggestions incorporatedMetric GeometryCombinatorics52C17, 90C22text