Related papers: Implementation of discretized Gabor frames and the…
Frames have been investigated frequently over the last few decades due to their valuable properties, which are desirable for various applications as well as interesting for theory. Some applications additionally require distributed…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…
Discrete and continuous standard windowing are revisited and a a new taper is introduced, which is derived from the normal circular distribution by von Mises. Both the continuous-time and the discrete-time windows are considered, and their…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames,…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…
Although it is relatively easy to apply, the gradient method often displays a disappointingly slow rate of convergence. Its convergence is specially based on the structure of the matrix of the algebraic linear system, and on the choice of…
The presence of symmetries of binary programs typically degrade the performance of branch-and-bound solvers. In this article, we derive efficient variable fixing algorithms to discard symmetric solutions from the search space based on…
Thirty years ago, in a seminal paper Ramana derived an exact dual for Semidefinite Programming (SDP). Ramana's dual has the following remarkable features: i) it is an explicit, polynomial size semidefinite program ii) it does not assume…
Two semi-implicit Euler schemes for differential inclusions are proposed and analyzed in depth. An error analysis shows that both semi-implicit schemes inherit favorable stability properties from the differential inclusion. Their…
We study Gabor orthonormal windows in $L^2({\Bbb Z}_p^d)$ for translation and modulation sets $A$ and $B$, respectively, where $p$ is prime and $d\geq 2$. We prove that for a set $E\subset \Bbb Z_p^d$, the indicator function $1_E$ is a…
A particular type of linear optical multiport, the Grover four-port, has previously been shown to couple the spatial symmetry of a photon to its direction of travel. It is shown here that use of a nonstandard choice of qubit, based on…
We study Mirror Symmetry of log Calabi-Yau surfaces. On one hand, we consider the number of ``affine lines'' of each degree in the complement of a smooth cubic in the projective plane. On the other hand, we consider coefficients of a…
In this article we are going to discuss the conjecture of Strohmer and Beaver for Gaussian Gabor systems. It asks for an optimal sampling pattern in the time-frequency plane, where optimality is measured in terms of the condition number of…
The use of Gaussian processes (GPs) is supported by efficient sampling algorithms, a rich methodological literature, and strong theoretical grounding. However, due to their prohibitive computation and storage demands, the use of exact GPs…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
Improving and extending the concept of dual for frames, fusion frames and continuous frames, the notion of dual for continuous fusion frames in Hilbert spaces will be studied. It will be shown that generally the dual of c-fusion frames may…