summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authoraristote <quentin.aristote@irif.fr>2026-04-17 09:18:20 +0200
committeraristote <quentin.aristote@irif.fr>2026-04-17 09:20:01 +0200
commitd3b58f652a40c54b94518e3a6a831d5a51c034ba (patch)
tree253114e768f2fb2d2a54a11fdbc3ef2e157195c2
parent2c87dd40923584bc334eaed98f19f915c4a1343a (diff)
downloadinfo-d3b58f652a40c54b94518e3a6a831d5a51c034ba.tar.gz
info-d3b58f652a40c54b94518e3a6a831d5a51c034ba.tar.bz2
info-d3b58f652a40c54b94518e3a6a831d5a51c034ba.tar.xz
research: add arxiv doi
-rw-r--r--research/miscellaneous.json2
1 files changed, 1 insertions, 1 deletions
diff --git a/research/miscellaneous.json b/research/miscellaneous.json
index 3a0e2e9..7b4a336 100644
--- a/research/miscellaneous.json
+++ b/research/miscellaneous.json
@@ -1,6 +1,6 @@
[
{"id":"aristoteFunctorialApproachMinimizing2023","abstract":"We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm's implementation. We also extend the framework with a categorical algorithm for minimizing transition systems, whose instantiation retrieves the algorithm for minimizing monoidal transducers but also extends the class of output monoids for which this algorithm is valid.","accessed":{"date-parts":[["2023",7,27]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteFunctorialApproachMinimizing2023","issued":{"date-parts":[["2023",7,27]]},"language":"en","number":"04172251","publisher":"HAL","title":"Functorial approach to minimizing and learning deterministic transducers with outputs in arbitrary monoids","type":"article","URL":"https://hal.science/hal-04172251"},
- {"id":"aristoteMonotoneWeakDistributive2024","abstract":"Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminisms in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.","accessed":{"date-parts":[["2024",11,4]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteMonotoneWeakDistributive2024","issued":{"date-parts":[["2024",10]]},"language":"en","title":"Monotone weak distributive laws over the lifted powerset monad in categories of algebras","type":"article","URL":"https://hal.science/hal-04712728v5"},
+ {"id":"aristoteMonotoneWeakDistributive2024","abstract":"Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminisms in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.","accessed":{"date-parts":[["2024",11,4]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteMonotoneWeakDistributive2024","DOI":"arXiv.2507.13058","issued":{"date-parts":[["2024",10]]},"language":"en","title":"Monotone weak distributive laws over the lifted powerset monad in categories of algebras","type":"article","URL":"https://hal.science/hal-04712728v5"},
{"id":"aristoteProfunctorialAlgebras2026","abstract":"We provide a bicategorical generalization of Barr's landmark 1970 paper, in which he describes how to extend Set-monads to relations and uses this to characterize topological spaces as the relational algebras of the ultrafilter monad. With two-sided discrete fibrations playing the role of relations in a bicategory, we first characterize, in terms of exact squares, when pseudomonads on a bicategory extend to its bicategory of two-sided discrete fibrations. As a wide class of examples, we show that every Set-monad induces a pseudomonad on the 2-category of categories satisfying our criterion and thus extending to profunctors. Among these, we then focus on the ultracompletion pseudomonad, whose pseudoalgebras are ultracategories: we characterize the normalized lax algebras of its profunctorial extension as ultraconvergence spaces, a recently-introduced categorification of topological spaces.","accessed":{"date-parts":[["2026",2,2]]},"author":[{"family":"Aristote","given":"Quentin"},{"family":"Tarantino","given":"Umberto"}],"citation-key":"aristoteProfunctorialAlgebras2026","DOI":"10.48550/arXiv.2601.22721","issued":{"date-parts":[["2026",1,30]]},"number":"arXiv:2601.22721","publisher":"arXiv","source":"arXiv.org","title":"Profunctorial algebras","type":"article","URL":"http://arxiv.org/abs/2601.22721"},
{"id":"aristoteSmtlibbackendsFasterSMTLIBbased2023","abstract":"Announcement of smtlib-backends, a Haskell library providing a generic interface for interacting with SMT solvers using SMT-LIB.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteSmtlibbackendsFasterSMTLIBbased2023","container-title":"Tweag Blog","issued":{"date-parts":[["2023",2,14]]},"language":"en","title":"smtlib-backends: faster SMT-LIB-based Haskell interface to SMT solvers","title-short":"smtlib-backends","type":"post-weblog","URL":"https://www.tweag.io/blog/2023-02-14-smtlib-backends"}
]