On accumulated spectrograms for Gabor frames

For arbitrary real b > 1 and for a large real parameter t let R (b, t) be the number of lattice points between the curve by = x (1 ≤x≤t) and the x-axis, the points on the x-axis being counted with the factor 1 / 2. Furthermore, let the lattice rest\( {\mit\Gamma} (b, t) \) be defined as the difference between R (b, t) and the area of the domain. The asymptotic behaviour of \( {\mit\Gamma} (b, t) \) for \( t\rightarrow \infty \) and also for b→ 1+ are investigated.

Higher moments for lattice point discrepancy of convex domains and annuli

Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packing minima}, associated to a convex body $K$ and a lattice $\Lambda$. These numbers interpolate between the successive minima of $K$ and the inverse of the successive minima of the polar body of $K$, and can be understood as packing counterparts to the covering minima of Kannan & Lov\'{a}sz (1988). As our main results, we prove sharp inequalities that relate the volume and the number of lattice points in $K$ to the sequence of packing minima. Moreover, we extend classical transference bounds and discuss a natural class of examples in detail.

Rank-1 lattice rules based on a weighted star discrepancy with weights of a product form have been previously constructed under the assumption that the number of points is prime. Here, we extend these results to the non-prime case. We show that if the weights are summable, there exist lattice rules whose weighted star discrepancy is O(n −1+δ ), for any δ > 0, with the implied constant independent of the dimension and the number of lattice points, but dependent on δ and the weights. Then we show that the generating vector of such a rule can be constructed using a component-by-component (CBC) technique. The cost of the CBC construction is analysed in the final part of the paper.

We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure (‘length’) of nodal intersections against a smooth 2-dimensional toral sub-manifold (‘surface’). A prior result of ours prescribed the expected length, universally proportional to the area of the reference surface, times the wavenumber, independent of the geometry. In this paper, for surfaces contained in a plane, we give an upper bound for the nodal intersection length variance, depending on the arithmetic properties of the plane. The bound is established via estimates on the number of lattice points in specific regions of the sphere.

This paper considers the local integrability condition for generalised translation-invariant systems and its relation to the Calderon integrability condition, the temperateness condition and the uniform counting estimate. It is shown that sufficient and necessary conditions for satisfying the local integrability condition are closely related to lower and upper bounds on the number of lattice points that intersect with the translates of a compact set. The results are complemented by examples that illustrate the crucial interplay between the translation subgroups and the generating functions of the system.

On the number of lattice points in convex symmetric bodies and their duals

A new estimate is obtained for the residue R in the asymptotics of the number of integer points in a ball of radius a. The estimate has the form R ≪ a 17/14 + ɛ .

In their survey article on cyclic Steiner Quadruple Systems SQS(v) M. J. Grannel and T. S. Griggs advanced the conjecture (cf. [8, p. 412]) that their necessary condition for the existence of S-cyclic SQS(v) (cf. [7, p. 51]) is also sufficient. Some years prior to that E. Kohler [10] used a graph theoretical method to construct S-cyclic SQS(v). This method was extended in [17]-[20] and eventually used to reduce the conjecture of Grannel and Griggs to a number theoretic claim (cf. also [21], research problem 146). The main purpose of the present paper is to attack this claim. For the long intervals we have to distinguish four cases. The proof of cases I–III can be accomplished by a thorough study of how the multiples of a certain set belonging to the first column of a certain matrix (the elements of which are essentially the vertices of a graph corresponding to SQS(2p)) are distributed over the columns. The proof is by contradiction. Case IV is most difficult to treat and could only be dealt with by very deep lying means. We have to use an asymptotic formula on the number of lattice points (x,y) with xy ≡ 1 mod p (we speak of 1-points) in a rectangle and this formula shows that the 1-points are equidistributed. But even so our claim could not be proved for all intervals of admissible length. Intervals [a,b] with ^p—_m+1 <a <b < ^p−_m for some m and 3√4 p <b−a <p ^11−15 could not be covered. In the last section we discuss some conclusions which would follow from the non-existence of complete intervals.

We present a general framework for computing various optimal embeddings of undirected and directed connected graphs in two and multi-dimensional integer lattices in time sub-exponential either in the minimum number n of lattice points used by such optimal embeddings or in the budget upper bound b on the number of lattice points that may be used in an embedding. The sub-exponential upper bounds in the two dimensional case and d-dimensional case are respectively of the form 2\(^{O(\sqrt{ln}log n)}\), 2\(^{O(\sqrt{lb}log b)}\) and 2\(^{O(dl^{1/d_n (d-1)/d}{\rm log} n)}\), 2\(^{O(dl^{1/d_b (d-1)/d}{\rm log} b)}\), where l stands for the degree of the allowed overlap. For the problem of minimum total edge length planar or multi-dimensional embedding or layout of a graph and the problem of an optimal protein folding in the so called HP model we obtain the upper bounds in terms of n. Note that in case of protein folding n is also the size of the input. The list of problems for which we can derive the upper bounds in terms of b includes among other things:

We study the fractal uncertainty principle in the joint time-frequency representation, and we prove a version for the Short-Time Fourier transform with Gaussian window on the modulation spaces. This can equivalently be formulated in terms of projection operators on the Bargmann-Fock spaces of entire functions. Specifically for signals in L 2 ( R d ) , we obtain norm estimates of Daubechies' time-frequency localization operator localizing on porous sets. The proof is based on the maximal Nyquist density of such sets, which we also use to derive explicit upper bound asymptotes for the multidimensional Cantor iterates, in particular. Finally, we translate the fractal uncertainty principle to discrete Gaussian Gabor multipliers.

Time-frequency partitions and characterizations of modulation spaces with localization operators

We study time-frequency localization operators of the form A a φ 1 , φ 2 A_a^{\varphi _1\!,\varphi _2} , where a a is the symbol of the operator and φ 1 , φ 2 \varphi _1 , \varphi _2 are the analysis and synthesis windows, respectively. It is shown in an earlier paper by the authors that a sufficient condition for A a φ 1 , φ 2 ∈ S p ( L 2 ( R d ) ) A_a^{\varphi _1,\varphi _2}\in S_p(L^2(\mathbb {R}^d)) , the Schatten class of order p p , is that a a belongs to the modulation space M p , ∞ ( R 2 d ) M^{p,\infty }(\mathbb {R}^{2d}) and the window functions to the modulation space M 1 M^1 . Here we prove a partial converse: if A a φ 1 , φ 2 ∈ S p ( L 2 ( R d ) ) A_a^{\varphi _1,\varphi _2}\in S_p(L^2(\mathbb {R}^d)) for every pair of window functions φ 1 , φ 2 ∈ S ( R 2 d ) \varphi _1,\varphi _2\in \mathcal {S}(\mathbb {R}^{2d}) with a uniform norm estimate, then the corresponding symbol a a must belong to the modulation space M p , ∞ ( R 2 d ) M^{p,\infty }(\mathbb {R}^{2d}) . In this sense, modulation spaces are optimal for the study of localization operators. The main ingredients in our proofs are frame theory and Gabor frames. For p = ∞ p=\infty and p = 2 p=2 , we recapture earlier results, which were obtained by different methods.

We consider the spaces of ultradifferentiable functions $$\mathcal {S}_\omega $$ as introduced by Bjorck (and its dual $$\mathcal {S}'_\omega $$ ) and we use time-frequency analysis to define a suitable wave front set in this setting and obtain several applications: global regularity properties of pseudodifferential operators of infinite order and the micro-pseudolocal behaviour of partial differential operators with polynomial coefficients and of localization operators with symbols of exponential growth. Moreover, we prove that the new wave front set, defined in terms of the Gabor transform, can be described using only Gabor frames. Finally, some examples show the convenience of the use of weight functions to describe more precisely the global regularity of (ultra)distributions.

We consider time-frequency localization operators A_a^{varphi _1,varphi _2} with symbols a in the wide weighted modulation space M^infty _{w}({mathbb {R}^{2d}}), and windows varphi _1, varphi _2 in the Gelfand–Shilov space mathcal {S}^{left( 1right) }(mathbb {R}^d). If the weights under consideration are of ultra-rapid growth, we prove that the eigenfunctions of A_a^{varphi _1,varphi _2} have appropriate subexponential decay in phase space, i.e. that they belong to the Gelfand–Shilov space mathcal {S}^{(gamma )} (mathbb {R^{d}}) , where the parameter gamma ge 1 is related to the growth of the considered weight. An important role is played by tau -pseudodifferential operators Op_{tau } (sigma ). In that direction we show convenient continuity properties of Op_{tau } (sigma )when acting on weighted modulation spaces. Furthermore, we prove subexponential decay and regularity properties of the eigenfunctions of Op_{tau } (sigma ) when the symbol sigma belongs to a modulation space with appropriately chosen weight functions. As an auxiliary result we also prove new convolution relations for (quasi-)Banach weighted modulation spaces.