Guy Moshkovitz

Education

Ph.D., Mathematics, Tel Aviv University Tel Aviv

MSc, Computer Science, Tel Aviv University Tel Aviv

BSc, Mathematics & Computer Science, Tel Aviv University Tel Aviv

Journal Articles

Moshkovitz, G., & Zhu, D. (2024). Uniform stability of ranks.

Moshkovitz, G., & Zhu, D. (2024). Quasi-Linear relation between partition and analytic rank. Inventiones mathematicae,

Moshkovitz, G., Kopparty, S., & Zuiddam, J. (2023). Geometric rank of tensors and subrank of matrix multiplication. Discrete Analysis, 2023: 1.

Moshkovitz, G., & Yu, J. (2023). Sharp effective finite-field Nullstellensatz. American Mathematical Monthly, 130(8). 720-727.

Moshkovitz, G., & Cohen, A. (2023). Partition and analytic rank are equivalent over large fields. Duke Mathematical Journal, 172. 2433-2470.

Moshkovitz, G., & Cohen, A. (2022). Structure vs. randomness for bilinear maps. Discrete Analysis, 2022: 12.

Moshkovitz, G., & Alon, N. (2021). Limitations on regularity lemmas for clustering graphs. Advances in Applied Mathematics, 124.

Moshkovitz, G., & Solomon, N. (2019). Traces of hypergraphs. Journal of the London Mathematical Society, 100. 498-517.

Moshkovitz, G., & Shapira, A. (2019). A tight bound for hypergraph regularity. Geometric and Functional Analysis, 29. 1531-1578.

Moshkovitz, G. (2019). A sparse regular approximation lemma. Transactions of the American Mathematical Society, 371. 6779-6814.

Moshkovitz, G., & Shapira, A. (2018). Decomposing a graph into expanding subgraphs. Random Structures and Algorithms, 52. 158-178.

Moshkovitz, G., Levi, R., Ron, D., Rubinfeld, R., & Shapira, A. (2017). Constructing near spanning trees with few local inspections. Random Structures and Algorithms, 50. 183-200.

Moshkovitz, G., Hosseini, K., Lovett, S., & Shapira, A. (2016). An improved lower bound for arithmetic regularity. Mathematical Proceedings of the Cambridge Philosophical Society, 161. 193-197.

Moshkovitz, G., & Shapira, A. (2016). A short proof of Gowers' lower bound for the regularity lemma. Combinatorica, 36. 187-194.

Moshkovitz, G., & Shapira, A. (2015). Exact bounds for some hypergraph saturation problems. Journal of Combinatorial Theory Series B, 111. 242-248.

Moshkovitz, G., & Shapira, A. (2014). Ramsey theory, integer partitions and a new proof of the Erdos-Szekeres Theorem. Advances in Mathematics, 262. 1107-1129.

Conference Proceedings

Moshkovitz, G., & Woodruff, D. (2025). A weak regularity lemma for polynomials.

Moshkovitz, G., & Lampert, A. (2025). Slice rank and partition rank of the determinant.

Moshkovitz, G., & Cohen, A. (2021). Structure vs. randomness for bilinear maps. Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC 2021).

Moshkovitz, G., Kopparty, S., & Zuiddam, J. (2020). Geometric rank of tensors and subrank of matrix multiplication. Proceedings of the 35th Computational Complexity Conference (CCC 2020).

Moshkovitz, G., & Shapira, A. (2015). Decomposing a Graph Into Expanding Subgraphs. Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015).

Moshkovitz, G. (2012). Complexity lower bounds through balanced graph properties. Proceedings of the 27th Computational Complexity Conference (CCC 2012).

Presentations

Moshkovitz, G. (2025, January 1). Structure and randomness for finite-field polynomials are (almost) equivalent. IAS Computer Science/Discrete Mathematics Seminar. IAS, Princeton

Moshkovitz, G. (2025, May 5). Ranks and graphs. Rutgers Discrete Math Seminar. Rutgers

Moshkovitz, G. (2024, February 1). Recent progress in the study of tensor ranks. Computer Science Colloquium, Queens College CUNY.

Moshkovitz, G. (2024, April 1). Recent progress in the study of tensor ranks. NYU Computer Science Theory seminar.

Moshkovitz, G. (2023, November 1). Recent progress in the study of tensor ranks. Graduate Student Colloquium, CUNY Graduate Center.

Moshkovitz, G. (2023, April 1). Quasi-linear relation between structure and randomness. Rutgers/DIMACS Theory of Computing Seminar.

Moshkovitz, G. Ranks of Tensors. IAS Workshop on Additive Combinatorics and Algebraic Connections. Institute for Advanced Study, Princeton

Moshkovitz, G. (2021, December 31). An Optimal Inverse Theorem. WAC (Webinar in Additive Combinatorics).

Moshkovitz, G. An Optimal Inverse Theorem. Theory Seminar, UCSD.

Moshkovitz, G. An Optimal Inverse Theorem. Seminar in Random Tensors, Texas A&M.

Moshkovitz, G. An Optimal Inverse Theorem. Algebraic Geometry Seminar, Columbia University.

Moshkovitz, G. Maximizing Projections. New York Combinatorics Seminar.

Moshkovitz, G. New Results on Projections. Computer Science/Discrete Mathematics Seminar II, Institute for Advanced Study.

Moshkovitz, G. A Regularity Lemma with Modifications. Computer Science/Discrete Mathematics Seminar II, Institute for Advanced Study.

Moshkovitz, G. New results on projections. Discrete Mathematics Seminar, Princeton University.

Moshkovitz, G. A Tight Bound for Hypergraph Regularity. AMS-MAA Joint Mathematics Meetings Conference, Baltimore.

Moshkovitz, G. New Results on Projections. Atlanta Lecture Series in Combinatorics and Graph Theory, Emory University.

Moshkovitz, G. A Tight Bound for Hypergraph Regularity. Computer Science/Discrete Mathematics Seminar I, Institute for Advanced Study.

Moshkovitz, G. Tight bounds for Regularity Lemmas. MIT-Harvard-MSR Combinatorics Seminar ("Richard P. Stanley Seminar in Combinatorics").

Moshkovitz, G. Teaching Assistant. LMS-CMI Research School on Regularity and Analytic Methods in Combinatorics, Warwick.

Moshkovitz, G. A Short Proof of Gowers' Lower Bound for the Regularity Lemma. SIAM Conference on Discrete Mathematics, Minneapolis.

Research Currently in Progess

Moshkovitz, G., & Haiman, M.(n.d.). A framework for counting monotone functions. In Progress.

Moshkovitz, G., & Gozon, M.(n.d.). On approximability of tensor ranks. In Progress.