15 research outputs found

    Nearest Neighbor Distances on a Circle: Multidimensional Case

    Full text link
    We study the distances, called spacings, between pairs of neighboring energy levels for the quantum harmonic oscillator. Specifically, we consider all energy levels falling between E and E+1, and study how the spacings between these levels change for various choices of E, particularly when E goes to infinity. Primarily, we study the case in which the spring constant is a badly approximable vector. We first give the proof by Boshernitzan-Dyson that the number of distinct spacings has a uniform bound independent of E. Then, if the spring constant has components forming a basis of an algebraic number field, we show that, when normalized up to a unit, the spacings are from a finite set. Moreover, in the specific case that the field has one fundamental unit, the probability distribution of these spacings behaves quasiperiodically in log E. We conclude by studying the spacings in the case that the spring constant is not badly approximable, providing examples for which the number of distinct spacings is unbounded.Comment: Version 2 is updated to include more discussion of previous works. 17 pages with five figures. To appear in the Journal of Statistical Physic

    Finite linear spaces and projective planes

    Get PDF
    In 1948, De Bruijn and Erd枚s proved that a finite linear space on v points has at least v lines, with equality occurring if and only if the space is either a near-pencil (all points but one collinear) or a projective plane. In this paper, we study finite linear spaces which are not near-pencils. We obtain a lower bound for the number of lines (as a function of the number of points) for such linear spaces. A finite linear space which meets this bound can be obtained provided a suitable projective plane exists. We then investigate the converse: can a finite linear space meeting the bound be embedded in a projective plane

    On some applications of graph theory, I

    No full text

    A covering problem

    No full text

    Remembering Paul Erd枚s

    No full text
    No abstract
    corecore