Title | Summary | Download |

“Maximum pebbling number of graphs of diameter three” | Pebbling number of a graph of diameter 3 on n vertices is no more than 3n/2+O(1), and the bound is sharp.Appeared in J. of Graph Theory, vol. 52(4), pp. 353–357, 2006.
| pdf ps |

“A point in many triangles” | For every finite set of points in the plane we can find a point which lies in 2/9 of all the triangles formed by the points of this set.Appeared in Electronic J. of Combinatorics, vol. 13, N10, 2006.
| pdf ps html |

“Induced subgraphs of Ramsey graphs with many distinct degrees” (with Benny Sudakov) | A graph with no clique or independent set of size Clog n contains an induced subgraph in which β(√C)n vertices have different degrees.Appeared in J. Combinatorial Theory Ser. B, vol. 97, pp. 612–619, 2007.
| pdf ps |

“Measurable sets with excluded distances” | The density of any set in the plane in which the distances d,...,_{1}d do not occur is exponentially small in _{k}k provided the ratios d/_{2}d,...,_{1}d/_{k}d tend to infinity._{k-1}Appeared in Geom. and Funct. Analysis, vol. 18(3), pp. 668–697, 2008.
| pdf talk |

“Non-trivial solutions to a linear equation in integers” | For k≥3 every set A⊆[1,N] not containing a solution to a+⋯+_{1}x_{1}a=_{k}x_{k}a_{1}x_{k+1}+⋯+a in distinct integers has _{k}x_{2k}O(N^{1/2−ε}) elements for some ε>0 depending on the coefficients of the equation.Appeared in Acta Arithmetica, vol. 131(1), pp. 51–55, 2008.
| pdf ps |

“Discrete Kakeya-type problems and small bases” (with Noga Alon and Benny Sudakov) | For many groups G there are constructions of small subsets of G that contain a translate of every k-element set. The constructions are used to exhibit efficient additive bases for subsets of integers.Appeared in Israel Journal of Mathematics, vol. 174, pp. 285–301, 2009.
| pdf ps |

“Sums of dilates” | For any finite set of integers A the sumset A+100⋅A has at least 101|A|−o(|A|) elements, where 100⋅A={100 a : a∈A} is the 100-dilate of A. The bound is sharp. If |A+A|≤K|A|, then |A+100⋅A|≤K|^{22}A|. Plünnecke's inequality yields only |A+100⋅A|≤K|^{101}A|.Appeared in Combin. Probab. Comput., vol. 17, pp. 627–639, 2008.
| pdf ps talk |

“Set families with a forbidden subposet” | The asymptotically largest subset of the Boolean lattice not containing a given subposet is a union of several middle levels of the Boolean lattice. While likely being true in general, this is proved only if the Hasse diagram of the forbidden subposet is a tree. Appeared in Electronic J. of Combinatorics, vol. 16, R142, 2009.
| pdf ps talk |

“Stabbing simplices by points and flats” (with Jiří Matoušek and Gabriel Nivasch) | There is an n-point set S in R^{d} such that no p in R^{d} is contained in more than (n/(d+1))^{d+1} simplices spanned by S. In the opposite direction, for every S there is a (d−2)-dimensional affine subspace of R^{d} that intersects many triangles spanned by S.Appeared in Discrete Comput. Geom., vol. 43, pp. 321–338, 2010.
| pdf ps talk |

“Lower bounds for weak epsilon-nets and stair-convexity” (with Jiří Matoušek and Gabriel Nivasch) | There are sets S in R^{d} which admit no weak (1/r)-net of size less than c _{d}r log^{d−1}r, where a set N is a weak ε-net for S if N meets every convex set C with |C∩S|≥ε|S|.Appeared in Israel Journal of Mathematics, vol. 182, pp. 199–228, 2011.
Preliminary version appeared in SoCG'09. | pdf talk |

“Sum-product estimates for rational functions” (with Jacob Tsimerman) | For a set A⊆F_{p} and a polynomial f(x,y), the image f(A,A) is a much larger set than A unless f encodes a group operation. While surely true for arbitrary f and A, this is proved only if f is monic and A is large. For every f and A the estimate |f(A)+f(A)|+|AA|≥|A|^{1+ε} is also proved.Appeared in Proc. of the London Math. Soc., vol. 104(1), pp. 1–26, 2012.
| pdf ps extra talk |

“Multidimensional Kruskal–Katona theorem” | A shadow of a d‑tuple of sets consists of all the d‑tuples of sets that are obtained by removing an element from each set in the tuple. We give an essentially sharp lower bound on the size of such shadows.Appeared in SIAM J. Discrete Math., vol. 26(2), pp. 548–554, 2012.
| pdf ps errata |

“Radon partitions in convexity spaces” | Tverberg's theorem asserts that any (k−1)(d+1)+1 points in R^{d} can be partitioned into k parts whose convex hulls meet. We show that the case k=2 does not combinatorially imply the full Tverberg's theorem. However, it does combinatorially imply a weakening of Tverberg's theorem.Accepted to Discrete Comput. Geom.
| pdf ps faq |

“Space crossing numbers” (with Alfredo Hubard) | The crossing lemma says that in every drawing of a graph with n vertices and m≥4n edges in the plane there are at least cm crossings. We define a notion of crossing for a drawing of a graph in ^{3}/n^{2}R^{3}, and show a lower bound for the number of such crossing that almost implies the crossing lemma.Appeared in Combin. Probab. Comput., vol. 21(3), pp. 358–373, 2012.
Preliminary version appeared in SoCG'11. | pdf ps talk |

“Upper bounds for centerlines” (with Gabriel Nivasch) | For every n-point set S in R^{3} there is a line l such that every halfspace containing l contains at least 2n/5 points of S, and the fraction 2/5 is sharp.Appeared in J. Comput. Geom., vol. 3(1), 2012.
| pdf |

“Turán numbers for K-free graphs: topological obstructions and algebraic constructions”_{s,t}(with Pavle Blagojević and Roman Karasev) | For no s≥4 there is a construction of an extremal K-free graphs that comes from a hypersurface in _{s,s}R^{s}×R^{s} (but there is for s=2,3). There are constructions of hypersurfaces in C^{s}×C^{s} that give rise to extremal constructions for the Zarankiewicz problem when t≥s.^{4s}Appeared in Israel Journal of Mathematics, vol. 197(1), pp. 199–214, 2013.
| pdf ps talk |

“Erdős–Szekeres-type statements: Ramsey function and decidability in dimension 1” (with Jiří Matoušek) | Consider the generalization of Erdős–Szekeres theorem to any properties expressed by polynomial equations and inequalities, in any number of variables. In dimension 1, there is an algorithm that automatically decides a validity of such a theorem. The associated Ramsey function is at most doubly-exponential; in contrast, Ramsey's theorem yields a tower of exponents growing with the arity. Appeared in Duke Math. Journal, vol. 163(12), pp. 2243–2270, 2014.
| pdf extra |

“Suborbits in Knaster's problem” (with Roman Karasev) | Bronisław Knaster asked to generalize the Borsuk–Ulam theorem from pairs to tuples of points. A natural approach is to embed the tuple into an orbit of a group action, and use Borsuk–Ulam-type result for the group. The approach succeeds in resolving Knaster's problem for non-equatorial triangles, but is proven to fail in general. An approximate version of Knaster's problem, which is motivated by Dvoretzky's theorem, is shown to require non-commutative groups. Appeared in Bulletin of the London Math. Soc., vol. 46(2), pp. 269–278, 2014.
| pdf ps |

“An improvement of the Beck–Fiala theorem” | Beck and Fiala proved a bound on the discrepancy of a set system that depends only on the degree. We improve their bound by a tiny function going to infinity. Appeared in Combin. Probab. Comput., vol. 25(3), pp. 380–398, 2016.
| pdf ps |

“Twins in words and long common subsequences in permutations” (with Lidong Zhou) | Every long sequence of symbols from a fixed alphabet contains two long identical disjoint subsequences ('twins'). Every large set of permutations contains two permutations having a long common subsequence. The problems of twins and permutations are quantitatively related. The relation is used to prove that every n-letter word over a k-letter alphabet contains twins of length Ω(k^{−2/3}n).Appeared in Israel Journal of Mathematics, vol. 213, pp. 183–209, 2016.
| pdf ps code talk |

“A bound on the number of edges in graphs without an even cycle” (with Zilin Jiang) | An easy upper bound on the number of edges in a graph without any cycles of length up to 2k is n^{1+1/k}. If cycles of length only 2k are forbidden, the known upper bounds are of the form γ_{k}n^{1+1/k}+O(n). We show that γ is at most _{k}80√k·log k, an improvement over the previous bound of k−1. However, the correct order of magnitude for both problems is likely o(n^{1+1/k}) for large k.Appeared in Combin. Probab. Comput., vol. 26(1), pp. 1–15, 2017 (+ erratum on arXiv).
| pdf ps |

“Longest common subsequences in sets of words” (with Jie Ma) | Among any t binary words of length n over there are two that share a subsequence of length n/2+cn^{1−1/(t−4)} for some c>0. This is sharp, up to value of c. We do not know if c must depend on t.Appeared in SIAM J. Discrete Math., vol. 28(4), pp. 2042–2049, 2014.
| pdf ps talk |

“Random algebraic construction of extremal graphs” | This article explains why algebraic constructions of K-free graphs are better than random constructions. In particular, a simple construction of extremal _{s,t}K-free graphs for _{s,t}t≫s is given.Appeared in Bulletin of the London Math. Soc., vol. 47(6), pp. 939–945, 2015.
| pdf ps |

“Rational exponents in extremal graph theory” (with David Conlon) | For every rational number r between 1 and 2 there is a graph family whose Turán number is asymptotic to Θ(n).^{r}Appeared in J. of European Math. Society, vol. 20(7), pp. 1747–1757, 2018.
| pdf ps |

“An improved bound on the fraction of correctable deletions” (with Venkatesan Guruswami and Johan Håstad) | There exist exponentially many binary words of length n such that no two have a common subsequence of length (2−√2+ε)n. Furthermore, there exists an efficient algorithm to recover the word from a subsequence of this length. It is open if 2−√2 can be replaced by 1/2.Appeared in IEEE Trans. Inform. Theory, vol. 63(1), pp. 93–103, 2017.
Preliminary version appeared in SODA'16. | pdf ps |

“Ranks of matrices with few distinct entries” | Consider the n-by-n matrices whose off-diagonal entries all belong to the set L, and whose diagonal entries are all equal. How small can a rank of such a matrix be? This paper characterizes the sets L for which rank is always linear. As a by-product, it is shown how to construct graphs of size n whose adjacency matrices have eigenvalue √2015 with multiplicity n/2−O(√n). The bound is sharp.Appeared in Israel Journal of Mathematics, vol. 222(1), pp. 165–200, 2017.
| pdf ps code talk video |

“Bounds on equiangular lines and on related spherical codes” | Every set of lines in R^{d} whose pairwise angles are all equal to some fixed α has at most c lines._{α} dAppeared in SIAM J. Discrete Math., vol. 30(1), pp. 549–554, 2016.
| pdf ps |

“Bipartite algebraic graphs without quadrilaterals” (with Zilin Jiang) | We conjecture that every algebraic hypersurface that gives rise to a K-free graph is equivalent, in a suitable sense, to a low-degree hypersurface. We establish a version of this conjecture for _{s,t}K-free graphs._{2,2}Appeared in Discrete Math., vol. 341(6), pp. 1597–1604, 2018.
| pdf ps |

“One-sided epsilon-approximants” (with Gabriel Nivasch) | Suppose A and P are sets in R^{d} such that every convex set containing α-fraction of points P contains at least (α−ε)-fraction of points of A, for every α. In such a case, set A is called a one-sided ε-approximant to P. We show that every P admits a one-sided ε-approximant of size depending only on ε and on d.Appeared in A Journey through Discrete Mathematics. A Tribute to Jiří Matoušek., pp. 343–356, 2017.
| pdf ps talk |

“Classifying unavoidable Tverberg partitions” (with Gabriel Nivasch and Po-Shen Loh) | Every set of (r−1)(d+1)+1 points in R^{d} admits an r-Tverberg partition, which is a partition into r parts whose convex hulls intersect. In a large set of points, which combinatorial types of r-Tverberg partitions unavoidably occur? We provide partial answers in dimensions up to 4.Appeared in J. Comput. Geom., vol. 8(1), 2017.
| pdf |

“Shatter functions with polynomial growth rates” (with Xavier Goaoc) | Let f be a shatter function of a set system. Sauer–Shelah lemma says that if f(k+1)<2^{k+1}, then f(n)=O(n). For integer ^{k}k, we show that if f(m)≤ (2^{k+1}−k−1)m+C, then _{k}f(n)=O(n), and that this is sharp apart from the value of ^{k}C._{k}Appeared in SIAM J. Discrete Math., vol. 33(2), pp. 784–794, 2019.
| pdf |

“On a topological version of Pach's overlap theorem” (with Alfredo Hubard) | Let φ be a continuous map from an n-vertex simplex to R^{2}. Then there are sets X,Y,Z, of size 10^{−14}(log n) each, and a point p∈R^{2} such that the φ-image of every triangle of the form xyz contains p. This is false with 50 in place of 10^{−14}.Appeared in Bulletin of the London Math. Soc., vol. 52(2), pp. 275–282, 2019.
| pdf ps |

“List-decodable zero‑rate codes” (with Noga Alon and Yury Polyanskiy) | Code C⊆{0,1}^{n} is <L-list-decodable with (relative) radius τ if every Hamming ball of radius τn covers fewer than L codewords. We show that the size of the largest <2-list-decodable code with radius ¼+ε is of the order ε^{−3/2}. We also solve the analogous problem with 2 replaced by any odd number, but all the other cases remain a mystery.Appeared in IEEE Trans. Inform. Theory, vol. 65(3), 2019.
| pdf ps code |

“On a fractional version of Haemers' bound” (with Chris Cox) | It is unknown if there is an algorithm to approximate the Shannon capacity of, say, C. The obstacle is that only two upper bounds on Shannon capacity are known: Lovász theta function and Haemers' bound. We rediscover a version of Haemers' bound which is originally due to Blasiak. We show that it is strictly stronger than Haemers' bound, and that it is multiplicative, like the Lovász theta function._{7}Appeared in IEEE Trans. Inform. Theory, vol. 65(6), 2019.
| pdf ps |

“Length of the longest common subsequence between overlapping words” (with Raymond Hogenson) | Suppose U and V are two random words over k-letter alphabet of length n that overlap in a subword of length ℓ. How long is the longest common subsequence between U and V? If ℓ=0, then this is well-studied problem, whose answer is approximately γ⋅_{k}n. For general ℓ, we show that the longest common subsequence has length approximately max(γ⋅_{k}n,ℓ).Appeared in SIAM J. Discrete Math., vol. 34(1), 2020.
| pdf ps |

“Nearly orthogonal vectors and small antipodal spherical codes” (with Chris Cox) | How to arrange d+k vectors in R^{d} so that they are as close to orthogonal as possible? We answer this question when k=1,2,3,7 or 23. This is a consequence of a sharp upper bound on the first moment of isotropic measures, and the existence of large families of equiangular lines in R^{k} for these values of k.Appeared in Israel Journal of Mathematics, vol. 238(1), pp. 359–388, 2020.
| pdf ps talk |

“Consistent sets of lines with no colorful incidence” (with Xavier Goaoc, Alfredo Hubard and Matthew Trager) | Call a collection of photographs `consistent' if there is a same scene that these are photographs of (from different points of view). For the case when the `scene' is just a set of points, we construct a collection of 101 photographs such that every 100 of them are consistent, but all of them together are inconsistent.Preliminary version appeared in SoCG'18. | pdf |

“Turán numbers of theta graphs” (with Michael Tait) | The theta graph consists of two vertices joined by t vertex-disjoint path of same length ℓ. For fixed ℓ and large t a theta-free graph on n vertices has at most c⋅_{ℓ}t^{1−1/ℓ}n^{1+1/ℓ} edges, and for odd ℓ this is tight apart from the value of c. The case of even _{ℓ}ℓ remains open.Appeared in Combin. Probab. Comput., vol. 29(4), pp. 495–507, 2020.
| pdf ps talk |

“Linear orderings of combinatorial cubes” (with Anish Sevekari) | We show that every linear ordering of [2]^{n} contains a large combinatorial subcube on which the ordering is lexicographic. In the analogous statement for [k]^{n} with k≥3, the lexicographic ordering is not the only possible outcome; asymptotically, there are slightly more than k! many orderings that are stable under passing to a subcube.The main result of the paper appeared in “Canonizing ordering theorems for Hales-Jewett structures” by Nešetřil, Prömel, Rödl, Voigt. | pdf ps |

“Periodic words, common subsequences and frogs” (with Chris Cox) | How long is the longest common subsequence (LCS) between two random words? We give evidence that it is of length γ⋅n−cn^{⅓}+o(n^{⅓}). We completely solve the analogous problem for the LCS between a random word and a periodic word. Mysteriously, the special case of the word 123…123… leads to a Markov chain on Dyck paths.Appeared in Ann. Appl. Probab., vol. 32(2), pp. 1295–1332, 2022.
| pdf code |

“Order-isomorphic twins in permutations” (with Oleksandr Rudenko) | Every permutation of 1,…,n contains two disjoint order-isomorphic subsequences of length Ω(n^{3/5}). It likely that this holds with 2/3 in place of 3/5, but we were able to show this only for random permutations.Appeared in SIAM J. Discrete Math., vol. 34(3), 2020.
| pdf ps |

“On convex holes in d‑dimensional point sets”(with Ting-Wei Chao and Ron Holzman) | There are arbitrarily large sets in R^{d} that do not contain vertices of an empty convex polyhedron with 4^{d+o(d)} vertices. The lower bound remains linear in d.Appeared in Combin. Probab. Comput., vol. 31(1), 2022.
| pdf ps |

“Longest common subsequences between words of very unequal length” (with Zichao Dong) | Consider random words over k-symbol alphabet. We show that the expected length of a word of length n and a word of length (1−ε)kn is of the order 1−cε. For large ^{2}k, the constant c should tend to 1/4, but we prove only that c≥1/4−o(1). In addition, we present a convenient formalism for constructing couplings of Markov chains. | pdf ps |

“Empty axis-parallel boxes” (with Ting-Wei Chao) | Given any n points in [0,1]^{d}, there is an empty axis-parallel box of volume Ω(d/n). On the other hand, there exist sets for which the largest such box has volume only O(d^{2}log d/n).Appeared in International Math. Research Notices, pp. 13811–13828, 2022.
| pdf ps |

“Digital almost nets” (with Ting-Wei Chao) | An almost net is a set of 2 points in [^{n}m0,1]^{d} intersecting every dyadic box of volume 2^{−n} in approximately m points. There exist almost nets with m=O(d log d), improving the exponential bound from the usual nets. The lower bound on m is logarithmic. | pdf ps |

“Extremal graphs without exponentially-small bicliques” | There are extremal K_{s,t}-free graphs with t≈9. This improves on the factorial-type bounds on ^{s}t. A curious ingredient of the construction is a bound on the number of non-trivial representations of zero as a power sum of linear forms. | pdf talk survey |

“Sharp density bounds on the finite field Kakeya problem” (with Ting-Wei Chao) | Every Kakeya set in F has at least _{q}^{n}2^{−n+1}q elements. This is sharp up to ^{n}O(q^{n−1}) terms.Appeared in Discrete Anal., 2021:26.
| pdf ps talk |

“Applications of random algebraic constructions to hardness of approximation” (with Bhargav Narayanan and Karthik C.S.) | Given disjoint sets A,...,_{1}A and _{k}B of equal size, one can make a bipartite graph with parts A=∪A and _{i}B such that the common neighborhood of a k-set in A is large only if the k vertices belong to the distinct sets among A,...,_{1}A. This is used to show computational hardness results for several problems._{k}Accepted to Israel Journal of Mathematics
Preliminary version appeared in FOCS'21. | pdf |

“Enumeration of interval graphs and d‑representable complexes”(with Amzi Jeffs) | We show that there are exp(c⋅_{d}n ^{d}log n) ways to arrange n convex sets in R, and that this is sharp up to the value of the constant ^{d}c._{d} | pdf ps |

“Convex polytopes in restricted point sets in R^{d}”(with Zichao Dong) | There are non-elongated n-element sets in R^{d} that contain no subset of size O(n^{1−2/(d+1)}) in convex position, and this is sharp. Here, ‘non-elongated’ means that the largest distance between the points is at most O(n^{1/d}) times larger than the smallest. | pdf ps |

“Planar convex codes are decidable” (with Amzi Jeffs) | Given an abstract Venn diagram, can it be realized by convex sets in R^{d}? We show that this problem is decidable for d=2, and explain why it is likely harder in higher dimensions.Accepted to SIAM J. Discrete Math.
| pdf ps |

If you find any paper above hard to read, write to me, as that means the paper is poorly written, not that the result is hard.