2022-2023 Papers

This page contains some papers produced during the academic year of 2022-2023.

  • Bucić, M., Glock, S., & Sudakov, B. (2022). The intersection spectrum of 3‐chromatic intersecting hypergraphs. Proceedings of the London Mathematical Society, 124(5), 680-690.
  • Bucić, M., Cooper, J., Kráľ, D., Mohr, S., & Munhá Correia, D. (2023). Uniform Turán density of cycles. Transactions of the American Mathematical Society.
  • Bucić, M., Janzer, O., & Sudakov, B. (2023). Counting H-free orientations of graphs. In Mathematical Proceedings of the Cambridge Philosophical Society (Vol. 174, No. 1, pp. 79-95). Cambridge University Press.
  • Bucić, M., Gishboliner, L., & Sudakov, B. (2022). Cycles of many lengths in Hamiltonian graphs. In Forum of Mathematics, Sigma (Vol. 10, p. e70). Cambridge University Press.
  • Bucić, M., & Sudakov, B. (2023). Large independent sets from local considerations. Combinatorica, 1-42.
  • Coregliano, L. N., Jeronimo, F. G., & Jones, C. (2022). Exact Completeness of LP Hierarchies for Linear Codes. arXiv preprint arXiv:2211.01248.
  • Coregliano, L. N., & Malliaris, M. (2022). Countable Ramsey. arXiv preprint arXiv:2203.10396.
  • Coregliano, L. N., & Razborov, A. A. (2023). Natural quasirandomness properties. Random Structures & Algorithms.
  • Coregliano, L. N., & Malliaris, M. (2022). Weak randomness in graphons and theons. arXiv preprint arXiv:2209.08638.
  • Jeronimo, F. G., Mittal, T., Roy, S., & Wigderson, A. (2022). Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 378-388). IEEE.
  • Jeronimo, F. G., Srivastava, S., Tulsiani, M. (2023). List Decoding of Tanner and Expander Amplified Codes from Distance Certificates. Manuscript.
  • Jeronimo, F. G., & Wu, P. (2023). A Non-Negative Amplitudes Characterization of qma(2) and a Quest for the Complexity of Entanglement. Manuscript.
  • Jeronimo, F. G., & Wu, P. (2023). The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1629-1642).
  • Raz, O. E., Lew, A., Nevo, E., Peled, Y. (2023). Rigidity expander graphs. arXiv preprint arXiv:2304.01306.
  • Tell, R., Chen, L., & Rothblum, R. D. (2022). Unstructured hardness to average-case randomness. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 429-437). IEEE.
  • Tell, R., & Chen, L. (2023). When Arthur has neither random coins nor time to spare: Superfast derandomization of proof systems. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 60-69).
  • Tell, R., Chen, L., Rothblum, R. D., & Yogev, E. (2023). On exponential-time hypotheses, derandomization, and circuit lower bounds. Journal of the ACM, 70(4), 1-62.
  • Pitassi, T., Bun, M., Gaboardi, M., Hopkins, M., Impagliazzo, R., Lei, R., .... & Sorrell, J. (2023). Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 520-527).
  • Pitassi, T., Impagliazzo, R., Lei, R., & Sorrell, J. (2022). Reproducibility in learning. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 818-831).
  • Eldan, R., Wigderson, A., & Wu, P. (2023). An Optimal “It Ain’t Over Till It’s Over” Theorem. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 853-866).
  • Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., & Zhang, C. (2022). On linear-algebraic notions of expansion. arXiv preprint arXiv:2212.13154.
  • Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., & Zhang, C. (2022). Connections between graphs and matrix spaces. arXiv preprint arXiv:2206.04815.