@misc{Parent,
  author = {{OpenAI}},
  title = {{Approximate counting of common bases of two matroids}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Approximate-counting-of-common-bases-of-two-matroids-September-23-2026/main.pdf}{OAI:Approximate-counting-of-common-bases-of-two-matroids-September-23-2026}},
  year = {2026}
}

@misc{CB,
  author = {{OpenAI}},
  title = {{An FPRAS for Cell-Bounded Contingency Tables}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026/main.pdf}{OAI:An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026}},
  year = {2026}
}

@incollection{Edmonds1970,
  author = {Edmonds, Jack},
  title = {Submodular functions, matroids, and certain polyhedra},
  booktitle = {Combinatorial Structures and Their Applications},
  editor = {Guy, Richard and Hanani, Haim and Sauer, Norbert and
    Sch{\"o}nheim, Johanan},
  publisher = {Gordon and Breach},
  address = {New York},
  pages = {69--87},
  year = {1970}
}

@incollection{Helgason1974,
  author = {Helgason, Thorkell},
  title = {Aspects of the theory of hypermatroids},
  booktitle = {Hypergraph Seminar},
  editor = {Berge, Claude and Ray-Chaudhuri, Dijen},
  series = {Lecture Notes in Mathematics},
  volume = {411},
  publisher = {Springer},
  address = {Berlin},
  pages = {191--213},
  year = {1974},
  doi = {10.1007/BFb0066195}
}

@article{GH1964,
  author = {Ghouila-Houri, Alain},
  title = {Flots et tensions dans un graphe},
  journal = {Annales scientifiques de l'{\'E}cole Normale Sup{\'e}rieure},
  series = {3},
  volume = {81},
  number = {3},
  pages = {267--339},
  year = {1964},
  doi = {10.24033/asens.1132}
}

@book{GLS1988,
  author = {Gr{\"o}tschel, Martin and Lov{\'a}sz, L{\'a}szl{\'o} and
    Schrijver, Alexander},
  title = {Geometric Algorithms and Combinatorial Optimization},
  series = {Algorithms and Combinatorics},
  volume = {2},
  publisher = {Springer},
  address = {Berlin},
  year = {1988},
  doi = {10.1007/978-3-642-97881-4}
}

@article{IFF2001,
  author = {Iwata, Satoru and Fleischer, Lisa and Fujishige, Satoru},
  title = {A combinatorial strongly polynomial algorithm for minimizing
    submodular functions},
  journal = {Journal of the ACM},
  volume = {48},
  number = {4},
  pages = {761--777},
  year = {2001},
  doi = {10.1145/502090.502096}
}

@article{AHK2018,
  author = {Adiprasito, Karim and Huh, June and Katz, Eric},
  title = {Hodge theory for combinatorial geometries},
  journal = {Annals of Mathematics},
  series = {2},
  volume = {188},
  number = {2},
  pages = {381--452},
  year = {2018},
  doi = {10.4007/annals.2018.188.2.1}
}

@article{ALOV2024,
  author = {Anari, Nima and Liu, Kuikui and Oveis Gharan, Shayan and
    Vinzant, Cynthia},
  title = {Log-concave polynomials {II}: High-dimensional walks and an
    {FPRAS} for counting bases of a matroid},
  journal = {Annals of Mathematics},
  series = {2},
  volume = {199},
  number = {1},
  pages = {259--299},
  year = {2024},
  doi = {10.4007/annals.2024.199.1.4},
  note = {First circulated in 2018, arXiv:1811.01816}
}

@article{AOV2021,
  author = {Anari, Nima and Oveis Gharan, Shayan and Vinzant, Cynthia},
  title = {Log-concave polynomials, {I}: Entropy and a deterministic
    approximation algorithm for counting bases of matroids},
  journal = {Duke Mathematical Journal},
  volume = {170},
  number = {16},
  pages = {3459--3504},
  year = {2021},
  doi = {10.1215/00127094-2020-0091}
}

@article{BH2020,
  author = {Br{\"a}nd{\'e}n, Petter and Huh, June},
  title = {Lorentzian polynomials},
  journal = {Annals of Mathematics},
  series = {2},
  volume = {192},
  number = {3},
  pages = {821--891},
  year = {2020},
  doi = {10.4007/annals.2020.192.3.4}
}

@article{DFK1991,
  author = {Dyer, Martin and Frieze, Alan and Kannan, Ravi},
  title = {A random polynomial-time algorithm for approximating the
    volume of convex bodies},
  journal = {Journal of the ACM},
  volume = {38},
  number = {1},
  pages = {1--17},
  year = {1991},
  doi = {10.1145/102782.102783}
}

@incollection{DyerFrieze1991,
  author = {Dyer, Martin and Frieze, Alan},
  title = {Computing the volume of convex bodies: A case where
    randomness provably helps},
  booktitle = {Probabilistic Combinatorics and Its Applications},
  editor = {Bollob{\'a}s, B{\'e}la},
  series = {Proceedings of Symposia in Applied Mathematics},
  volume = {44},
  publisher = {American Mathematical Society},
  address = {Providence, RI},
  year = {1991},
  pages = {123--169},
  doi = {10.1090/psapm/044/1141926},
  note = {Author manuscript dated January 4, 1991}
}

@article{Prekopa1973,
  author = {Pr{\'e}kopa, Andr{\'a}s},
  title = {On logarithmic concave measures and functions},
  journal = {Acta Scientiarum Mathematicarum (Szeged)},
  volume = {34},
  pages = {335--343},
  year = {1973}
}

@inproceedings{AK2004,
  author = {Awerbuch, Baruch and Kleinberg, Robert D.},
  title = {Adaptive routing with end-to-end feedback: Distributed learning
    and geometric approaches},
  booktitle = {Proceedings of the Thirty-Sixth Annual ACM Symposium on
    Theory of Computing},
  publisher = {ACM},
  pages = {45--53},
  year = {2004},
  doi = {10.1145/1007352.1007367}
}

@article{JSV2004,
  author = {Jerrum, Mark and Sinclair, Alistair and Vigoda, Eric},
  title = {A polynomial-time approximation algorithm for the permanent
    of a matrix with nonnegative entries},
  journal = {Journal of the ACM},
  volume = {51},
  number = {4},
  pages = {671--697},
  year = {2004},
  doi = {10.1145/1008731.1008738}
}

@misc{CVY2026,
  author = {Chen, Xiaoyu and Vigoda, Eric and Yang, Xiongxin},
  title = {Faster {FPRAS} for the Permanent via Restricted {Poincar\'e}
    Inequalities and Coupled Flows},
  year = {2026},
  note = {Preprint, arXiv:2608.26599, August 27, 2026},
  url = {https://arxiv.org/abs/2608.26599}
}

@article{DKM1997,
  author = {Dyer, Martin and Kannan, Ravi and Mount, John},
  title = {Sampling contingency tables},
  journal = {Random Structures \& Algorithms},
  volume = {10},
  number = {4},
  pages = {487--506},
  year = {1997},
  doi = {10.1002/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q}
}

@article{CD2003,
  author = {Cryan, Mary and Dyer, Martin},
  title = {A polynomial-time algorithm to approximately count contingency
    tables when the number of rows is constant},
  journal = {Journal of Computer and System Sciences},
  volume = {67},
  number = {2},
  pages = {291--310},
  year = {2003},
  doi = {10.1016/S0022-0000(03)00014-X}
}

@article{CDR2010,
  author = {Cryan, Mary and Dyer, Martin and Randall, Dana},
  title = {Approximately Counting Integral Flows and Cell-Bounded
    Contingency Tables},
  journal = {SIAM Journal on Computing},
  volume = {39},
  number = {7},
  pages = {2683--2703},
  year = {2010},
  doi = {10.1137/060650544}
}

@article{BBV2007,
  author = {Bez{\'a}kov{\'a}, Ivona and Bhatnagar, Nayantara and Vigoda, Eric},
  title = {Sampling binary contingency tables with a greedy start},
  journal = {Random Structures \& Algorithms},
  volume = {30},
  number = {1--2},
  pages = {168--205},
  year = {2007},
  doi = {10.1002/rsa.20155}
}

@inproceedings{GKM2011,
  author = {Gopalan, Parikshit and Klivans, Adam and Meka, Raghu and
    {\v S}tefankovi{\v c}, Daniel and Vempala, Santosh and Vigoda, Eric},
  title = {An {FPTAS} for {\#Knapsack} and Related Counting Problems},
  booktitle = {Proceedings of the 52nd Annual IEEE Symposium on
    Foundations of Computer Science},
  publisher = {IEEE},
  pages = {817--826},
  year = {2011},
  doi = {10.1109/FOCS.2011.32}
}