Add to ORKGAbstract. We obtain quantitative bounds in a special case of the polynomial Sze-merédi theorem of Bergelson and Leibman, provided the polynomials are homogeneous and of the same degree. Such configurations include arithmetic progressions with com-mon difference equal to a kth power. 1
We demonstrate the applicability of the polynomial degree bound technique to notions such as the non...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upp...
We obtain quantitative bounds in the polynomial Szemerédi theorem of Bergelson and Leibman, provided...
We show that any subset of $[N]$ of density at least $(\log\log{N})^{-2^{-157}}$ contains a nontrivi...
Abstract. We prove a quantitative version of the Polynomial Szemerédi Theorem for difference sets. ...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Abstract We demonstrate the applicability of the polynomial degree bound technique to notions such a...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
We show here a 2(Omega(root d center dot logN)) size lower bound for homogeneous depth four arithmet...
In 1975 Szemerédi proved that a set of integers of positive upper density contains arbitrarily long ...
Abstract. Remez-type inequalities provide upper bounds for the uniform norms of polynomials on give...
Abstract. Szemerédi’s Theorem states that a set of integers with positive upper den-sity contains a...
We prove a separation between monotone and general arithmetic formulas for polynomials of constant d...
In this thesis we study the generalisation of Roth’s theorem on three term arithmetic progressions t...
We demonstrate the applicability of the polynomial degree bound technique to notions such as the non...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upp...
We obtain quantitative bounds in the polynomial Szemerédi theorem of Bergelson and Leibman, provided...
We show that any subset of $[N]$ of density at least $(\log\log{N})^{-2^{-157}}$ contains a nontrivi...
Abstract. We prove a quantitative version of the Polynomial Szemerédi Theorem for difference sets. ...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Abstract We demonstrate the applicability of the polynomial degree bound technique to notions such a...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
We show here a 2(Omega(root d center dot logN)) size lower bound for homogeneous depth four arithmet...
In 1975 Szemerédi proved that a set of integers of positive upper density contains arbitrarily long ...
Abstract. Remez-type inequalities provide upper bounds for the uniform norms of polynomials on give...
Abstract. Szemerédi’s Theorem states that a set of integers with positive upper den-sity contains a...
We prove a separation between monotone and general arithmetic formulas for polynomials of constant d...
In this thesis we study the generalisation of Roth’s theorem on three term arithmetic progressions t...
We demonstrate the applicability of the polynomial degree bound technique to notions such as the non...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upp...