Related papers: An improvement on the Delsarte-type LP-bound with …
Lagrangian relaxation stands among the most efficient approaches for solving a Mixed Integer Linear Programs (MILP) with difficult constraints. Given any duals for these constraints, called Lagrangian Multipliers (LMs), it returns a bound…
In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…
We describe a particular class of pairs of quantum observables which are extremal in the convex set of all pairs of compatible quantum observables. The pairs in this class are constructed as uniformly noisy versions of two mutually unbiased…
Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…
For the Fourier Algebra of SL(2,R) any bounded multiplier is completely bounded.
We describe sets of mutually unbiased bases (MUBs) for quantum states defined over the p-adic numbers Q_p, i.e. the states that can be described as elements of the (rigged) Hilbert space L2(Q_p). We find that for every prime p>2 there are…
We study BMO spaces associated with semigroup of operators and apply the results to boundedness of Fourier multipliers. We prove a universal interpolation theorem for BMO spaces and prove the boundedness of a class of Fourier multipliers on…
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at…
The problem of finding provably maximal sets of mutually unbiased bases in $\mathbb{C}^d$, for composite dimensions $d$ which are not prime powers, remains completely open. In the first interesting case, $d=6$, Zauner predicted that there…
We show that maximal families of mutually unbiased bases are characterized in all dimensions by partitioned unitary error bases, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned unitary error…
The density matrix of a qudit may be reconstructed with optimal efficiency if the expectation values of a specific set of observables are known. In dimension six, the required observables only exist if it is possible to identify six…
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…
The $(k,a)$-generalised Fourier transform is the unitary operator defined using the $a$-deformed Dunkl harmonic oscillator.The main aim of this paper is to prove $L^p$-$L^q$ boundedness of $(k, a)$-generalised Fourier multipliers. To show…
We analyze and test using Fourier extensions that minimize a Hilbert space norm for the purpose of solving partial differential equations (PDEs) on surfaces. In particular, we prove that the approach is arbitrarily high-order and also show…
We prove the boundedness of a general class of multipliers and Fourier multipliers, in particular of the Hilbert transform, on quasi-Banach modulation spaces. We also deduce boundedness for multiplications and convolutions for elements in…
In this paper, we introduce a criterion for maximal operators associated with Fourier multipliers to be bounded on $L^p(\mathbb{R}^d)$. Noteworthy examples satisfying the criterion are multipliers of the Mikhlin type or limited decay which…
In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases that are as "far apart" as possible, and their classification reveals rich underlying geometric structure. Given a complex inner product space, we construct…
I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases $n$-fold unbiased. They naturally appear while optimizing generic…
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…