Metraipolis › archive › dc_e00431eabcbe

Arne Beurling — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Arne_Beurling
License (as archived): CC-BY-SA-4.0
Archived: 2026-11-09T23:12:46.926Z
SHA-256 of the archived text: 6f1757104fb82a9c23e6de569e9a6996d506fb7f1cea49653e3005e4466028ea
Stable URL of this page: https://metraipolis.com/documento/dc_e00431eabcbe

How to cite

Arne Beurling — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Arne_Beurling (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e00431eabcbe (Metraipolis archive dc_e00431eabcbe, sha256 6f1757104fb82a9c23e6de569e9a6996d506fb7f1cea49653e3005e4466028ea)

BibTeX

@misc{dce00431eabcbe,
  title = {Arne Beurling — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Arne_Beurling},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e00431eabcbe; sha256 6f1757104fb82a9c23e6de569e9a6996d506fb7f1cea49653e3005e4466028ea},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Arne_Beurling. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Arne Carl-August Beurling (3 February 1905 – 20 November 1986) was a Swedish mathematician and professor of mathematics at Uppsala University (1937–1954) and later at the Institute for Advanced Study in Princeton, New Jersey. Beurling worked extensively in harmonic analysis, complex analysis and potential theory. The "Beurling factorization" helped mathematical scientists to understand the Wold decomposition, and inspired further work on the invariant subspaces of linear operators and operator algebras, e.g. Håkan Hedenmalm's factorization theorem for Bergman spaces. He is perhaps most famous for single-handedly decrypting an early version of the German cipher machine Siemens and Halske T52 in a matter of two weeks during 1940, using only pen and paper. This machine's cipher is generally considered to be more complicated than that of the more famous Enigma machine. Beurling's method of decrypting military telegrams between Norway and Germany worked from June 1940 right up until 1943 when the Germans changed equipment.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Arne Beurling» — https://en.wikipedia.org/wiki/Arne_Beurling
Wikidata Q692166: «matematico svedese» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q692166
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Arne_Beurling?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1372215929, consultata il 2026-11-09T23:09:45.926Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c4b183f610112ca11f33ca3e0a459578364739093b1bf355ad81d9dc38246be2