In a celebrated work, Blais, Brody, and Matulef [5] developed a technique for proving property testing lower bounds via reductions from communication complexity. Their work focused on testing properties of functions, and yielded new lower bounds as well as simplified analyses of known lower bounds. Here, we take a further step in generalizing the methodology of [5] to analyze the query complexi...

We prove that the best constant in the general Brascamp–Lieb inequality is a locally bounded function of the underlying linear transformations. As applications we deduce certain very general Fourier restriction, Kakeya-type, and nonlinear variants of the Brascamp–Lieb inequality which have arisen recently in harmonic analysis.

where V+ = (|V |+ V )/2 is the positive part of V . Eden and Foias have obtained in [3] a version of a one-dimensional generalised Sobolev inequality which gives best known estimates for the constants in the inequality (2) for 1 ≤ γ < 3/2. The aim of this short article is to extend the method from [3] to a class of matrix-valued potentials. By using ideas from [6] this automatically improves on...

We show that the lower and upper Frechét-Hoeffding copulas, which are singular, can be regularized to absolutely continuous copulas. The method, which is constructive and explicit, states sufficient conditions for when an absolutely continuous copula can be achieved by averaging. A higher degree of regularisation cannot be achieved with the proposed method.

We give a short and unified proof of Hardy-Lieb-Thirring inequalities for moments of eigenvalues of fractional Schrödinger operators. The proof covers the optimal parameter range. It is based on a recent inequality by Solovej, Sørensen, and Spitzer. Moreover, we prove that any non-magnetic Lieb-Thirring inequality implies a magnetic Lieb-Thirring inequality (with possibly a larger constant).

The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministic identity tests has received a lot of...

We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model. Extending the framework of Blais, Brody, and Matulef [BBM12], we show a simple way to reduce (private-coin) SMP problems to distribution testing problems. This method allows us to prove several new dist...

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find all defectives by using as few tests as possible. We consider a variant of classical group testing in which one is concerned not only with minimizing the total...

Despite the large amount of work on solving graph problems in the data stream model, there do not exist tight space bounds for almost any of them, even in a stream with only edge insertions. For example, for testing connectivity, the upper bound is O(n logn) bits, while the lower bound is only Ω(n) bits. We remedy this situation by providing the first tight Ω(n logn) space lower bounds for rand...

This paper gives upper and lower bounds on the minimum error probability of Bayesian M -ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order α. The improved tightness of these bounds over their specialized versions with the Shannon conditional entropy (α = 1) is demonstrated. In particular, in the case where M is finite, we show how to generalize Fano’s...