In this thesis we investigate two non-linear problems from arithmetic combinatorics by means of a variant of the Hardy-Littlewood circle method. We first consider a translation and dilation invariant system consisting of a diagonal quadratic equation and a linear equation with integer coefficients in s variables, where s ≥ 9. We show that if a subset A of the natural numbers restricted to the interval [1, N] satisfies a notion of pseudorandomness which Gowers terms quadratic uniformity, then it furnishes roughly the expected number of simultaneous solutions to the given equations. If A furnishes no non-trivial solutions to the given system, then we show that the number of elements in A ∩ [1, N] grows no faster than a constan...
Abstract. Given two relatively prime positive integers m < n we consider the smallest positive so...
Consider the system of quadratic diophantine equations bX² − aY² = 0 bX • Y − eY² = 0 constrained to...
Abstract: We define a sequence of squarefree positive integers which arise naturally in the context ...
In this thesis we investigate two non-linear problems from arithmetic combinatorics by means of a va...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solut...
We describe a new algorithm for solving a conjunction of linear diophantine equations, inequations a...
On solutions in arithmetic progressions to homogenous systems of linear equations Jonas Lindstrøm Je...
Given a linear equationL, a setAof integers isL-free ifAdoes not contain anynon-trivial solutions to...
In this paper, we bound the number of solutions to a general Vinogradov system of equations x(1)(j) ...
Given a finite colouring of the positive integers, we count monochromatic solutions to a variety of ...
In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in whi...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of wh...
Abstract. Given two relatively prime positive integers m < n we consider the smallest positive so...
Consider the system of quadratic diophantine equations bX² − aY² = 0 bX • Y − eY² = 0 constrained to...
Abstract: We define a sequence of squarefree positive integers which arise naturally in the context ...
In this thesis we investigate two non-linear problems from arithmetic combinatorics by means of a va...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solut...
We describe a new algorithm for solving a conjunction of linear diophantine equations, inequations a...
On solutions in arithmetic progressions to homogenous systems of linear equations Jonas Lindstrøm Je...
Given a linear equationL, a setAof integers isL-free ifAdoes not contain anynon-trivial solutions to...
In this paper, we bound the number of solutions to a general Vinogradov system of equations x(1)(j) ...
Given a finite colouring of the positive integers, we count monochromatic solutions to a variety of ...
In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in whi...
A common theme in modern combinatorics consists in proving sparse analogues of results known in the ...
Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of wh...
Abstract. Given two relatively prime positive integers m < n we consider the smallest positive so...
Consider the system of quadratic diophantine equations bX² − aY² = 0 bX • Y − eY² = 0 constrained to...
Abstract: We define a sequence of squarefree positive integers which arise naturally in the context ...