Related papers: On the k-Independence Required by Linear Probing a…

The main goal of the paper is to prove that the sequence of functions $f(x), Df(x), \dots, D^{2n+1}f(x)$, where $f(x)$ is $x^n\sin x$ or $x^n\cos x$ are linearly independent. Or more generally: that the sequence of functions $D^kf(x),…

We prove that for any 4 points in the plane that belong to 2 parallel lines, there is no linear dependence between the associated time-frequency translates of any nontrivial Schwartz function. If mild Diophantine properties are satisfied,…

It is known that if a 2-universal hash function $H$ is applied to elements of a {\em block source} $(X_1,...,X_T)$, where each item $X_i$ has enough min-entropy conditioned on the previous items, then the output distribution…

Filter data structures over-approximate a set of hashable keys, i.e. set membership queries may incorrectly come out positive. A filter with false positive rate $f \in (0,1]$ is known to require $\ge \log_2(1/f)$ bits per key. At least for…

In this article we investigate different forms of multiplicative independence between the sequences $n$ and $\lfloor n \alpha \rfloor$ for irrational $\alpha$. Our main theorem shows that for a large class of arithmetic functions $a, b…

In this work, we study the phase estimation problem. We show an alternative, simpler and self-contained proof of query lower bounds. Technically, compared to the previous proofs [NW99, Bes05], our proof is considerably elementary.…

While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space $\mathbb{Z}^n$. This is a further generalization of the search space of multi-valued decision…

In investigation of boundary-value problems for certain partial differential equations arising in applied mathematics, we often need to study the solution of system of partial differential equations satisfied by hypergeometric functions and…

In an $\alpha$-way set-associative cache, the cache is partitioned into disjoint sets of size $\alpha$, and each item can only be cached in one set, typically selected via a hash function. Set-associative caches are widely used and have…

To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probability using independent repetitions. Important examples of…

Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a…

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and min-wise independent hashing. For random variables whose…

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 +…

We consider the problem of optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide a polynomial-time algorithm that determines an r-best solution for nonlinear…

Stochastic models that predict adaptive filtering algorithms performance usually employ several assumptions in order to simplify the analysis. Although these simplifications facilitate the recursive update of the statistical quantities of…

In this paper, we characterize several classes of continuous radial basis functions that can be employed to determine whether a interaction of a probability is zero or not. These functions encompass standard independence tests but also the…

We develop a new method for proving algebraic independence of $G$-functions. Our approach rests on the following observation: $G$-functions do not always come with a single linear differential equation, but also sometimes with an infinite…

We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$…