Add to ORKGThis thesis is focused of two problems - one in additive combinatorics and one in combinatorial probability. The first problem is a polynomial version of the famous Erdős-Turán problem concerning the growth of the representation function of additive bases of integers. The second problem is a variation of the Littlewood-Offord problem in arbitrary groups
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
AbstractWe give equivalent formulations of the Erdős–Turán conjecture on the unboundedness of the nu...
La première partie de cette thèse traite d'un problème de coloration dans les groupes finis. Pour un...
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial prob...
Götze F, Zaitsev AY. New applications of Arak's inequalities to the Littlewood-Offord problem. EUROP...
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli rando...
Abstract. Consider a random sum 1v1 +: : : + nvn, where 1; : : : ; n are i.i.d. random signs and v1;...
Götze F, Eliseeva YS, Zaitsev AY. ARAK INEQUALITIES FOR CONCENTRATION FUNCTIONS AND THE LITTLEWOOD-O...
AbstractWe show that the analogue of the Erdős–Turán conjecture, for the number of representations b...
In 1943, Littlewood and Offord proved the first anti-concentration result for sums of independent ra...
We consider multilinear Littlewood polynomials, polynomials in n variables in which a specified set ...
Götze F, Eliseeva YS, Zaitsev AY. Arak's inequalities for concentration functions and the Littlewood...
A classical additive basis question is Waring\u27s problem. It has been extended to integer polynomi...
AbstractAfter the description of the models of Kubilius, Novoselov and Schwarz, and Spilker, respect...
This thesis is concerned with two classes of polynomials whose height (meaning the largest absolute ...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
AbstractWe give equivalent formulations of the Erdős–Turán conjecture on the unboundedness of the nu...
La première partie de cette thèse traite d'un problème de coloration dans les groupes finis. Pour un...
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial prob...
Götze F, Zaitsev AY. New applications of Arak's inequalities to the Littlewood-Offord problem. EUROP...
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli rando...
Abstract. Consider a random sum 1v1 +: : : + nvn, where 1; : : : ; n are i.i.d. random signs and v1;...
Götze F, Eliseeva YS, Zaitsev AY. ARAK INEQUALITIES FOR CONCENTRATION FUNCTIONS AND THE LITTLEWOOD-O...
AbstractWe show that the analogue of the Erdős–Turán conjecture, for the number of representations b...
In 1943, Littlewood and Offord proved the first anti-concentration result for sums of independent ra...
We consider multilinear Littlewood polynomials, polynomials in n variables in which a specified set ...
Götze F, Eliseeva YS, Zaitsev AY. Arak's inequalities for concentration functions and the Littlewood...
A classical additive basis question is Waring\u27s problem. It has been extended to integer polynomi...
AbstractAfter the description of the models of Kubilius, Novoselov and Schwarz, and Spilker, respect...
This thesis is concerned with two classes of polynomials whose height (meaning the largest absolute ...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
AbstractWe give equivalent formulations of the Erdős–Turán conjecture on the unboundedness of the nu...
La première partie de cette thèse traite d'un problème de coloration dans les groupes finis. Pour un...