• Publications
  • Influence
Counting Small Permutation Patterns
We find twenty-three independent linear combinations of order-4 patterns, that can be counted in nearly linear time. Expand
A Note on the Inducibility of $$4$$4-Vertex Graphs
We construct graphs with a small density of both $$4$$4-cliques and anticliques and construct better graphs for both problems. Expand
Invariants of Random Knots and Links
We study random knots and links in $$\mathbb {R}^3$$R3 using the Petaluma model, which is based on the petal projections developed in [2]. Expand
The Freiman-Ruzsa theorem over finite fields
We extend the Freiman–Ruzsa theorem in Finite Torsion Groups to any prime torsion. Expand
On Sub-critical Sums of Generating Sets in (Z_2)^n (Note)
Ample simplicial complexes
Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the RadoExpand
Universal Knot Diagrams
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications forExpand
On Sums of Generating Sets in ℤ2n
  • Chaim Even-Zohar
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 24 August 2011
We re-prove the Freiman–Ruzsa theorem in ℤ2n, with an optimal upper bound. Expand
Models of random knots
  • Chaim Even-Zohar
  • Mathematics, Computer Science
  • J. Appl. Comput. Topol.
  • 24 November 2017
We present here several known and new randomized models of knots and links. Expand
The Freiman-Ruzsa Theorem in Finite Fields
We establish the Freiman–Ruzsa Theorem in Finite Torsion Groups for any prime torsion. Expand