Some curious results related to a conjecture of Strohmer and Beaver
Markus Faulhuber

TL;DR
This paper investigates a specific case of a conjecture on Gaussian Gabor frames with rectangular lattices, revealing new and intriguing results using advanced mathematical tools, and connecting to energy minimization and heat distribution problems.
Contribution
It presents novel findings on the optimality of square lattices for Gaussian Gabor frames at density 2, employing determinants of Laplace--Beltrami operators and special functions.
Findings
Square lattice optimality for the Tolimieri and Orr bound implies optimality for the sharp lower frame bound.
Results extend to energy minimization problems over lattices.
Findings involve determinants of Laplace--Beltrami operators and special functions like Eisenstein series.
Abstract
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 density 2. Although this case has been fully treated by Faulhuber and Steinerberger, the results in this work are new and quite curious. Indeed, the optimality of the square lattice for the Tolimieri and Orr bound already implies the optimality of the square lattice for the sharp lower frame bound. Our main tools include determinants of Laplace--Beltrami operators on tori as well as special functions from analytic number theory, in particular Eisenstein series, zeta functions, theta functions and Kronecker's limit formula. We note that our results also carry over to energy minimization problems over lattices and a heat distribution problem over flat…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Some curious results related to a conjecture of Strohmer and Beaver
Markus Faulhuber
NuHAG, Fcaulty of Mathematics, University of Vienna
Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria
Department of Mathematics, RWTH Aachen University
Schinkelstraße 2, 52062 Aachen, Germany
Abstract.
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 density 2. Although this case has been fully treated by Faulhuber and Steinerberger, the results in this work are new and quite curious. Indeed, the optimality of the square lattice for the Tolimieri and Orr bound already implies the optimality of the square lattice for the sharp lower frame bound. Our main tools include determinants of Laplace–Beltrami operators on tori as well as special functions from analytic number theory, in particular Eisenstein series, zeta functions, theta functions and Kronecker’s limit formula. We note that our results also carry over to energy minimization problems over lattices and a heat distribution problem over flat tori.
Key words and phrases:
Dedekind Eta Function, Gaussian Gabor Systems, Heat Kernel, Laplace–Beltrami Operator, Theta Functions, Zeta Functions
2010 Mathematics Subject Classification:
primary: 42C15; secondary: 11M36, 33E05
The author was supported in part by the Vienna Science and Technology Fund (WWTF): VRG12-009 and in part by an Erwin–Schrödinger Fellowship of the Austrian Science Fund (FWF): J4100-N32. The author spent the first stage of the fellowship with the Analysis Group at NTNU Trondheim where parts of this work have been established. The author wishes to thank Franz Luef for beneficial feedback on the first draft of the manuscript.
1. Introduction
The conjecture of Thomas Strohmer and Scott Beaver [53] relates to the problem of finding an optimal sampling strategy for Gaussian Gabor systems. They conjecture that a hexagonal pattern in the time-frequency plane should be used in order to minimize the condition number of the Gabor frame operator. This can also be formulated as an engineering problem about optimal orthogonal frequency division multiplexing (OFDM) systems and lattice-OFDM systems (see [53]). We will use the Gabor frame formulation of the problem.
A Gabor system (see Section 2) is a collection of functions obtained from combined translations and modulations of a so-called window function . The translation parameters and modulation parameters are chosen with respect to an index set in . Throughout this work the index pairs will generate lattices in . A Gabor system is a frame for , if any element of the Hilbert space has a stable series expansion with respect to the Gabor system. These systems have wide applications and are frequently used in signal analysis and processing and also found their way into the popular area of machine learning. There, Gabor systems are for example used to pre-process audio data in order to extract specific features which can then be passed on to a convolutional neural network (see, e.g., [4], [42], [43]).
Given a standard Gaussian window, we are looking for a lattice of given density (greater than 1) such that the condition number of the associated Gabor frame operator is minimal. For general lattices it is conjectured that the hexagonal lattice is optimal. If only separable (or rectangular) lattices are considered, the conjecture is that the square lattice provides the optimal solution. For even density, it was proven that the hexagonal lattice uniquely minimizes the upper frame bound [13] and in the separable case the square lattice minimizes the upper frame bound and maximizes the lower frame bound, implying that the condition number is minimal [17].
From a qualitative point of view, the lower frame bound and the upper frame bound describe different aspects of the frame operator. Whereas the lower bound concerns the (bounded) invertibility of the frame operator, the upper bound gives the continuity of the operator since the frame operator is linear. Therefore, our main result can be considered to be quite curious.
Theorem 1.1** (Main Result).**
Let be the normalized standard Gaussian and . We denote the optimal lower and upper frame bound of the Gabor system by and respectively. By we denote the (re-normalized) Tolimieri and Orr bound
[TABLE]
Then, for , we have the following implications
[TABLE]
In each case, equality holds only if .
We note that, for , the results
[TABLE]
have been established already in [17] and the result on is actually covered by results of Montgomery[44]. The new insight of the above theorem is the implication
[TABLE]
To obtain the implication in Theorem 1.1, we need to exploit properties of Laplace-Beltrami operators on tori, their determinants and connections to zeta functions as well as other tools from analytic number theory. The use of this machinery is definitely non-standard in the theory of Gabor systems. In addition, the proof relies on the separability of the lattice and the author was not able to establish similar implications for non-separable lattices, even though it is known, due to the results in [13] and [44], that the hexagonal lattice always gives the smallest Tolimieri and Orr bound for fixed lattice density.
Even though this work deals with a problem in time-frequency analysis, the results are of a more general nature. We note that, for example, Montgomery’s main result in [44] shows the so-called universal optimality of the hexagonal lattice for the problem of lattice energy minimization as most recently described in [8]. Now, minimizing among lattices of fixed density is equivalent to the problem of determining the universal optimality of the hexagonal lattice and the problem considered by Montgomery [44], as shown in [13]. The problem for general point sets in is still open and its solution is of utmost importance. We refer to [8] for further reading.
On the other hand, the problem of determining the largest possible lower frame bound is intimately connected to a heat distribution problem on flat tori as described by Baernstein [2], who also conjectures a connection (see also [1] and [3]) to a long-standing problem of Landau [39]. A new connection between the heat kernel problem and Landau’s problem was recently established in [15]. We will draw a connection to the heat kernel problem in Section 5. For further reading on the connections between Gabor systems and Landau’s problem we also refer to [14].
This work is structured as follows.
- •
In Section 2 we introduce Gabor systems and frames for the Hilbert space . The concepts can easily be generalized to higher dimensions, but in this work we only consider the 1-dimensional case. At the end of the section we state 2 conjectures resulting from a conjecture of Strohmer and Beaver [53] and the results of Faulhuber [13] as well as Faulhuber and Steinerberger [17].
- •
In Section 3 we introduce some methods, going back to the work of Janssen [36], [37], which allow us to compute sharp frame bounds.
- •
In Section 4 we leave the field of time-frequency analysis and introduce some tools from analytic number theory. These tools include theta functions, zeta functions related to the Laplace–Beltrami operator on a torus and the Dedekind eta function. Equipped with these tools, we will prove our main result.
- •
In Section 5 we discuss some aspects of the proof and draw connections to the heat distribution problem on flat tori.
- •
In Appendix A, we briefly explain what the symplectic Fourier transform and the symplectic Poisson summation formula are. We will use them as they fit nicely with the concepts of time-frequency analysis.
2. Time-Frequency Analysis
2.1. Gabor Systems
In this section we will set the notation and briefly recall the notion of a Gabor system. We are interested in Gabor systems for square integrable functions on the line. Hence, the Hilbert space of interest is . We note that the concepts can easily be generalized to higher dimensions or, more general, to locally compact Abelian groups (see e.g. [35]). For an introduction or more information on Gabor systems and frames we refer to some of the standard literature e.g. [7], [20], [21], [31], [33] and for a more current state of the research and important open problems in Gabor analysis we refer e.g. to the expository articles [18] and [32].
For the inner product in we write
[TABLE]
where denotes the complex conjugate of . For the Fourier transform we write
[TABLE]
Next, we introduce the fundamental tool in time-frequency analysis, the short-time Fourier transform.
Definition 2.1** (STFT).**
For a function and a window , the short-time Fourier transform of with respect to is defined as
[TABLE]
A Gabor system for is generated by a (fixed, non-zero) window function and an index set and is denoted by . These systems were studied already by von Neumann in the context of quantum mechanics [45] and became popular in engineering due to the article by Gabor [25]. A Gabor system consists of time-frequency shifted versions of and the elements , which will introduced now, are called atoms. By we denote the generic point in the time-frequency plane111We note that is a locally Abelian group and that its dual group is , the group of characters. The time-frequency plane is actually isomorphic to . and for a time-frequency shift by we write
[TABLE]
In general, time-frequency shifts do not commute, as already the time-shift and frequency-shift operators do not commute;
[TABLE]
This results in the following commutation relations for time-frequency shifts;
[TABLE]
These commutation relations are the very reason for the importance of the symplectic group in time-frequency analysis and why we will use the symplectic Fourier transform and a symplectic version of the Poisson summation formula (see Appendix A).
For a window function and an index set the Gabor system is
[TABLE]
We note that we have . Hence, sampling on is the same as taking linear measurement with respect to the atoms of the Gabor system .
It is of particular interest to know whether a Gabor system is also a (Gabor) frame. In this case, the Gabor system serves as a generalization of an orthnormal basis.
Definition 2.2** (Gabor frame).**
In order to be a frame, has to satisfy the frame inequality
[TABLE]
for some positive constants called frame constants or frame bounds.
In this work, whenever we use the term frame bounds, we usually refer to the tightest possible (optimal) bounds in (2.8). It is clear from the frame inequality (2.8) that the frame bounds crucially depend on the window as well as the index set and in general it is hard to calculate sharp frame bounds. However, for certain windows and certain index sets we have explicit formulas, as we will see later.
A prototype example of a Gabor system, which also is a Gabor frame and actually constitutes an orthonormal basis for , is given by
[TABLE]
Note that this example uses the well-known Fourier basis for (or of any other interval of length 1) and places (non-overlapping) copies of it on the real line. The frame inequality (2.8) actually becomes an equality with bounds . Moreover, we can expand any with respect to the Gabor system as
[TABLE]
The coefficients are obtained from the STFT, just as the coefficients in a Fourier series are obtained from the respective Fourier transform of the function on an interval. For general a window and index set , one is interested in expansions of the form
[TABLE]
for all in such that , which is only possible if the frame inequality is fulfilled [41].
Loosely speaking, the coefficients contain local information of the time-frequency content of a function , in contrast to the Fourier transform , where we only know the total contribution of the frequency to all of , but not to localized around some point . In order to obtain valuable local information obtained from the coefficients , one needs a window which localizes well and where the Fourier transform localizes sufficiently well too. The localization properties of the indicator function \raisebox{2.0pt}{\chi}_{[-\frac{1}{2},\frac{1}{2}]}(t) are therefore not satisfying, as its Fourier transform is the sinc function , which is slowly decaying. Now, under very mild assumptions on the window , such as being continuous, and piece-wise differentiable and decaying faster than , it is not possible to obtain an orthonormal basis from a Gabor system. This is known as the Balian-low theorem. Therefore, one needs to deal with overcomplete systems, which also means that, in general, the elements of the Gabor system are neither linearly independent nor orthogonal any more.
To the Gabor system we can associate the Gabor frame operator which acts on an element by the rule
[TABLE]
In general, and are different elements in . However, if is an orthonormal basis, as in the example above, then is the identity operator on . If is a Gabor frame, then the frame operator is bounded and boundedly invertible and we can expand any , e.g., as
[TABLE]
Interchanging the action of the inverse from operator and summation is justified as, under the assumption that is a frame, the series expansion of obtained by the action of the frame operator is a Bessel series and converges unconditionally [31, Chap. 5.3].
The (optimal) frame bounds are connected to the frame operator in the following way
[TABLE]
The condition number of the frame operator is
[TABLE]
Hence, the frame bounds serve as a quantitative measure of how close or far the frame operator is from (a multiple of) the identity operator. Also, it is of interest for implementations to have a small condition number of the frame operator when transmitting data using an (N-)OFDM system implemented by a Gabor frame222As the elements of a Gabor frame are in general not orthogonal, it is appropriate to speak about non-orthogonal frequency division multiplexing (N-OFDM)..
As mentioned in the introduction, qualitatively the lower bound shows that the frame operator is boundedly invertible and the upper bound shows that the frame operator is continuous on . Therefore, one may not expect that an optimality condition on one bound implies the optimality of the other bound.
2.2. Lattices
Throughout the rest of this work the index set will be a lattice. A lattice is generated by an invertible (non-unique) matrix , in the sense that
[TABLE]
where and are the columns of . The parallelogram spanned by the vectors and is called the fundamental domain of . We note that the matrix defining a lattice is not unique as we may choose from a countable set of bases for . More precisely, any matrix , i.e., any matrix of determinant 1 with integer entries leaves invariant;
[TABLE]
Hence, for any . We also refer to [51, Chap. VII] for the importance of in the theory of modular forms, which will be discussed briefly in Section 5.3.
The volume and the density of the lattice are given by
[TABLE]
respectively. For a Gabor system , the density determines the redundancy of the system. If , the system fails to be a frame as not enough information is contained in the coefficient sequence . The case is referred to as the critical density and in this case orthonormal bases and frames exist. If , frames exist, but they cannot be an orthonormal basis. However, the condition is only a necessary condition and not always sufficient for a Gabor system to constitute a frame. We refer to [31, Chap. 7.5] or [34] for more information on density conditions for Gabor frames.
The adjoint lattice is defined as
[TABLE]
and denotes the transposed inverse of . Hence, the adjoint lattice is just a 90 degrees rotated version of the dual lattice, usually denoted by . The formal, but equivalent, definition of the adjoint lattice is
[TABLE]
Note that the adjoint lattice is characterized by the commutation relations (2.6) and equivalently we have
[TABLE]
where is the standard symplectic form (see Appendix A). This underlines the analogy of the adjoint lattice to the dual lattice , which is characterized by the fact that
[TABLE]
where is the Euclidean inner product between and .
In the sequel, we will often limit our attention to rectangular or separable lattices. A lattice is called separable if the generating matrix can be represented by a diagonal matrix, which means that the lattice and its adjoint are given by
[TABLE]
Note that the dual lattice is given by .
2.3. Conjectures Related to the Work of Strohmer and Beaver
Throughout this work we call the function the standard Gaussian. In their article [53] from 2003, Strohmer and Beaver conjecture that for any fixed density the hexagonal lattice minimizes the condition number of the Gabor frame operator . The following conjecture implies the conjecture of Strohmer and Beaver.
Conjecture 2.3**.**
For the standard Gaussian window and any fixed lattice density , among all lattices in the set
[TABLE]
the hexagonal lattice is the unique maximizer for the lower frame bound and the unique minimizer for the upper frame bound.
Before the work of Strohmer and Beaver a conjecture by le Floch, Alard and Berrou (1995) [23] suggested that the square lattice could be optimal. This was disproved in [53], however, if we only consider the separable case we get the following conjecture.
Conjecture 2.4**.**
For the standard Gaussian window and any fixed lattice density , among all separable lattices in the set
[TABLE]
the square lattice is the unique maximizer for the lower frame bound and the unique minimizer for the upper frame bound.
For integer densities of the lattice, Conjecture 2.4 was proved by Faulhuber and Steinerberger [17]. Also, for even integer densities of the lattice it was shown that the hexagonal lattice minimizes the upper frame bound [13]. The general case for the lower frame bound is still open for all possible densities333Tolimieri and Orr [54] mention that, for even densities, in private correspondence with Janssen they found a lengthy argument solving the problem for the upper frame bound in Conjecture 2.4. It is very likely that the argument they found is similar to the proof in [17]..
3. Sharp Frame Bounds
3.1. Janssen’s Work
Our starting point for proving Theorem 1.1 is the work of Janssen [36], [37]. Janssen observed that for integer density the frame bounds can be computed exactly by finding the minimum and the maximum of certain Fourier series related to the frame operator. This follows from the duality theory which he described in [36] and which allows to compute the spectrum of the frame operator via the spectrum of a related, bi-infinite matrix. For integer density of the lattice this bi-infinite matrix has a Laurent structure and, hence, by the general theory of Toeplitz and Laurent matrices and operators, the spectrum can be calculated by using Fourier series with the matrix entries as coefficients [37].
Janssen stated his results for and separable lattices. However, since for any lattice is symplectic, this actually already covers all cases since any Gabor system can be transformed into a Gabor system with separable lattice without losing any of its properties by using a proper unitary operator from the so-called metaplectic group (see e.g. [11], [24], [27], [28], [31]).
Let us now state the result in its original form, since we do not need a more general setting. A standard assumption is
[TABLE]
As we will only need separable lattices in the sequel, we state the following result as given in [37].
Proposition 3.1**.**
Let and , , such that (Condition A) is fulfilled. Then the optimal frame bounds of the Gabor system are given by
[TABLE]
A reformulation of Proposition 3.1, using symmetric time-frequency shifts and the ambiguity function, as well as a generalization to lattices in higher dimensions, can be found in [12].
3.2. A Remark on Condition A
We will now make a small excursion, showing that finding a good upper frame bound (not necessarily the least upper frame bound) already implies a good lower frame bound and, hence, a good condition number. Recall that the frame operator acts on functions by the rule
[TABLE]
The following result shows how to compute the distance between the identity operator and the frame operator using (Condition A). We have
[TABLE]
This follows from Janssen’s representation of the Gabor frame operator
[TABLE]
which is basically a consequence of the so-called fundamental identity of Gabor analysis
[TABLE]
For more details we refer to [19], [22], [31], [36].
We will now assume that is normalized, i.e., . Also, and only for the rest of this section, we will normalize the frame inequality in the following sense;
[TABLE]
The bounds in (3.7) fulfill (see e.g. [35, Thm. 5.1.])
[TABLE]
Note that we included the case where the frame operator is not invertible. The upper bound is finite as we assume (Condition A). In fact, the results in the work of Tolimieri and Orr [54] show that
[TABLE]
always is an upper bound, not necessarily optimal, for the normalized frame inequality (3.7)444Hence, we have that always is an upper bound for the frame inequality ..
We get the following results, which are a direct consequence of (3.5) and are also stated in [57, Chap. 3.1]. There they are referred to as Janssen’s test, which was already introduced in [55].
Proposition 3.2**.**
Assume that with and fulfills (Condition A). If
[TABLE]
then is a frame. Also, if is not a frame, then
[TABLE]
Proof.
We use Janssen’s representation of the Gabor frame operator and re-write it as
[TABLE]
Now, and . Therefore,
[TABLE]
It follows that, if , then
[TABLE]
hence, is invertible and its inverse can be expressed by a Neumann series. The second statement now follows trivially. ∎
Also, we get an estimate on the lower bound from (Condition A) (see also [57, Chap. 3.1]).
Proposition 3.3**.**
Assume that with and fulfills (Condition A). Then we have the following estimates for the constants in (3.7).
[TABLE]
Proof.
The statement that was proved by Tolimieri and Orr [54]. So, we only prove the statement for the lower frame bound.
If , then the statement is trivially true due to (3.8). Hence, assume , which already implies that we have a frame. This also means that
[TABLE]
Therefore, we have
[TABLE]
Hence, the result follows. ∎
The previous result particularly shows that, if the bound is close to 1, then the lower bound has to be close to 1 as well. This means, that a good upper frame bound has a good lower frame bound and a good condition number as a consequence. This already pinpoints into the direction of our main result, which is nonetheless stronger under its more restrictive assumptions.
3.3. Gaussian Windows
We will now use Proposition 3.1 to compute sharp frame bounds for the standard Gaussian window , where the factor in front is chosen to normalize the Gaussian, i.e., . We start with noting that the standard Gaussian is invariant under the Fourier transform [24, App. A], [31, Chap. 1.5], i.e.,
[TABLE]
This fact, and variations of it involving dilations, will be used implicitly several times in the sequel, especially when using the Poisson summation formula. Furthermore, we note that the Gabor system studied by Gabor [25] was (up to scaling) . Now, we know that this system is complete [5], [47] (see also [29]), but just fails to be a frame. Due to the results of Lyubarskii [40] and Seip and Wallsten [48], [49], [50], we know that the Gabor system is a frame if and only if the lattice has density 555This result holds more generally for any (relatively separated) point set with lower Beurling density strictly greater than 1..
Another well-known fact about [31, Chap. 1.5] (and also a nice exercise to verify) is that
[TABLE]
By Proposition 3.1, it follows that the optimal frame bounds of the Gabor system , are given by
[TABLE]
This was already computed by Janssen [37, Sec. 6].
We note that for the alternating sign, given by , equals for all . We note that in this case the double series splits into a product of two simple series of same type;
[TABLE]
The expert reader will already draw the connection to theta functions which will be discussed in the next section.
4. Some Tools from Analytic Number Theory
From here on, our analysis will be for arbitrary density of the lattice, i.e., . However, only if the density is an even, positive integer our formulas exactly describe the frame bounds of the Gaussian Gabor system. We will keep that fact in mind, even though we will not mention it explicitly.
4.1. Theta Functions
We will recall how Conjecture 2.4 was solved for even densities of the lattice by Faulhuber and Steinerberger [17]. First, we introduce the functions , and . The literature on theta functions is extensive and any attempt to pick representative textbooks or surveys is doomed. We name the textbooks by Stein and Shakarchi [52] and Whittaker and Watson [56] as references.
As customary, we denote the complex plane by and the upper half plane by . A theta function is a function of two complex variables and the classical theta function is
[TABLE]
In this work we will deal with the following list of theta functions which can be expressed by in one way or another. We define
[TABLE]
These functions are Jacobi’s classical theta functions.
For our purposes, we will use Jacobi’s theta functions where we fix the first argument to be (so called “theta nulls”). Hence, for we define the following theta functions.
[TABLE]
We note that for all . Any of the above functions also has a product representation, called the Jacobi triple product representation;
[TABLE]
Later, we will restrict our attention to purely imaginary and note, that the above functions are real-valued and positive in this case.
It is a well-known fact and easily proved by using the Poisson summation formula (see Appendix A) that
[TABLE]
as well as
[TABLE]
We note that we can write the lower and upper bound of the Gaussian Gabor system , as products of the above theta functions ( and are always exchangeable by equation (4.10)).
[TABLE]
As already observed in [17], since the product is fixed, the problem of finding extremal frame bounds can be reformulated as a problem of a (fixed) parameter and one variable. In [17], the following result is proved.
Theorem 4.1**.**
For any fixed , the function
[TABLE]
is maximal if and only if . Also, the function
[TABLE]
is minimal if and only if .
This theorem is equivalent to saying that the Gabor frame bounds of the Gabor system are extremal if and only if .
A key ingredient in the work of Faulhuber and Steinerberger [17] is to formulate a problem independent of the parameter , hence independent of the density of the lattice. We note that, in [17], there is no hint in the proof of Theorem 4.1 that the minimality of implies the maximality of , not even for the case , which we essentially prove in Theorem 1.1.
4.2. Zeta Functions
For this section we will identify with . The lattice in focus is then , . Also, we will focus our attention on another class of special functions now, namely zeta functions related to Laplace–Beltrami operators on rectangular tori. A rectangular torus can be identified with a rectangular lattice;
[TABLE]
We will now mainly follow the work of Baernstein and Vinson [3] and the work of Osgood, Philips and Sarnak [46]. For the torus we denote its Laplace–Beltrami operator by . We note that the eigenfunctions of are given by
[TABLE]
with eigenvalues666We chose the sign of such that the eigenvalues are non-negative.
[TABLE]
Consequently, for , the heat kernel is then given by the formula
[TABLE]
At this point, we remark that is an element of the dual lattice of and that, in general, the heat kernel on a (complex) torus can be explicitly written in terms of the (complex) dual lattice ;
[TABLE]
Getting back to the family of tori , the trace of the heat kernel associated to is given by
[TABLE]
and its zeta function is given by
[TABLE]
where the prime indicates that the sum excludes the origin. The determinant of the Laplace–Beltrami operator is formally given as the product of the non-zero eigenvalues,
[TABLE]
This product is not always meaningful and, usually, one uses the zeta regularized determinant of the Laplace–Beltrami operator instead, which is given by
[TABLE]
The problem under consideration is to find the pair which maximizes the determinant for fixed volume of the torus, i.e., fixed. We note that the last line in equation (4.22) is, up to the factor in front, a real analytic Eisenstein series. In general, for and , the real analytic Eisenstein series is given by
[TABLE]
It can be continued analytically for with a pole at with residue , which follows from Kronecker’s limit formula given below. In order to compute the regularized determinant , Osgood, Philips and Sarnak employ Kronecker’s limit formula [46, eq. (4.4)]
[TABLE]
Here, is the Dedekind eta function which we will study in more detail in the upcoming section.
By the last results, it follows that
[TABLE]
Therefore, the determinant is given by
[TABLE]
Since we fixed the product , which expresses the surface area of the torus, we see that the problem of maximizing the determinant is invariant under scaling and we may therefore assume that .
For the rest of this work, we choose the following normalization and notation for our torus;
[TABLE]
Likewise, in the sequel we will use the index for the index pair , appearing in the Laplace–Beltrami operator, the heat kernel, the determinant and the zeta function.
For general tori, it was shown in [46] that the hexagonal torus is the unique maximizer of the determinant by using a proof which combines analytic and numerical methods. For rectangular tori, it was shown in [16] that the square torus is the unique maximizer by purely analytic means. It also follows from the results in Montgomery’s work [44] that the hexagonal torus maximizes the determinant among all tori of given surface area. That was also remarked in the work of Baernstein and Vinson [3]. Likewise, it follows from one of the results of Faulhuber and Steinerberger [17] that the square torus is the maximizer of the determinant among all rectangular tori of given surface area.
We will shortly sketch the arguments used in [3] and [44]. For brevity, we set
[TABLE]
The results in [17] and [44] show that
[TABLE]
with equality if and only if .
We will show how this result already implies the result for the determinant. Now, the zeta function also has an integral representation and it is connected to the heat kernel via the Mellin transform [38].
[TABLE]
where denotes the Gamma function. The function extends to a meromorphic function with a simple pole of order 1 at [10]. Montgomery [44] uses the regularized version
[TABLE]
which is well defined for , except for the points 0 and 1, and yields the functional equation
[TABLE]
We repeat now the arguments given in [3]. Since does not depend on , by differentiating both sides of (4.36), it follows that
[TABLE]
where the prime indicates differentiation with respect to . By taking the limit and using the functional equation (4.37), we get
[TABLE]
and, since ,
[TABLE]
with equality if and only if .
4.3. The Dedekind Eta Function
The last function we investigate is the Dedekind eta function. We start by defining the function by its product representation;
[TABLE]
We note that it can be expressed as a product of theta functions in the following way (see e.g. [6, Chap. 3], [9, Chap. 4] or [56, eq. (21.41) p. 463, Ex. 1 p. 466])777The function is often denoted by .;
[TABLE]
Since we are interested in rectangular tori, we are only interested in purely imaginary arguments , . We note that in this case it follows from formula (4.41) defining , that . Also, we have the following connection to the theta functions defined in Section 4.1;
[TABLE]
4.4. Proof of Theorem 1.1
We collected all the material to prove our main result. By using the Jacobi identities (4.10) and (4.11), we write the optimal Gabor frame bounds, of the Gaussian Gabor system with , , given by (4.12) and (4.13), as
[TABLE]
We start now by taking both sides of equation (4.43) to the power 4 and then multiply by , which gives in combination with (4.31)
[TABLE]
By multiplying both sides of the last equation by , it follows that
[TABLE]
Also, we note that for all we have
[TABLE]
which by Theorem 4.1 is minimal if and only if . Starting from the minimality of the trace of the heat kernel , we obtain the following chain of implications from the results in Section 4.2, with details provided below;
[TABLE]
The first implication uses the following assertions from Section 4.2;
[TABLE]
By combining (4.46) and (4.48), we get (with ). Therefore, the maximality of the determinant for implies the maximality of the product for , as the trace of the heat kernel is minimal in this case. Since the result on the determinant is implied by the result on the heat kernel, the fact that the trace is minimal for (for all ) also implies that the product is maximal for .
In the view of Theorem 4.1, we have that for all implies that (note that the index of is ). However, Theorem 4.1 also tells us that for all and this follows independently form the result on (see the proof in [17]).
As a further consequence, by using (4.47), we get the following chain of implications for the Gabor frame ;
[TABLE]
For the first implication we used the fact that for we have 888The factor 2 in front of is, of course, determined by the density of the Gabor system and the fact that we defined in a way to suit the re-normalized results in Section 3.2. More generally, for , we have , as already remarked in [54, Sect. 4].. The remaining argument is to note that the product of the Gabor frame bounds yields (up to a constant) the determinant of the Laplace–Beltrami operator. This completes the proof of Theorem 1.1. ∎
5. The Different Aspects of the Proof
We note that the proof relies on several curious facts. We will discuss the different aspects in this section and start with an overview.
First of all, the results of Faulhuber and Steinerberger [17] and of Montgomery [44] are results about periodized Gaussian functions on a lattice. The parameter appearing in those works should be interpreted as the density of the lattice. However, the results can also be interpreted as problems for a family of heat kernels on a torus with varying metric. Only for very special cases the results describe the exact behavior of Gaussian Gabor frame bounds. Also, we note that we needed the optimality of the Tolimieri and Orr bound for the square lattice for all densities to establish the optimality of the lower frame bound for the square lattice of density 2. All attempts of the author to show that the results are independent of the parameter , hence holding for arbitrary (even) density, ended up to be equivalent to Theorem 4.1. But then the optimality of the lower frame bound follows independently from the optimality of the upper frame bound. Hence, it would be nice to find an argument not relying on [17], which shows that the frame bound problem is invariant under scaling.
Another curiosity is that Jacobi’s function as well as the Dedekind eta function are actually modular functions of positive weight with respect to . The frame bounds of a Gaussian Gabor frame are also modular forms, however, of weight 0. It is the separability of the problem which makes the proof of our Theorem 1.1 work. At the moment, it seems as if the techniques used in this work, will not work for non-separable lattices.
But before going into detail, we will shortly explain why density 2 is such a special case.
5.1. Why Density 2?
We will now shortly describe one key aspect, why our result was only established for density 2. Recall, that the sharp frame bounds are derived by sampling on the adjoint time-frequency lattice and that we have, according to formula (3.19),
[TABLE]
The adjoint of the square lattice of density 2, , is given by . This means that for we have
[TABLE]
We have that is a fixed point of the (symplectic) Fourier transform. Hence, Poisson’s summation formula is particularly nice in this case and, also, the above formula allows us to easily connect to Jacobi’s theta functions and the Dedekind eta function with purely imaginary arguments.
5.2. A Problem for the Heat Kernel
The results of Faulhuber and Steinerberger [17] and of Montgomery [44] also provide solutions about a problem concerning the temperature on a torus. For a more recent and thorough study on the temperature problem on the torus we refer to [15].
We identify the torus with a fundamental cell999The fundamental cell of a lattice is the parallelogram spanned by the basis vectors of . of the lattice , fixed, and denote it by
[TABLE]
Recall from Section 4.2 that the explicit formula for the heat kernel on a torus involves the dual lattice. By using the Poisson summation formula, the corresponding heat kernel can be written using the lattice, which defines the torus, rather than its dual;
[TABLE]
By the symplectic version of Poisson’s summation formula (see Appendix A) we have the alternative representation
[TABLE]
The two formulas describe, of course, the same temperature distribution, i.e.,
[TABLE]
For time , we denote the minimal and the maximal temperature of the heat kernel by
[TABLE]
By using the triangle inequality, we easily conclude that
[TABLE]
which shows that is taken at the origin and, due to periodicity, at any other lattice point of . Also, equals the trace of the heat kernel. Locating the minimum is not as easy and the author is not aware of a closed expression for this problem. For separable lattices and for the hexagonal lattice, the minimum is achieved in a “deep hole”. This is where one would naturally expect the minimum as this is the point with the largest distance to its closest neighbors. It is also the point which is covered last if one places disks of radius at the lattice points and blows them up until they cover the whole plane. However, the generic non-separable case seems to be that the minimum is achieved at some point close to a “deep hole” and that the location also depends on the parameter . Similar observations are described in the article by Baernstein and Vinson [3].
Montgomery’s result [44] shows that
[TABLE]
where is the hexagonal lattice. The results of Faulhuber and Steinerberger [17] show that
[TABLE]
where we used the notation for separable tori from Section 4.2. The problem remaining open, which is also addressed in [15, Sec. 6, eq. (6.3)], is whether
[TABLE]
which is closely related to Conjecture 2.3.
We note the close connection of the above problems to the Strohmer and Beaver Conjecture. The key observation is that the time variable can also be used to describe the volume of the lattice. Consider the Gaussian Gabor system
[TABLE]
with . This means that the time-frequency shifts are carried out along a scaled version of the lattice with density . We note that we only have a frame if and for , the sharp Gaussian Gabor frame bounds are given by 101010For , , the time-frequency lattice has density , which means that gives a time-frequency lattice of even density.
[TABLE]
and
[TABLE]
More general, gives the Tolimieri and Orr bound for the Gaussian Gabor system with lattice density and (recall Section 3.2)
[TABLE]
We have equality whenever .
One curios part of the proof is now that we lose the parameter when moving from the trace of the heat kernel to the zeta function, as we integrate over . Actually, we need the information that the minimal trace of the heat kernel stays minimal for all in order to establish our main result, which then implies the maximality result for , which corresponds to the Gabor case of density 2. Lastly, we note that the (real) parameter is usually interpreted as “time” in the case of the heat kernel, whereas the density of the lattice (which equals the reciprocal value of the surface area of the torus) is fixed. However, it can also be interpreted as the density of the lattice for fixed time or as the product of both, density and time.
5.3. The Modular Aspect of the Proof
We will only give some basic details on modular functions and refer to the textbooks of Serre [51] or Stein and Shakarchi [52]. A modular function of weight satisfies
[TABLE]
We note that is invariant under the action of the group , which consists of determinant 1 matrices with integer entries. Expressed differently, we only change the basis of the lattice under the action of this group. Since, in general, the matrices and generate the same lattice, they are identified which is why we only consider , the modular group.
Next, we note that a 2-dimensional lattice can be identified (modulo rotation) with a complex number . The generating matrix then has the form
[TABLE]
We set
[TABLE]
where we identify with . Then, it follows that and are modular forms of weight 0 with respect to . After all, choosing a different basis for the lattice just changes the order of summation. However, the values do not depend on the order of summation as the sums defining the heat kernel are absolutely convergent. In the separable case, is purely imaginary, i.e., with , and the values of and split into products of theta functions of the form
[TABLE]
In the non-separable case, the author is not aware of a possibility to write and as just a product of “nulls” of Jacobi’s theta functions. However, the possibility to write and as products of theta functions lastly gives the connection to the Dedekind eta function, which is a modular form of weight 1/2.
We recall from [46], or by repeating the calculations in Section 4.2 for general , that the determinant of the Laplace–Beltrami operator on a (general) torus is given by
[TABLE]
where with , (also compare with [51, Chap. VII]). The behavior of the eta function under the modular group is given by
[TABLE]
and the imaginary part of transforms as
[TABLE]
Hence, we have the result
[TABLE]
It follows that the determinant of the Laplace–Beltrami operator on a two dimensional torus is a modular form of weight 0 with respect to the metric on the torus.
By using the symplectic version of Poisson’s summation formula we find that the determinant also behaves like a modular form with respect to the volume of the lattice (also see Appendix A)
[TABLE]
However, the volume is a positive number and the behavior of the determinant is therefore comparable to the behavior of the Dedekind eta function for purely imaginary arguments. As already explained, the parameter describes the volume of the lattice. It is for this reason that we cannot really distinguish between the modular parameter and the real parameter for separable tori which causes one of the curiosities mentioned at the beginning of this section.
Appendix A The Symplectic Poisson Summation Formula
When working in the time-frequency plane or phase space, it is often advantageous to exploit the symplectic structure of . The concept of phase space allows for a simultaneous treatise of two aspects of a function, coupled via the Fourier transform, such as position and momentum or, in the case of Gabor analysis, time and frequency. For more details on phase space methods and symplectic geometry we refer to the textbooks of Folland [24] and de Gosson [26, 27].
For two points and in phase space, the symplectic form is given by
[TABLE]
where denotes the standard Euclidean inner product of two vectors in . A matrix is symplectic if and only if
[TABLE]
We note that and, hence, for all . The group of all symplectic matrices is denoted by and is a proper subgroup of , except for the case , where we have .
The classical version of Poisson’s summation formula for lattices in is
[TABLE]
The dual of the lattice is given by , . The details when this formula holds pointwise have been worked out in [30].
However, we want to work in phase space which is always even dimensional. For a lattice we can replace the dual lattice by the adjoint lattice , the Fourier transform by the symplectic Fourier transform and the Euclidean inner product in the exponent is replaced by the symplectic form. The symplectic version of Poisson’s summation formula is given by (see also [12] as well as [19])
[TABLE]
where is the symplectic Fourier transform of a function of variables, given by
[TABLE]
We call a lattice symplectic if its generating matrix is a multiple of a symplectic matrix. From the definition of a symplectic matrix, it follows that in this case , as by definition for and . We note that any 2-dimensional lattice is symplectic.
Also, using the symplectic Fourier transform has the advantage that all -dimensional, normalized Gaussians are eigenfunctions of the symplectic Fourier transform with eigenvalue 1 [12]. Hence, for 2-dimensional Gaussians and 2-dimensional lattices all formulas become particularly nice.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Albert Baernstein II. Landau’s constant, and extremal problems involving discrete subsets of ℂ ℂ \mathbb{C} . In Viktor P. Havin and Nikolai K. Nikolski, editors, Linear and Complex Analyis Problem Book 3, Part 2 , number 1574 in Lecture Notes in Mathematics, chapter 18, pages 404–407. Springer, 1994.
- 2[2] Albert Baernstein II. A minimum problem for heat kernels of flat tori. In Extremal Riemann surfaces (San Francisco, CA, 1995) , volume 201 of Contemporary Mathematics , pages 227–243. American Mathematical Society, Providence, RI, 1997.
- 3[3] Albert Baernstein II and Jade P. Vinson. Local Minimality Results Related to the Bloch and Landau Constants. In Peter Duren, Juha Heinonen, Brad Osgood, and Bruce Palka, editors, Quasiconformal Mappings and Analysis: A Collection of Papers Honoring F.W. Gehring , pages 55–89. Springer, New York, NY, 1998.
- 4[4] Roswitha Bammer, Monika Dörfler, and Pavol Harar. Gabor frames and deep scattering networks in audio processing. Axioms , 8(4):106, 2019.
- 5[5] Valentine Bargmann, Paolo Butera, Luciano Girardello, and John Klauder. On the completeness of the coherent states. Reports on Mathematical Physics , 2(4):221–228, 1971.
- 6[6] Jonathan M. Borwein and Peter B. Borwein. Pi and the AGM . Wiley, New York, 1987.
- 7[7] Ole Christensen. An Introduction to Frames and Riesz Bases . Applied and Numerical Harmonic Analysis. Birkhäuser, 2. edition, 2016.
- 8[8] Henry Cohn, Abhinav Kumar, Stephen D. Miller, Danylo Radchenko, and Maryna S. Viazovska. Universal optimality of E 8 subscript 𝐸 8 E_{8} and Leech lattices and interpolation formulas. ar Xiv preprint , ar Xiv:1902.05438, 2019.
