Related papers: An improvement on the Delsarte-type LP-bound with …
Algebraic Branching Programs(ABPs) are standard models for computing polynomials. Syntactic multilinear ABPs (smABPs) are restrictions of ABPs where every variable is allowed to occur at most once in every path from the start to the…
All complex Hadamard matrices in dimensions two to five are known. We use this fact to derive all inequivalent sets of mutually unbiased (MU) bases in low dimensions. We find a three-parameter family of triples of MU bases in dimension four…
The connection between maximal sets of mutually unbiased bases (MUBs) in a prime-power dimensional Hilbert space and finite phase-space geometries is well known. In this article we classify MUBs according to their degree of covariance with…
There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is…
In this work, we present some applications of the $L^p$-$L^q$ boundedness of Fourier multipliers to PDEs on the noncommutative (or quantum) Euclidean space. More precisely, we establish $L^p$-$L^q$ norm estimates for solutions of heat,…
Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation.…
Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…
We consider quasiradial Fourier multipliers, i.e. multipliers of the form $m(a(\xi))$ for a class of distance functions $a$. We give a necessary and sufficient condition for the multiplier transformations to be bounded on $L^p$ for a…
This PhD thesis is concerned with SDP bounds for codes: upper bounds for (non)-binary error correcting codes and lower bounds for (non)-binary covering codes. The methods are based on the method of Schrijver that uses triple distances in…
We consider the algebras $M_p$ of Fourier multipliers and show that every bounded continuous function $f$ on $\mathbb R^d$ can be transformed by an appropriate homeomorphic change of variable into a function that belongs to $M_p(\mathbb…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
Analogous to the notion of mutually unbiased bases for Hilbert spaces, we consider mutually unbiased unitary bases (MUUB) for the space of operators, $M(d, \mathbb{C})$, acting on such Hilbert spaces. The notion of MUUB reflects the…
We establish a connection between the problem of constructing maximal collections of mutually unbiased bases (MUBs) and an open problem in the theory of Lie algebras. More precisely, we show that a collection of m MUBs in K^n gives rise to…
In this article we revisit some classical conjectures in harmonic analysis in the setting of mixed norm spaces $L^p_{rad} L^2_{ang} (\mathbb{R}^n)$. We produce sharp bounds for the restriction of the Fourier transform to compact…
We study the problem of the existence of filtered multiplicative bases of a restricted enveloping algebra u(L), where L is a finite-dimensional and p-nilpotent restricted Lie algebra over a field of positive characteristic p.
Maximal sets of mutually unbiased bases are useful throughout quantum physics, both in a foundational context and for applications. To date, it remains unknown if complete sets of mutually unbiased bases exist in Hilbert spaces of…
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch…
Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…
In this paper we have studied Fourier multipliers and Littlewood-Paley square functions in the context of modulation spaces. We have also proved that any bounded linear operator from modulation space $\mathcal{M}_{p,q}(\R^n), 1\leq p,q\leq…