I am currently a postdoc at the Institute for Advanced Study in Princeton. Before that I was a postdoc of the Special Year on Combinatorics and Complexity at Harvard University (at CMSA). Even before that I was a Ph.D. student at the School of Mathematics at Tel Aviv University. My Ph.D. advisor was Prof. Asaf Shapira. I completed my M.Sc. degree at the School of Computer Science under the supervision of Prof. Oded Regev.

My fields of interest include Extremal Graph and Hypergraph Theory, Ramsey Theory, Extremal Set Theory and applications of Combinatorics to Theoretical Computer Science (e.g., Circuit Complexity).

Email: guymoshkov@gmail.com

**Extremal Combinatorics:**

- Recently, the first proof that the hypergraph regularity lemma
cannot have a primitive recursive bound (thus resolving an important
open problem in this area and confirming a prediction of Tao [JCTA
2006]).
- A simple and short proof of the celebrated lower bound for the graph
regularity lemma due to Gowers [GAFA 1997].
- The resolution of open problems on the Erdos-Szekeres
Lemma raised by Fox–Pach–Sudakov–Suk [Proc. London Math. Soc. 2012]
and Eliáš-Matoušek [Adv. Math. 2013].

- Tight lower bounds for multiple results on expanding subgraphs,
matching upper bounds by Arora-Barak-Steurer [J. ACM 2015],
Lipton-Rose-Tarjan [SIAM J. Numer. Anal. 1979] and more.
- A graph-theoretic approach to arithmetic circuit lower bounds, via the polynomial method.

Traces of Hypergraphs (with N. Alon and N. Solomon), submitted.

A Tight Bound for Hypergraph Regularity I (with A. Shapira), submitted.

A Tight Bound for Hypergraph Regularity II (with A. Shapira), submitted.

A Sparse Regular Approximation Lemma (with A. Shapira), Transactions of the American Mathematical Society, to appear.

Constructing Near Spanning Trees with Few Local Inspections (with R. Levi, D. Ron, R. Rubinfeld and A. Shapira), Random Structures and Algorithms 50 (2017), 183-200.

Decomposing a Graph Into Expanding Subgraphs (with A. Shapira), Random Structures and Algorithms 52 (2018), 158-178.

An Improved Lower Bound for Arithmetic Regularity (with K. Hosseini, S. Lovett and A. Shapira), Mathematical Proceedings of the Cambridge Philosophical Society 161 (2016), 193-197.

A Short Proof of Gowers' Lower Bound for the Regularity Lemma (with A. Shapira), Combinatorica, 36 (2016), 187-194.

Exact Bounds for Some Hypergraph Saturation Problems (with A. Shapira), Journal of Combinatorial Theory Series B 111 (2015), 242-248.

A full version of this paper: (arXiv)Ramsey Theory, Integer Partitions and a New Proof of the Erdos-Szekeres Theorem (with A. Shapira), Advances in Mathematics 262 (2014), 1107-1129.

Complexity Lower Bounds through Balanced Graph Properties, Proc. of the 27th Annual IEEE Conference on Computational Complexity (2012), 159-169.

Introduction to Discrete Mathematics (2016)

Calculus B2 (2014, 2015, 2016)

Linear Algebra A1 (2013, 2014, 2015)

Differential and Integral Calculus (2012, 2013)

Linear Algebra (2012)