Related papers: Smoothness and decay properties of the limiting Qu…

We prove that the characteristic function of the quicksort distribution is exponentially decreasing at infinity. As a consequence it follows that the density of the quicksort distribution can be analytically extended to the vicinity of the…

We prove that, for every $0 \leq t \leq 1$, the limiting distribution of the scale-normalized number of key comparisons used by the celebrated algorithm QuickQuant to find the $t$th quantile in a randomly ordered list has a Lipschitz…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

The limiting distribution of the normalized number of comparisons used by Quicksort to sort an array of n numbers is known to be the unique fixed point with zero mean of a certain distributional transformation S. We study the convergence to…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

We consider systems of stochastic fixed-point equations that arise in the asymptotic analysis of random recursive structures and algorithms such as Quicksort, generalized P\'olya urn processes and path lengths of random recursive trees and…

The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of $n$ data, permuted uniformly at random, the appropriately normalized complexity $Y_n$ is…

In a continuous-time setting, Fill (2010) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting the mean and scaled by dividing by time, has a limiting…

We provide necessary and sufficient conditions on the characteristics of an infinitely divisible distribution under which its characteristic function $\phi$ decays polynomially. Under a mild regularity condition this polynomial decay is…

As proved by R\'egnier and R\"osler, the number of key comparisons required by the randomized sorting algorithm QuickSort to sort a list of $n$ distinct items (keys) satisfies a global distributional limit theorem. Fill and Janson proved…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

I prove that the average number of comparisons for median-of-$k$ Quicksort (with fat-pivot a.k.a. three-way partitioning) is asymptotically only a constant $\alpha_k$ times worse than the lower bound for sorting random multisets with…

We prove estimates at infinity of convolutions $f^{n\star}$ and densities of the corresponding compound Poisson measures for a class of radial decreasing densities on $\mathbb{R}^d$, $d \geq 1$, which are not convolution equivalent.…

We show that the Fourier transform of Patterson-Sullivan measures associated to convex cocompact groups of isometries of real hyperbolic space decays polynomially quickly at infinity. The proof is based on the $L^2$-flattening theorem…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…

The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect…

We study smoothness of densities for the solutions of SDEs whose coefficients are smooth and nondegenerate only on an open domain $D$. We prove that a smooth density exists on $D$ and give upper bounds for this density. Under some…

It is proved that the Fibonacci and the Frolov point sets, which are known to be very good for numerical integration, have optimal rate of decay of dispersion with respect to the cardinality of sets. This implies that the Fibonacci and the…