Related papers: The Strohmer and Beaver Conjecture for Gaussian Ga…
We study results related to a conjecture formulated by Strohmer and Beaver about optimal Gaussian Gabor frame set-ups. Our attention will be restricted to the case of Gabor systems with standard Gaussian window and rectangular lattices of…
We study sharp frame bounds of Gabor systems over rectangular lattices for different windows and integer oversampling rate. In some cases we obtain optimality results for the square lattice, while in other cases the lattices optimizing the…
The frame set conjecture for Hermite functions formulated in [Gr\"ochenig, J. Fourier Anal. Appl., 20(4):865-895, 2014] states that the Gabor frame set for these generators is the largest possible, that is, the time-frequency shifts of the…
Although frames, which are a generalization of bases, are important tools used in signal processing, their potential in other fields of engineering and applied mathematics (e.g. acoustics) has not been fully explored yet. Gabor frames, that…
Two decades ago, Zauner conjectured that for every dimension $d$, there exists an equiangular tight frame consisting of $d^2$ vectors in $\mathbb{C}^d$. Most progress to date explicitly constructs the promised frame in various dimensions,…
A Gabor system generated by a window function $\phi$ and a rectangular lattice $a \Z\times \Z/b$ is given by $${\mathcal G}(\phi, a \Z\times \Z/b):=\{e^{-2\pi i n t/b} \phi(t- m a):\ (m, n)\in \Z\times \Z\}.$$ One of fundamental problems in…
This paper presents a possible link between Cages and Expander Graphs by introducing three interconnected variants of the Bermond and Bollob\'as Conjecture, originally formulated in 1981 within the context of the Degree/Diameter Problem. We…
We consider the problem of sampling from a product-of-experts-type model that encompasses many standard prior and posterior distributions commonly found in Bayesian imaging. We show that this model can be easily lifted into a novel latent…
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…
This paper is devoted to the problem of sampling Gaussian fields in high dimension. Solutions exist for two specific structures of inverse covariance : sparse and circulant. The proposed approach is valid in a more general case and…
Bessel duality of regular Gabor systems states that a Gabor system over a lattice is a Bessel sequence if and only if the corresponding Gabor system over the adjoint lattice is a Bessel sequence. We show that this fundamental result of…
A Gabor system in $L^2(\mathbb{R})$, generated by a window $g\in L^2(\mathbb{R})$ and associated with a sequence of times and frequencies $\Gamma\subset\mathbb{R}^2$, is a set formed by translations in time and modulations of $g$. In this…
The gauge symmetries of a general dynamical system can be systematically obtained following either a Hamiltonean or a Lagrangean approach. In the former case, these symmetries are generated, according to Dirac's conjecture, by the first…
Consider the problem of estimating the mean of a Gaussian random vector when the mean vector is assumed to be in a given convex set. The most natural solution is to take the Euclidean projection of the data vector on to this convex set; in…
In this paper, we investigate the statistical convergence rate of a Bayesian low-rank tensor estimator. Our problem setting is the regression problem where a tensor structure underlying the data is estimated. This problem setting occurs in…
The Haugazeau method was originally designed to compute the best approximation from an intersection of closed convex sets in Hilbert spaces using the projection operators onto the individual sets iteratively. We propose an abstract…
We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In…
We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…
The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for conjectures. The minimum number of states in which a conjecture can be modeled gives a classification of what logic…
Let $Y=(Y(t))_{t\geq0}$ be a zero-mean Gaussian stationary process with covariance function $\rho:\mathbb{R}\to\mathbb{R}$ satisfying $\rho(0)=1$. Let $f:\mathbb{R}\to\mathbb{R}$ be a square-integrable function with respect to the standard…