La fonction de Brakemeier dans le probléme d'Erdős-Ginzburg-Ziv
Large bounded degree trees in expanding graphs.
Limit distributions for multitype branching processes of -ary search trees
Let be an integer. The so-called-ary search treeis a discrete time Markov chain which is very popular in theoretical computer science, modelling famous algorithms used in searching and sorting. This random process satisfies a well-known phase transition: when , the asymptotic behavior of the process is Gaussian, but for it is no longer Gaussian and a limit of a complex-valued martingale arises. In this paper, we consider the multitype branching process which is the continuous time version...
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive.