Minkowski's theorem for random lattices (Q375972): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Logarithm laws for unipotent flows. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Lattice Points in a Set / rank
 
Normal rank

Latest revision as of 23:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Minkowski's theorem for random lattices
scientific article

    Statements

    Minkowski's theorem for random lattices (English)
    0 references
    1 November 2013
    0 references
    This is the author's lecture on the occasion of being awarded the International Dobrushin Prize for 2011. The prize was presented on July 25, 2011, at the International Mathematical Conference in honor of the 50th anniversary of the Kharkevich Institute for Information Transmission Problems of the Russian Academy of Sciences. The author starts with a short memory of his teacher R. L. Dobrushin [1929 -- 1995]. Then he reviews joint work with \textit{J. S. Athreya} [J. Mod. Dyn. 3, No. 3, 359--378 (2009; Zbl 1184.37007)]. Here he gives a. o. the proof of Theorem 2.2 (loc. cit.) in the case \(n\geq 3\).
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references