Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.
De Loera, Raymond Hemmecke, Jeremiah Tauzer, and Ruriko Yoshida
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.
Arithmetic terms can encode undecidable problems, chaotic dynamics like the logistic map, and Turing-universal functions, with an application to bounded proof search.
citing papers explorer
-
Maximally Random Sortition
Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.
-
Computing a holonomic submodule of the partial Weyl closure
New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.
-
Undecidability, Chaos and Universality in Arithmetic Terms
Arithmetic terms can encode undecidable problems, chaotic dynamics like the logistic map, and Turing-universal functions, with an application to bounded proof search.