Bayesian Modeling and Causal Inference Open access

Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities

Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang

Jun 9, 2026

Abstract

Abstract

In coding theory, the problem of list recovery asks one to find all codewords c of a given code C which such that at least 1−ρ fraction of the symbols of c lie in some predetermined set of ℓ symbols for each coordinate of the code. A key question is bounding the maximum possible list size L of such codewords for the given code C.

Direct answer

What can I do from this paper page?

Use this page to scan "Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Bayesian Modeling and Causal Inference research, save the paper, or map adjacent work.

Authors

Researchers on this paper

Joshua Brakensiek

first | University of California, Berkeley | ORCID 0000-0003-4149-7298

Yeyuan Chen

middle | University of Michigan | ORCID 0009-0006-5696-4628

Manik Dhar

middle | Massachusetts Institute of Technology | ORCID 0009-0000-5570-7116

Zihan Zhang

last | The Ohio State University | ORCID 0009-0004-8852-8156

Research areas

Follow related topics

Citation

BibTeX

@article{Brakensiek2026Combinatorial,
  title = {Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities},
  author = {Joshua Brakensiek and Yeyuan Chen and Manik Dhar and Zihan Zhang},
  year = {2026},
  doi = {10.1145/3798129.3800756},
  url = {https://doi.org/10.1145/3798129.3800756}
}

FAQ

Using this paper in a discovery workflow

How do I find related work for this paper?

Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.

How can I keep up with new Bayesian Modeling and Causal Inference research papers?

Follow Bayesian Modeling and Causal Inference research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.

Can I cite this paper from this page?

This page includes a static BibTeX block for Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.

Follow this research in Scollr

Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.

Get the app