In the first Lecture, we saw that lattices can be viewed equivalently in two different ways, i.e. as discrete additive subgroup of R n or as an additive subgroup of R n with linearly independent generators. In this section, we show a final equivalent viewpoint which relates the discreteness of a lattice to the existence of an appropriate dual.

Let Ω ⊆ R be a non-empty open set for which the Sobolev embedding H 0 (Ω) −→ L(Ω) is compact, and let V ∈ L∞(Ω) be a potential taking only positive real values and satisfying the asymptotics V (·) 〈·〉 for some α ∈ ]3,∞[. We establish the discreteness of the set of real transmission eigenvalues for both Schrödinger and Helmholtz scattering with these potentials.

We present an algorithm which allows a fast numerical computation of Feldman-Cousins confidence intervals for Poisson processes, even when the number of background events is relatively large. This algorithm incorporates an appropriate treatment of the singularities that arise as a consequence of the discreteness of the variable.

We provide an extension of Fill's (1998) exact sampler algorithm. Our algorithm is similar to Fill's, however it makes no assumptions regarding stochastic monotonicity, discreteness of the state space, the existence of densities, etc. We illustrate our algorithm on a simple example.

Let T be the differential field of transseries. We establish some basic properties of the dimension of a definable subset of Tn, also in relation to its codimension in the ambient space Tn. The case of dimension 0 is of special interest, and can be characterized both in topological terms (discreteness) and in terms of the Herwig-Hrushovski-Macpherson notion of co-analyzability.

The opposed concepts of continuity and discreteness have figured prominently in the development of mathematics, and have also commanded the attention of philosophers. Continuous entities may be characterized by the fact that they can be divided indefinitely without altering their essential nature. So, for instance, the water in a bucket may be indefinitely halved and yet remain water. (For the ...

We present a novel hypothesis concerning the nature and development of working memory representations and some initial computational investigations of this hypothesis. Working memory refers to the active maintenance of information in the service of complex cognition, such as language comprehension, spatial thinking, and problem solving (Miyake & Shah, 1999). We propose that the unique demands p...