activity
20112025
most citedA Note on the Inducibility of 4-vertex Graphs

38 citations · 191 across the 25 of their papers we have counts for

collaborators

25 papers

math.CO2025

Plabic Tangles and Cluster Promotion Maps

Chaim Even-Zohar, Matteo Parisi, Melissa Sherman-Bennett +2

Inspired by the BCFW recurrence for tilings of the amplituhedron, we introduce the general framework of `plabic tangles' that utilizes plabic graphs to define rational maps between…

math.CO2025★ 3 cited

BCFW tilings and cluster adjacency for the amplituhedron

Chaim Even-Zohar, Tsviqa Lakrec, Matteo Parisi +3

In 2005, Britto, Cachazo, Feng and Witten gave a recurrence (now known as the BCFW recurrence) for computing scattering amplitudes in N=4 super Yang Mills theory. Arkani-Hamed and…

math.CO2024★ 7 cited

A cluster of results on amplituhedron tiles

Chaim Even-Zohar, Tsviqa Lakrec, Matteo Parisi +3

The amplituhedron is a mathematical object which was introduced to provide a geometric origin of scattering amplitudes in super Yang Mills theory. It generalizes \e…

math.CO2023★ 1 cited

Cluster algebras and tilings for the m=4 amplituhedron

Chaim Even-Zohar, Tsviqa Lakrec, Matteo Parisi +3

The amplituhedron is the image of the positive Grassmannian under the map induced by a positive linear ma…

math.GT2022

Random Colorings in Manifolds

Chaim Even-Zohar, Joel Hass

We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated…

math-ph2021★ 4 cited

The Amplituhedron BCFW Triangulation

Chaim Even-Zohar, Tsviqa Lakrec, Ran J. Tessler

The amplituhedron Ank4 is a geometric object, introduced by Arkani-Hamed and Trnka (2013) in the study of scattering amplitudes in quantum field theories. They conjecture that Ank4…

math.GT2021★ 1 cited

Virtual Multicrossings and Petal Diagrams for Virtual Knots and Links

Colin Adams, Chaim Even-Zohar, Jonah Greenberg +6

Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all…

math.AT2020★ 3 cited

Ample simplicial complexes

Chaim Even-Zohar, Michael Farber, Lewis Mead

Motivated by potential applications in network theory, engineering and computer science, we study -ample simplicial complexes. These complexes can be viewed as finite approximat…

math.PR2020★ 2 cited

Spectral Analysis of Word Statistics

Chaim Even-Zohar, Tsviqa Lakrec, Ran J. Tessler

Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word count…

stat.CO2020★ 2 cited

independence: Fast Rank Tests

Chaim Even-Zohar

In 1948 Hoeffding devised a nonparametric test that detects dependence between two continuous random variables X and Y, based on the ranking of n paired samples (Xi,Yi). The comput…

math.CO2020★ 4 cited

Sizes of Simultaneous Core Partitions

Chaim Even-Zohar

There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove th…

math.CO2020★ 3 cited

Random Surfaces with Boundary

Chaim Even-Zohar, Michael Farber

A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivaria…

cs.DS2019★ 13 cited

Counting Small Permutation Patterns

Chaim Even-Zohar, Calvin Leng

A sample of n generic points in the xy-plane defines a permutation that relates their ranks along the two axes. Every subset of k points similarly defines a pattern, which occurs i…

math.CO2018★ 4 cited

Patterns in Random Permutations

Chaim Even-Zohar

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The…

math.GT2018★ 13 cited

Universal Knot Diagrams

Chaim Even-Zohar, Joel Hass, Nati Linial +1

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 implic…

math.GT2017★ 13 cited

Models of Random Knots

Chaim Even-Zohar

The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topolo…

math.GT2017★ 14 cited

The Distribution of Knots in the Petaluma Model

Chaim Even-Zohar, Joel Hass, Nati Linial +1

The representation of knots by petal diagrams (Adams et al. 2012) naturally defines a sequence of distributions on the set of knots. In this article we establish some basic propert…

math.GT2016★ 3 cited

Crossing Numbers of Random Two-Bridge Knots

Moshe Cohen, Chaim Even-Zohar, Sunder Ram Krishnan

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distrib…

math.CO2015★ 3 cited

The Writhe of Permutations and Random Framed Knots

Chaim Even-Zohar

We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lea…

math.GT2014★ 33 cited

Invariants of Random Knots and Links

Chaim Even-Zohar, Joel Hass, Nati Linial +1

We study random knots and links in R^3 using the Petaluma model, which is based on the petal projections developed by Adams et al. (2012). In this model we obtain a formula for the…

math.CO2013★ 38 cited

A Note on the Inducibility of 4-vertex Graphs

Chaim Even-Zohar, Nati Linial

There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extrem…

math.CO2013★ 5 cited

Triply Existentially Complete Triangle-Free Graphs

Chaim Even-Zohar, Nati Linial

A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized…

math.CO2012★ 8 cited

The Freiman--Ruzsa Theorem over Finite Fields

Chaim Even-Zohar, Shachar Lovett

Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman--Ruzsa theorem asserts that if |A+A| < K|A| then A is contained in a coset of a subgroup of G o…

math.CO2011

Small asymmetric sumsets in elementary abelian 2-groups

Chaim Even-Zohar, Vsevolod F. Lev

Let A and B be subsets of an elementary abelian 2-group G, none of which are contained in a coset of a proper subgroup. Extending onto potentially distinct summands a result of Hen…