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
Showing math.COShow all

13 papers · 1 filter

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

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

math.CO2011★ 14 cited

On Sums of Generating Sets in (Z_2)^n

Chaim Even-Zohar

Let A and B be two affinely generating sets of (Z_2)^n. As usual, we denote their Minkowski sum by A+B. How small can A+B be, given the cardinalities of A and B? We give a tight an…