✦ LIBER ✦

From Problems to Structures: the Cousin Problems and the Emergence of the Sheaf Concept

✍ Scribed by Renaud Chorlay

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 822 KB
Volume: 64
Category: Article
ISSN: 0003-9519
DOI: 10.1007/s00407-009-0052-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Several epistemological problems related

Several epistemological problems related to the concept of systems

✍ Yi Lin; Yonghao Ma; Rick Port 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 678 KB

The concept of degree of coherence and i

The concept of degree of coherence and its application to optical problems

✍ F. Zernike 📂 Article 📅 1938 🏛 Elsevier Science ⚖ 447 KB

The maximum visibility of the interferences obtainable from two points in a wave field is defined as their degree o/ coherence y. By a simple statistical method general formulae are found for deducing y from illumination 'data. For any extended lightsource y is found equal to the amplitude in a cert

Letters from William Burnside to Robert

Letters from William Burnside to Robert Fricke: automorphic functions, and the emergence of the Burnside Problem

✍ Clemens Adelmann; Eberhard H. -A. Gerbracht 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 219 KB

Trades and problems in the definition of

Trades and problems in the definition of the Columbus operation concept

✍ Giuseppe Giampalmo; Jochen Graf 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Irreducible Complexity and The Problem o

Irreducible Complexity and The Problem of Biochemical Emergence

✍ Weber, Bruce 📂 Fiction 📅 0 🌐 English ⚖ 52 KB

Digraph extremal problems, hypergraph ex

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

✍ W.G Brown; M Simonovits 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o