License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2021.23
URN: urn:nbn:de:0030-drops-153781
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15378/
Sokolova, Ana ;
Woracek, Harald
Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively ((Co)algebraic pearls)
Abstract
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.
BibTeX - Entry
@InProceedings{sokolova_et_al:LIPIcs.CALCO.2021.23,
author = {Sokolova, Ana and Woracek, Harald},
title = {{Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively}},
booktitle = {9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-212-9},
ISSN = {1868-8969},
year = {2021},
volume = {211},
editor = {Gadducci, Fabio and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15378},
URN = {urn:nbn:de:0030-drops-153781},
doi = {10.4230/LIPIcs.CALCO.2021.23},
annote = {Keywords: countable splitting lemma, distributions with given marginals, couplings}
}
|
Keywords: |
|
countable splitting lemma, distributions with given marginals, couplings |
|
Collection: |
|
9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
08.11.2021 |
