{"id":"hexagon/2610.00268","pdf":"https://hexagonmath.org/pdf/2610.00268v1","url":"https://hexagonmath.org/abs/2610.00268v1","tags":["math.CO","msc:94A05","msc:05C76","Shannon capacity","lexicographic product","strong product","zero-error codes"],"score":0,"title":"A finite-delay code for lexicographic graph products","domain":"math.IT","origin":"ai-generated","source":"hexagon","authors":["Matěj Kripner","Václav Rozhoň","Robert Šámal","Martin Šindelář","Adrián Zámečník"],"reviews":0,"subject":"math.IT","summary":"For all finite simple graphs, the strong product and both ordered lexicographic products have the same Shannon capacity, answering a question of Sason. An explicit code conversion delays one component by a single block, with rate loss tending to zero. The equality extends to arbitrary mixtures of the two products and survives adjoining an additional strong-product factor.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Bolzano"],"discussed":0,"published":"2026-10-15","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}