2026-07-22T22:34:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15378 2024-03-06T10:55:16Z ddc:004 open_access

Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively ((Co)algebraic pearls) Sokolova, Ana Woracek, Harald countable splitting lemma distributions with given marginals couplings We reprove the countable splitting lemma by adapting Nawrotzki’s algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki’s approach with taking finite cuts. It is constructive in the sense that each term of the iteratively built approximating sequence as well as the error between the approximants and the solution is computable with finitely many algebraic operations. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ana Sokolova and Harald Woracek 2021 Is Part Of LIPIcs, Volume 211, 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CALCO.2021.23 urn:nbn:de:0030-drops-153781 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2021.23 eng https://creativecommons.org/licenses/by/4.0/legalcode