Zariski-Van Kampen Method
|
|
- Ruth Heintze
- vor 5 Jahren
- Abrufe
Transkript
1 Zariski-Van Kampen Method Purpose: Obtain a presentation for the fundamental group of the complement of a plane projective curve in P 2. We will put together several ingredients, among which, the Van Kampen Theorem is key.
2 Let π : X M be a locally trivial fibration with section s : M X. Consider p M and x 0 F p.
3 Let π : X M be a locally trivial fibration with section s : M X. Consider p M and x 0 F p. Theorem π 1 (X, x 0 ) = π 1 (F p, x 0 ) π 1 (M, p), where the action of π 1 (M, p) on π 1 (F p, x 0 ) is given by the monodromy of π.
4 Let π : X M be a locally trivial fibration with section s : M X. Consider p M and x 0 F p. Theorem π 1 (X, x 0 ) = π 1 (F p, x 0 ) π 1 (M, p), where the action of π 1 (M, p) on π 1 (F p, x 0 ) is given by the monodromy of π. Proposition Meridians around the same irreducible components of B are conjugate in π 1 (M \ B). Moreover, the conjugacy class of a meridian coincides with the set of homotopy classes of meridians around the same irreducible component.
5 Let π : X M be a locally trivial fibration with section s : M X. Consider p M and x 0 F p. Theorem π 1 (X, x 0 ) = π 1 (F p, x 0 ) π 1 (M, p), where the action of π 1 (M, p) on π 1 (F p, x 0 ) is given by the monodromy of π. Proposition Meridians around the same irreducible components of B are conjugate in π 1 (M \ B). Moreover, the conjugacy class of a meridian coincides with the set of homotopy classes of meridians around the same irreducible component. Proposition The inclusion M \ B M induces a surjective morphism, whose kernel is given by the smallest normal subgroup of π 1 (M \ B) containing meridians of all the irreducible components of B.
6 Zariski-Van Kampen Theorem Let C P 2 be a projective plane curve. Consider P = [0 : 1 : 0] P 2 \ C.
7 Zariski-Van Kampen Theorem Let C P 2 be a projective plane curve. Consider P = [0 : 1 : 0] P 2 \ C.
8 Zariski-Van Kampen Theorem Let C P 2 be a projective plane curve. Consider P = [0 : 1 : 0] P 2 \ C. Project π : P 2 \ {P} P 1 from P
9 Zariski-Van Kampen Theorem Let C P 2 be a projective plane curve. Consider P = [0 : 1 : 0] P 2 \ C. Project π : P 2 \ {P} P 1 from P z n z n 1 z 2 z 1
10 Zariski-Van Kampen Theorem Let C P 2 be a projective plane curve. Consider P = [0 : 1 : 0] P 2 \ C. Project π : P 2 \ {P} P 1 from P L n L n 1 L 2 L 1 z n z n 1 z 2 z 1
11 Zariski-Van Kampen Theorem L n L n 1 L 2 L 1 z n z n 1 z 2 z 1 Remark (1) Let X = P 2 \ (C L), then π X : X P 1 \ Z n is a locally trivial fibration.
12 Zariski-Van Kampen Theorem L n L n 1 L 2 L 1 L 0 z n z n 1 z 2 z 1 z 0 Remark (1) Let X = P 2 \ (C L), then π X : X P 1 \ Z n is a locally trivial fibration. Moreover, its fiber is P 1 \ Z d, where d := deg C.
13 Zariski-Van Kampen Theorem xx xxxx xxxxxx xxxxxxx xxxxxxxxx xxxxxxxxxxx xxxxxxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxxxxxxx xxxxxxxxxxxx xxxxxxxxxxx xxxxxxxxxx xxxxxxxxx xxxxxxxxx xxxxxxx xxxxxx xxxxx xxxx xxx xx x Remark (2) By (2.1), π 1 (X, x 0 ) = π 1 (F z0, x 0 ) π 1 (P 1 \ Z n, z 0 ). Action is given by the monodromy of π 1 (P 1 \ Z n, z 0 ) on π 1 (F z0, x 0 ).
14 Zariski-Van Kampen Theorem x 0 xx xxxx xxxxxx xxxxxxx xxxxxxxxx xxxxxxxxxxx xxxxxxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxx g xxxxxxxx xxxxxxxxx 1 xxxxxxxx xxxxxxxx g xxxxxxxxx xxxxxxxx 2 xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx. xxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxxxxxxx xxxxxxxx g xxxxx xxxxxxxxxxx xxxxxxxx d xxx xxxxxxxxx xxxxxxxxx xxxxxxx xxxxxx xxxxx xxxx xxx xx x γ n γ n 1 γ 2 γ 1 z 0 Remark (3) Note that π 1 (F z0, x 0 ) = g 1,..., g d : g d g d 1 g 1 = 1 and π 1 (P 1 \ Z n, z 0 ) = γ 1,..., γ n : γ n γ 1 = 1.
15 Zariski-Van Kampen Theorem x 0 xx xxxx xxxxxx xxxxxxx xxxxxxxxx xxxxxxxxxxx xxxxxxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxx g xxxxxxxx xxxxxxxxx 1 xxxxxxxx xxxxxxxx g xxxxxxxxx xxxxxxxx 2 xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx. xxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxxxxxxx xxxxxxxx g xxxxx xxxxxxxxxxx xxxxxxxx d xxx xxxxxxxxx xxxxxxxxx xxxxxxx xxxxxx xxxxx xxxx xxx xx x γ n γ n 1 γ 2 γ 1 z 0 Theorem π 1 (X, x 0 ) admits the following presentation: g 1,..., g d, γ 1,..., γ n : g d g d 1 g 1 = γ n γ 1 = 1, g γ j i = γ 1 j g i γ j
16 Zariski-Van Kampen Theorem x 0 xx xxxx xxxxxx xxxxxxx xxxxxxxxx xxxxxxxxxxx xxxxxxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxx g xxxxxxxx xxxxxxxxx 1 xxxxxxxx xxxxxxxx g xxxxxxxxx xxxxxxxx 2 xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx xxxxxxxxx xxxxxxxx. xxxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxxxxxxxx xxxxxxxx g xxxxx xxxxxxxxxxx xxxxxxxx d xxx xxxxxxxxx xxxxxxxxx xxxxxxx xxxxxx xxxxx xxxx xxx xx x γ n γ n 1 γ 2 γ 1 z 0 Theorem π 1 (P 2 \ C) admits the following presentation: g 1,..., g d : g d g d 1 g 1 = 1, g γ j i = g i
17 Remark Let C = C 1... C r the decomposition of C in its irreducible components, then H 1 (P 2 \ C) = Z r 1 Z/(d 1,..., d r), where d i := deg C.
18 Remark Let C = C 1... C r the decomposition of C in its irreducible components, then where d i := deg C. H 1 (P 2 \ C) = Z r 1 Z/(d 1,..., d r), It two curves are in a connected family of equisingular curves, then they are isotopic
19 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ.
20 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. For computation purposes it is more convenient to use a non-generic projection.
21 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. For computation purposes it is more convenient to use a non-generic projection. Use for instance C := {F = 0}, where F(X, Y, Z) = X d + Y d Z d. P = [0 : 1 : 0] / C and F Y = dy d 1.
22 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. For computation purposes it is more convenient to use a non-generic projection. Use for instance C := {F = 0}, where F(X, Y, Z) = X d + Y d Z d. P = [0 : 1 : 0] / C and F Y = dy d 1. Let us compute the local monodromy of x = y d. Consider γ(t) = e 2πt 1 a loop around x = 0. The fiber at γ(t) is given by: ξ i d
23 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. The monodromy around x = 0 looks as follows:
24 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. Corresponds to the braid σ 1 σ 2 σ d 1
25 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. Note that the global part of the monodromy has no contribution:
26 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. Applying the Zariski-Van Kampen Theorem to these generators:
27 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. Applying the Zariski-Van Kampen Theorem to these generators: One obtains: g i = g (σ 1σ 2 σ d 1 ) i = ( g d i = 1 g 1 d g i 1 g d i 1
28 Zariski-Van Kampen Theorem C smooth of degree d π 1 (P 2 \ C) = Z/dZ. Applying the Zariski-Van Kampen Theorem to these generators: One obtains: ( g i = g (σ 1σ 2 σ d 1 ) g i = d i = 1 g 1 d g i 1 g d i 1 hence g 2 = g 1 d g 1 g d = g 1, and by induction g 1 =... = g d = g. Finally, g 1 g d = 1 becomes g d = 1 π 1 (P 2 \ C) = g : g d = 1 = Z/dZ.
29 (Zariski-Harris, Cheniot) C nodal π 1 (C) is abelian.
30 (Zariski-Harris, Cheniot) C nodal π 1 (C) is abelian. C 1 and C 2 intersect transversally π 1 (C) = π 1 (C 1 ) π 1 (C 2 )
31 (Zariski-Harris, Cheniot) C nodal π 1 (C) is abelian. C 1 and C 2 intersect transversally π 1 (C) = π 1 (C 1 ) π 1 (C 2 ) Remark (Harris) The space of irreducible nodal curves with given number of nodes is connected
32 (Zariski-Harris, Cheniot) C nodal π 1 (C) is abelian. C 1 and C 2 intersect transversally π 1 (C) = π 1 (C 1 ) π 1 (C 2 ) Remark (Harris) The space of irreducible nodal curves with given number of nodes is connected (Zariski) Let C be a general nodal rational curve of degree d. Consider C its dual. Note that C is a rational curve of degree 2(d 1), 2(d 2)(d 3) nodes, and 3(d 2) cusps. The fundamental group of C coincides with the fundamental group of the unordered configuration space of d points in S 2, that is, B d (S 2 ) = g 1,..., g d 1 : g i g j = g j g i, g i g i+1 g i = g i+1 g i g i+1, g 1 g d 2 g 2 d 1 g d 2 g 1 = 1.
33 Non-Generic Projections P C that is, existence of asymptotes.
34 Non-Generic Projections P C that is, existence of asymptotes. Very special fibers.
35 Local Braid Monodromy Can be obtained from the Puiseux Series (local parametrization) of the curve around a singular point.
36 Local Braid Monodromy Can be obtained from the Puiseux Series (local parametrization) of the curve around a singular point. Computational methods are generically effective.
37 Global Braid Monodromy Most difficult part of monodromy computations.
38 Global Braid Monodromy Most difficult part of monodromy computations. Real arrangements, real curves.
39 Global Braid Monodromy Most difficult part of monodromy computations. Real arrangements, real curves. Computational methods are effective essentially over Z[ 1].
40 Consider the following quartic:
41 Consider the following quartic and project from [0 : 1 : 0]
42 Compute the braid monodromy:
43 Compute the braid monodromy: σ 8 1,
44 Compute the braid monodromy: σ 8 1, σ 2,
45 Compute the braid monodromy: σ 8 1, σ 2, σ 1 3 σ 1 1 σ 2σ 1 σ 3.
46 Compute the braid monodromy: σ 8 1, σ 2, σ 1 3 σ 1 1 σ 2σ 1 σ 3.
47 σ 8 1 :
48 σ 8 1 : g σ8 1 1 = (g 2 g 1 ) 4 g 1 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 1 ] = 1
49 σ 8 1 : g σ8 1 1 = (g 2 g 1 ) 4 g 1 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 1 ] = 1 g σ8 1 2 = (g 2 g 1 ) 4 g 2 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 2 ] = 1
50 σ 8 1 : g σ8 1 1 = (g 2 g 1 ) 4 g 1 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 1 ] = 1 g σ8 1 2 = (g 2 g 1 ) 4 g 2 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 2 ] = 1 g σ8 1 3 = g 3
51 σ 8 1 : g σ8 1 1 = (g 2 g 1 ) 4 g 1 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 1 ] = 1 g σ8 1 2 = (g 2 g 1 ) 4 g 2 (g 2 g 1 ) 4 [(g 2 g 1 ) 4, g 2 ] = 1 g σ8 1 3 = g 3 g σ8 1 4 = g 4
52 σ 2 :
53 σ 2 : g σ 2 1 = g 1
54 σ 2 : g σ 2 1 = g 1 g σ 2 2 = g 3 g 2 = g 3
55 σ 2 : g σ 2 1 = g 1 g σ 2 2 = g 3 g 2 = g 3 g σ 2 3 = g 3 g 2 g 1 3 g 2 = g 3
56 σ 2 : g σ 2 1 = g 1 g σ 2 2 = g 3 g 2 = g 3 g σ 2 3 = g 3 g 2 g 1 3 g 2 = g 3 g σ 2 4 = g 4
57 σ 1 3 σ 1 1 σ 2σ 1 σ 3 :
58 σ 1 3 σ 1 1 σ 2σ 1 σ 3 : g σ 1 σ 1 σ σ 1 σ 3 1 = g 1 2 g 4 g 2 g 4 = g 2 g 1 g 1 2
59 σ 1 3 σ 1 1 σ 2σ 1 σ 3 : g σ 1 σ 1 σ σ 1 σ 3 1 = g 1 2 g 4 g 2 g 4 = g 2 g 1 g 1 2 g σ 1 σ 1 σ σ 1 σ 3 2 = g 2
60 σ 1 3 σ 1 1 σ 2σ 1 σ 3 : g σ 1 σ 1 σ σ 1 σ 3 1 = g 1 2 g 4 g 2 g 4 = g 2 g 1 g 1 2 g σ 1 σ 1 σ σ 1 σ 3 2 = g 2 g σ 1 σ 1 σ σ 1 σ 3 3 = g 3
61 σ 1 3 σ 1 1 σ 2σ 1 σ 3 : g σ 1 σ 1 σ σ 1 σ 3 1 = g 1 2 g 4 g 2 g 4 = g 2 g 1 g 1 2 g σ 1 σ 1 σ σ 1 σ 3 2 = g 2 g σ 1 σ 1 σ σ 1 σ 3 3 = g 3 g σ 1 σ 1 σ σ 1 σ 3 4 = g 4 g 2 g 1 g 1 2 g 1 4 g 4 = g 2 g 1 g 1 2
Unit 4. The Extension Principle. Fuzzy Logic I 123
Unit 4 The Extension Principle Fuzzy Logic I 123 Images and Preimages of Functions Let f : X Y be a function and A be a subset of X. Then the image of A w.r.t. f is defined as follows: f(a) = {y Y there
MehrZum Relativgrad zeitvarianter Systeme
Elgersburg, 16. Februar 2006 Relative degree for linear time-invariant systems Definition n(s) d(s) = c(si n A) 1 b = cb s 1 + cab s 2 +... + ca r 2 b s r 1 + ca r 1 b s r +... : has relative degree r
MehrOn Euler s attempt to compute logarithms by interpolation
Euler p. 1/1 On Euler s attempt to compute logarithms by interpolation Walter Gautschi wxg@cs.purdue.edu Purdue University Leonhard Euler 1707 1783 Euler p. 2/1 Euler p. 3/1 From Euler s letter to Daniel
MehrJosh Engwer (TTU) Line Integrals 11 November / 25
Line Integrals alculus III Josh Engwer TTU 11 November 2014 Josh Engwer (TTU) Line Integrals 11 November 2014 1 / 25 PART I PART I: LINE INTEGRALS OF SALAR FIELDS Josh Engwer (TTU) Line Integrals 11 November
MehrDEFORMATION AND DUALITY FROM THE SYMPLECTIC POINT OF VIEW
DISS. ETH NO. 19871 DEFORMATION AND DUALITY FROM THE SYMPLECTIC POINT OF VIEW A dissertation submitted to ETH ZÜRICH for the degree of Doctor of Sciences presented by Yochay Jerby M.Sc. Math, Tel Aviv
Mehraus Doktorarbeiten Anna Lena Birkmeyer Oktober 2016
aus Doktorarbeiten Anna Lena Birkmeyer Fachbereich Mathematik TU Kaiserslautern Oktober 2016 In der der Arbeit: The mathematical modeling and optimization of... is a wide field of research [4,15,19,35,61,62,66,76,86]
MehrFEM Isoparametric Concept
FEM Isoparametric Concept home/lehre/vl-mhs--e/folien/vorlesung/4_fem_isopara/cover_sheet.tex page of 25. p./25 Table of contents. Interpolation Functions for the Finite Elements 2. Finite Element Types
MehrNumber of Maximal Partial Clones
Number of Maximal Partial Clones KARSTEN SCHÖLZEL Universität Rostoc, Institut für Mathemati 26th May 2010 c 2010 UNIVERSITÄT ROSTOCK MATHEMATISCH-NATURWISSENSCHAFTLICHE FAKULTÄT, INSTITUT FÜR MATHEMATIK
MehrGeometrie und Bedeutung: Kap 5
: Kap 5 21. November 2011 Übersicht Der Begriff des Vektors Ähnlichkeits Distanzfunktionen für Vektoren Skalarprodukt Eukidische Distanz im R n What are vectors I Domininic: Maryl: Dollar Po Euro Yen 6
MehrSeeking for n! Derivatives
Seeking for n! Derivatives $,000$ Reward A remarkable determinant (,0) (,) (0,0) (0,) (,0) (,0) (,) (,) (0,0) (0,) (0,) General definition Δ μ (X, Y ) = det x p i j yq i n j i,j= As a starter... n! dim
MehrUnit 1. Motivation and Basics of Classical Logic. Fuzzy Logic I 6
Unit 1 Motivation and Basics of Classical Logic Fuzzy Logic I 6 Motivation In our everyday life, we use vague, qualitative, imprecise linguistic terms like small, hot, around two o clock Even very complex
MehrBayesian Networks. Syntax Semantics Parametrized Distributions Inference in Bayesian Networks. Exact Inference. Approximate Inference
Syntax Semantics Parametrized Distributions Inference in Exact Inference Approximate Inference enumeration variable elimination stochastic simulation Markov Chain Monte Carlo (MCMC) 1 Includes many slides
MehrFEM Isoparametric Concept
FEM Isoparametric Concept home/lehre/vl-mhs--e/cover_sheet.tex. p./26 Table of contents. Interpolation Functions for the Finite Elements 2. Finite Element Types 3. Geometry 4. Interpolation Approach Function
MehrFinite Difference Method (FDM)
Finite Difference Method (FDM) home/lehre/vl-mhs-1-e/folien/vorlesung/2a_fdm/cover_sheet.tex page 1 of 15. p.1/15 Table of contents 1. Problem 2. Governing Equation 3. Finite Difference-Approximation 4.
MehrAlgebra. 1. Geben Sie alle abelschen Gruppen mit 8 und 12 Elementen an. (Ohne Nachweis).
1 Wiederholungsblatt zur Gruppentheorie 18.12.2002 Wiederholen Sie für die Klausur: Algebra WS 2002/03 Dr. Elsholtz Alle Hausaufgaben. Aufgaben, die vor Wochen schwer waren, sind hoffentlich mit Abstand,
MehrTopologies on the set of Banach space representations
Research Collection Doctoral Thesis Topologies on the set of Banach space representations Author(s): Koller, Michael Dominik Fabian Publication Date: 1993 Permanent Link: https://doi.org/10.3929/ethz-a-000888466
MehrIntroduction FEM, 1D-Example
Introduction FEM, D-Example /home/lehre/vl-mhs-/inhalt/cover_sheet.tex. p./22 Table of contents D Example - Finite Element Method. D Setup Geometry 2. Governing equation 3. General Derivation of Finite
MehrMagic Figures. We note that in the example magic square the numbers 1 9 are used. All three rows (columns) have equal sum, called the magic number.
Magic Figures Introduction: This lesson builds on ideas from Magic Squares. Students are introduced to a wider collection of Magic Figures and consider constraints on the Magic Number associated with such
MehrWillkommen zur Vorlesung Komplexitätstheorie
Willkommen zur Vorlesung Komplexitätstheorie WS 2011/2012 Friedhelm Meyer auf der Heide V12, 23.1.2012 1 Organisatorisches CHE-Studierendenbefragung ist bis zum 31.1. verlängert. Falls sie angefragt wurden:
MehrTeil 2.2: Lernen formaler Sprachen: Hypothesenräume
Theorie des Algorithmischen Lernens Sommersemester 2006 Teil 2.2: Lernen formaler Sprachen: Hypothesenräume Version 1.1 Gliederung der LV Teil 1: Motivation 1. Was ist Lernen 2. Das Szenario der Induktiven
MehrIntroduction FEM, 1D-Example
Introduction FEM, 1D-Example home/lehre/vl-mhs-1-e/folien/vorlesung/3_fem_intro/cover_sheet.tex page 1 of 25. p.1/25 Table of contents 1D Example - Finite Element Method 1. 1D Setup Geometry 2. Governing
MehrComputational Models
- University of Applied Sciences - Computational Models - CSCI 331 - Friedhelm Seutter Institut für Angewandte Informatik Part I Automata and Languages 0. Introduction, Alphabets, Strings, and Languages
MehrWie man heute die Liebe fürs Leben findet
Wie man heute die Liebe fürs Leben findet Sherrie Schneider Ellen Fein Click here if your download doesn"t start automatically Wie man heute die Liebe fürs Leben findet Sherrie Schneider Ellen Fein Wie
MehrDie Fermatsche Vermutung
Die Fermatsche Vermutung Ulrich Görtz http://www.math.uni-bonn.de/people/ugoertz/ 3. Juli 2008 Die natürlichen Zahlen: 1, 2, 3,... Die natürlichen Zahlen: 1, 2, 3,... n-te Potenzen: x 2 = x x, x 3 = x
MehrDun & Bradstreet Compact Report
Dun & Bradstreet Compact Report Identification & Summary (C) 20XX D&B COPYRIGHT 20XX DUN & BRADSTREET INC. - PROVIDED UNDER CONTRACT FOR THE EXCLUSIVE USE OF SUBSCRIBER 86XXXXXX1. ATTN: Example LTD Identification
MehrWhere are we now? The administration building M 3. Voransicht
Let me show you around 9 von 26 Where are we now? The administration building M 3 12 von 26 Let me show you around Presenting your company 2 I M 5 Prepositions of place and movement There are many prepositions
MehrStochastic Processes SS 2010 Prof. Anton Wakolbinger. Klausur am 16. Juli 2010
Stochastic Processes SS 2010 Prof. Anton Wakolbinger Klausur am 16. Juli 2010 Vor- und Nachname: Matrikelnummer: Studiengang: Tutor(in): In der Klausur können 100 Punkte erreicht werden. Die Gesamtpunktezahl
MehrSlide 3: How to translate must not and needn t with two sentences to illustrate this.
Teaching notes This resource is designed to revise the use of modal verbs in the present tense and includes a starter card sort, PowerPoint presentation and Word worksheet. Suggested starter activities
MehrData Structures and Algorithm Design
- University of Applied Sciences - Data Structures and Algorithm Design - CSCI 340 - Friedhelm Seutter Institut für Angewandte Informatik Contents 1 Analyzing Algorithms and Problems 2 Data Abstraction
MehrProgramm für das Seminar. Algebraische Kurven. Sommersemester 2009
Programm für das Seminar Algebraische Kurven Sommersemester 2009 In diesem Seminar sollen parallel zur Vorlesung Algebraische Geometrie II die Grundlagen der Theorie der algebraischen Kurven erarbeitet
MehrWillkommen zur Vorlesung Komplexitätstheorie
Willkommen zur Vorlesung Komplexitätstheorie WS 2011/2012 Friedhelm Meyer auf der Heide V11, 16.1.2012 1 Themen 1. Turingmaschinen Formalisierung der Begriffe berechenbar, entscheidbar, rekursiv aufzählbar
MehrHarry gefangen in der Zeit Begleitmaterialien
Episode 011 Grammar 1. Plural forms of nouns Most nouns can be either singular or plural. The plural indicates that you're talking about several units of the same thing. Ist das Bett zu hart? Sind die
MehrLevel 1 German, 2014
90886 908860 1SUPERVISOR S Level 1 German, 2014 90886 Demonstrate understanding of a variety of German texts on areas of most immediate relevance 9.30 am Wednesday 26 November 2014 Credits: Five Achievement
MehrInterpolation Functions for the Finite Elements
Interpolation Functions for the Finite Elements For the finite elements method, the following is valid: The global function of a sought function consists of a sum of local functions: GALERKIN method: the
MehrLevel 2 German, 2015
91126 911260 2SUPERVISOR S Level 2 German, 2015 91126 Demonstrate understanding of a variety of written and / or visual German text(s) on familiar matters 2.00 p.m. Friday 4 December 2015 Credits: Five
MehrOn the cohomology of finite groups with simple coefficients
Research Collection Doctoral Thesis On the cohomology of finite groups with simple coefficients Author(s): Stricker, Markus Andreas Publication Date: 1989 Permanent Link: https://doi.org/10.3929/ethz-a-000518488
MehrA Classification of Partial Boolean Clones
A Classification of Partial Boolean Clones DIETLINDE LAU, KARSTEN SCHÖLZEL Universität Rostock, Institut für Mathematik 25th May 2010 c 2010 UNIVERSITÄT ROSTOCK MATHEMATISCH-NATURWISSENSCHAFTLICHE FAKULTÄT,
Mehrp^db=`oj===pìééçêíáåñçêã~íáçå=
p^db=`oj===pìééçêíáåñçêã~íáçå= Error: "Could not connect to the SQL Server Instance" or "Failed to open a connection to the database." When you attempt to launch ACT! by Sage or ACT by Sage Premium for
MehrEinführung in die Computerlinguistik reguläre Sprachen und endliche Automaten
Einführung in die Computerlinguistik reguläre Sprachen und endliche Automaten Dozentin: Wiebke Petersen Foliensatz 3 Wiebke Petersen Einführung CL 1 Describing formal languages by enumerating all words
MehrInteger Convex Minimization in Low Dimensions
DISS. ETH NO. 22288 Integer Convex Minimization in Low Dimensions A thesis submitted to attain the degree of DOCTOR OF SCIENCES of ETH ZURICH (Dr. sc. ETH Zurich) presented by TIMM OERTEL Diplom-Mathematiker,
MehrEinführung in die Finite Element Methode Projekt 2
Einführung in die Finite Element Methode Projekt 2 Juri Schmelzer und Fred Brockstedt 17.7.2014 Juri Schmelzer und Fred Brockstedt Einführung in die Finite Element Methode Projekt 2 17.7.2014 1 / 29 Project
Mehr4. Übungsblatt Aufgaben mit Lösungen
4. Übungsblatt Aufgaben mit Lösungen Aufgabe 16: (a) Find the orthogonal projection of P = (, 11, 3) onto the line G through the points A = (5, 4, 7) and B = (1, 7, 5). Determine the distance between P
MehrKTdCW Artificial Intelligence 2016/17 Practical Exercises - PART A
KTdCW Artificial Intelligence 2016/17 Practical Exercises - PART A Franz Wotawa Technische Universität Graz, Institute for Software Technology, Inffeldgasse 16b/2, A-8010 Graz, Austria, wotawa@ist.tugraz.at,
MehrAlgorithm Theory 3 Fast Fourier Transformation Christian Schindelhauer
Algorithm Theory 3 Fast Fourier Transformation Institut für Informatik Wintersemester 2007/08 Chapter 3 Fast Fourier Transformation 2 Polynomials Polynomials p over real numbers with a variable x p(x)
MehrFunctional Analysis Final Test, Funktionalanalysis Endklausur,
Spring term 2012 / Sommersemester 2012 Functional Analysis Final Test, 16.07.2012 Funktionalanalysis Endklausur, 16.07.2012 Name:/Name: Matriculation number:/matrikelnr.: Semester:/Fachsemester: Degree
MehrEin Stern in dunkler Nacht Die schoensten Weihnachtsgeschichten. Click here if your download doesn"t start automatically
Ein Stern in dunkler Nacht Die schoensten Weihnachtsgeschichten Click here if your download doesn"t start automatically Ein Stern in dunkler Nacht Die schoensten Weihnachtsgeschichten Ein Stern in dunkler
Mehrp^db=`oj===pìééçêíáåñçêã~íáçå=
p^db=`oj===pìééçêíáåñçêã~íáçå= How to Disable User Account Control (UAC) in Windows Vista You are attempting to install or uninstall ACT! when Windows does not allow you access to needed files or folders.
MehrScheduling. chemistry. math. history. physics. art
Scheduling Consider the following problem: in a university, assign exams to time slots in such a way: ) every student can do the exams of the courses he is taking; ) the total number of used time slots
MehrGeometry Of Algebraic Curves: Volume II With A Contribution By Joseph Daniel Harris (Grundlehren Der Mathematischen Wissenschaften) By Maurizio
Geometry Of Algebraic Curves: Volume II With A Contribution By Joseph Daniel Harris (Grundlehren Der Mathematischen Wissenschaften) By Maurizio Cornalba If you are searching for a ebook Geometry of Algebraic
MehrÜbungen zur Analysis 2
Mathematisches Institut der Universität München Prof. Dr. Franz Merkl Sommersemester 013 Blatt 3 03.04.013 Übungen zur Analysis 3.1 Abstraktion des Beweises der Minkowskiungleichung. Es seien V ein K-Vektorraum
MehrHinweisblatt. Für den Einsatz des MAX! Heizungssteuerungssystems haben Sie zwei Alternativen: Die MAX! Einzelraumlösung und die MAX! Hauslösung.
Hinweisblatt MAX! Heizkörperthermostat BC-RT-TRX-CyG Art.-Nr. 99017 MAX! Fensterkontakt BC-SC-Rd-WM Art.-Nr. 99023 Für den Einsatz des MAX! Heizungssteuerungssystems haben Sie zwei Alternativen: Die MAX!
MehrPONS DIE DREI??? FRAGEZEICHEN, ARCTIC ADVENTURE: ENGLISCH LERNEN MIT JUSTUS, PETER UND BOB
Read Online and Download Ebook PONS DIE DREI??? FRAGEZEICHEN, ARCTIC ADVENTURE: ENGLISCH LERNEN MIT JUSTUS, PETER UND BOB DOWNLOAD EBOOK : PONS DIE DREI??? FRAGEZEICHEN, ARCTIC ADVENTURE: Click link bellow
MehrLevel 1 German, 2012
90886 908860 1SUPERVISOR S Level 1 German, 2012 90886 Demonstrate understanding of a variety of German texts on areas of most immediate relevance 9.30 am Tuesday 13 November 2012 Credits: Five Achievement
MehrSolutions Übungsblatt 12
Futioetheorie, SS 204 Solutios Übugsblatt 2 Aufgabe : Es sei g eie meromorphe Futio auf C mit höchstes eifache Pole. Wir ehme a, dass das Residuum a jedem Pol vo g eie gae Zahl ist. Zeige Sie: a) Es existiert
MehrLevel 1 German, 2016
90886 908860 1SUPERVISOR S Level 1 German, 2016 90886 Demonstrate understanding of a variety of German texts on areas of most immediate relevance 2.00 p.m. Wednesday 23 November 2016 Credits: Five Achievement
MehrRessourcenmanagement in Netzwerken SS06 Vorl. 12,
Ressourcenmanagement in Netzwerken SS06 Vorl. 12, 30.6.06 Friedhelm Meyer auf der Heide Name hinzufügen 1 Prüfungstermine Dienstag, 18.7. Montag, 21. 8. und Freitag, 22.9. Bitte melden sie sich bis zum
MehrAnalysis III Serie 13 Musterlösung
Ana-3 Hs 22 Analysis III Serie 3 Musterlösung Abgabe: Freitag, 2.2.22, Uhr, in der Vorlesung * Aufgabe Welche der folgenden Aussagen sind wahr und welche sind falsch? (Mit Begründung) (i) Sei A R 3 3 eine
Mehrv+s Output Quelle: Schotter, Microeconomics, , S. 412f
The marginal cost function for a capacity-constrained firm At output levels that are lower than the firm s installed capacity of K, the marginal cost is merely the variable marginal cost of v. At higher
Mehrdrawbar eye series 2010
drawbar eye series 2010 directive 94/20/EG / class S DIN 74054-40A / material St52-3 (no. 1.0570) / with bush 40 mm parameters for centre-axle trailer s ṣhaft cross section order no H x B mm length A mm
MehrEwald s Sphere/Problem 3.7
Ewald s Sphere/Problem 3.7 Studentproject/Molecular and Solid-State Physics Lisa Marx 831292 15.1.211, Graz Ewald s Sphere/Problem 3.7 Lisa Marx 831292 Inhaltsverzeichnis 1 General Information 3 1.1 Ewald
MehrStirling numbers of the second kind and Bonferroni s inequalities
Eem. Math. 60 (2005) 124 129 0013-6018/05/030124-6 c Swiss Mathematica Society, 2005 Eemente der Mathematik Stiring numbers of the second kind and Bonferroni s inequaities Horst Wegner Horst Wegner studierte
MehrFakultät III Univ.-Prof. Dr. Jan Franke-Viebach
1 Universität Siegen Fakultät III Univ.-Prof. Dr. Jan Franke-Viebach Klausur Monetäre Außenwirtschaftstheorie und politik / International Macro Wintersemester 2011-12 (2. Prüfungstermin) Bearbeitungszeit:
MehrMusterlösung 3. D-MATH Algebra I HS 2015 Prof. Richard Pink. Faktorielle Ringe, Grösster gemeinsamer Teiler, Ideale, Faktorringe
D-MATH Algebra I HS 2015 Prof. Richard Pink Musterlösung 3 Faktorielle Ringe, Grösster gemeinsamer Teiler, Ideale, Faktorringe 1. Sei K ein Körper. Zeige, dass K[X 2, X 3 ] K[X] ein Integritätsbereich,
MehrL 2 discrepancy of digit scrambled two-dimensional Hammersley point sets
L 2 discrepancy of digit scramled two-dimensional Hammersley point sets Friedrich Pillichshammer 1 Linz/Austria Joint work with Henri Faure (Marseille) Gottlie Pirsic (Linz) Wolfgang Schmid (Salzurg) 1
MehrTopologie. Proposition 0.1 Let M be a countable (abzählbar) set. Then the set of all finite sequences of elements of M is countable.
Topologie Lecture Oct. 15, 2013 Proposition 0.1 Let M be a countable (abzählbar) set. Then the set of all finite sequences of elements of M is countable. Then the power set (Potenz- Proposition 0.2 Let
Mehr3. The proof of Theorem
3. The proof of Theorem Objekttyp: Chapter Zeitschrift: L'Enseignement Mathématique Band (Jahr): 31 (195) Heft 1-2: L'ENSEIGNEMENT MATHÉMATIQUE PDF erstellt am: 19.9.217 Nutzungsbedingungen Die ETH-Bibliothek
MehrEinführung in die Computerlinguistik reguläre Sprachen und endliche Automaten
Einführung in die Computerlinguistik reguläre Sprachen und endliche Automaten Dozentin: Wiebke Petersen 03.11.2009 Wiebke Petersen Einführung CL (WiSe 09/10) 1 Formal language Denition Eine formale Sprache
MehrUnit 6. Fuzzy Inference. Fuzzy Logic I 159
Unit 6 Fuzzy Inference Fuzzy Logic I 159 Motivation Our ultimate goal is to be able to proceed IF-THEN rules involving vague linguistic expressions which are modeled by fuzzy sets. Question: What is still
MehrEVANGELISCHES GESANGBUCH: AUSGABE FUR DIE EVANGELISCH-LUTHERISCHE LANDESKIRCHE SACHSEN. BLAU (GERMAN EDITION) FROM EVANGELISCHE VERLAGSAN
EVANGELISCHES GESANGBUCH: AUSGABE FUR DIE EVANGELISCH-LUTHERISCHE LANDESKIRCHE SACHSEN. BLAU (GERMAN EDITION) FROM EVANGELISCHE VERLAGSAN DOWNLOAD EBOOK : EVANGELISCHES GESANGBUCH: AUSGABE FUR DIE EVANGELISCH-LUTHERISCHE
MehrGeldtheorie und -politik
Geldtheorie und -politik Empirische Evidenz zum Zusammenhang zwischen Geldmenge, Preise und Output Günter W. Beck Universität Siegen 11. April, 2011 Günter W. Beck () Geldtheorie und -politik 11. April,
MehrWillkommen zur Vorlesung Komplexitätstheorie
Willkommen zur Vorlesung Komplexitätstheorie WS 2011/2012 Friedhelm Meyer auf der Heide V13, 30.1.2012 1 Themen 1. Turingmaschinen Formalisierung der Begriffe berechenbar, entscheidbar, rekursiv aufzählbar
MehrEnglisch-Grundwortschatz
Englisch-Grundwortschatz Die 100 am häufigsten verwendeten Wörter also auch so so in in even sogar on an / bei / in like wie / mögen their with but first only and time find you get more its those because
MehrFranke & Bornberg award AachenMünchener private annuity insurance schemes top grades
Franke & Bornberg award private annuity insurance schemes top grades Press Release, December 22, 2009 WUNSCHPOLICE STRATEGIE No. 1 gets best possible grade FFF ( Excellent ) WUNSCHPOLICE conventional annuity
MehrAlgorithms for graph visualization
Algorithms for graph visualization Project - Orthogonal Grid Layout with Small Area W INTER SEMESTER 2013/2014 Martin No llenburg KIT Universita t des Landes Baden-Wu rttemberg und nationales Forschungszentrum
MehrÜbungsblatt 6. Analysis 1, HS14
Übungsblatt 6 Analysis, HS4 Ausgabe Donnerstag, 6. Oktober. Abgabe Donnerstag, 23. Oktober. Bitte Lösungen bis spätestens 7 Uhr in den Briefkasten des jeweiligen Übungsleiters am J- oder K-Geschoss von
MehrD-MATH Algebra I HS 2015 Prof. Richard Pink. Musterlösung 13
D-MATH Algebra I HS 2015 Prof. Richard Pink Musterlösung 13 p-gruppen, Sylowsätze, Kleine endliche Gruppen Sei p eine Primzahl. 1. (a) Zeige, dass jede echte Untergruppe einer endlichen p-gruppe echt in
Mehrder Lehrer die Sportlerin der Sekretär die Ärztin
die Lehrerin der Lehrer die Sportlerin der Sportler die Sekretärin der Sekretär die Ärztin der Ärzt Fussball spielen ein Lied singen Fahrrad fahren im Internet surfen kochen die Gitare spielen tanzen schreiben
MehrLevel 1 German, 2011
90886 908860 1SUPERVISOR S Level 1 German, 2011 90886 Demonstrate understanding of a variety of German texts on areas of most immediate relevance 9.30 am uesday Tuesday 1 November 2011 Credits: Five Achievement
MehrLevel 2 German, 2013
91126 911260 2SUPERVISOR S Level 2 German, 2013 91126 Demonstrate understanding of a variety of written and / or visual German text(s) on familiar matters 9.30 am Monday 11 November 2013 Credits: Five
MehrAttention: Give your answers to problem 1 and problem 2 directly below the questions in the exam question sheet. ,and C = [ ].
Page 1 LAST NAME FIRST NAME MATRIKEL-NO. Attention: Give your answers to problem 1 and problem 2 directly below the questions in the exam question sheet. Problem 1 (15 points) a) (1 point) A system description
MehrUnterrichtsmaterialien in digitaler und in gedruckter Form. Auszug aus: Vertretungsstunde Englisch 5. Klasse: Grammatik
Unterrichtsmaterialien in digitaler und in gedruckter Form Auszug aus: Vertretungsstunde Englisch 5. Klasse: Grammatik Das komplette Material finden Sie hier: School-Scout.de Pronouns I Let s talk about
MehrD-MATH Algebra II FS 2016 Prof. Richard Pink. Musterlösung 16. einfache und algebraische Erweiterungen
D-MATH Algebra II FS 206 Prof. Richard Pink Musterlösung 6 einfache und algebraische Erweiterungen. Bestimme das Minimalpolynom folgender komplexer Zahlen über Q: (a) 2 + 5. (b) 3 3 3. (c) 4 5 + 4 5i.
MehrMaterialien zu unseren Lehrwerken
Word order Word order is important in English. The word order for subjects, verbs and objects is normally fixed. The word order for adverbial and prepositional phrases is more flexible, but their position
MehrDekohärenz und die Entstehung klassischer Eigenschaften aus der Quantenmechanik
Dekohärenz und die Entstehung klassischer Eigenschaften aus der Quantenmechanik G. Mahler Spezialvorlesung SS 006 7. 4. 006 Einführung und Übersicht Warum und in welchem Sinn ist Kohärenz»untypisch«? 04.
MehrBISON Instantiating the Whitened Swap-Or-Not Construction September 6th, 2018
BION Instantiating the Whitened wap-or-not Construction eptember 6th, 2018 Horst Görtz Institut für IT icherheit Ruhr-Universität Bochum Virginie Lallemand, Gregor Leander, Patrick Neumann, and Friedrich
MehrSport Northern Ireland. Talent Workshop Thursday 28th January 2010 Holiday Inn Express, Antrim
Sport Northern Ireland Talent Workshop Thursday 28th January 2010 Holiday Inn Express, Antrim Outcomes By the end of the day participants will be able to: Define and differentiate between the terms ability,
MehrDeutsch 1 Kapitel 6: Meine Sachen items in a house, pronouns, adjectives, prepositions. Name: Seite
1. Label 10 things in the room with the correct gender (die, der, das) 2. Find the nine words related to household furnishing in the puzzle below. 3. Find the missing pieces of furniture. 4. The movers
MehrWorksheet 2. Problem 4. (a) 1 x x 2 2. dx 4 x2 + b ( x2. x 2 + 3c ] dx 4 + 3b ) (b) Since the points. f(x i, y i )
Worksheet Problem 4 a 4 + x dy ax + by x 4 4 4 4 4 axy + b y+ x y y x 4 a 4 x + b { + x a 4 x + b x + 6 x a 4 + b x + b 4 x x } 4 6a + 8b. b Since the points P, P and P are distributed within the triangle
MehrWas heißt Denken?: Vorlesung Wintersemester 1951/52. [Was bedeutet das alles?] (Reclams Universal-Bibliothek) (German Edition)
Was heißt Denken?: Vorlesung Wintersemester 1951/52. [Was bedeutet das alles?] (Reclams Universal-Bibliothek) (German Edition) Martin Heidegger Click here if your download doesn"t start automatically Was
MehrIm Fluss der Zeit: Gedanken beim Älterwerden (HERDER spektrum) (German Edition)
Im Fluss der Zeit: Gedanken beim Älterwerden (HERDER spektrum) (German Edition) Ulrich Schaffer Click here if your download doesn"t start automatically Im Fluss der Zeit: Gedanken beim Älterwerden (HERDER
MehrFACHKUNDE FüR KAUFLEUTE IM GESUNDHEITSWESEN FROM THIEME GEORG VERLAG
FACHKUNDE FüR KAUFLEUTE IM GESUNDHEITSWESEN FROM THIEME GEORG VERLAG DOWNLOAD EBOOK : FACHKUNDE FüR KAUFLEUTE IM GESUNDHEITSWESEN Click link bellow and free register to download ebook: FACHKUNDE FüR KAUFLEUTE
Mehra) Name and draw three typical input signals used in control technique.
12 minutes Page 1 LAST NAME FIRST NAME MATRIKEL-NO. Problem 1 (2 points each) a) Name and draw three typical input signals used in control technique. b) What is a weight function? c) Define the eigen value
MehrEinführung in die Computerlinguistik reguläre Sprachen und endliche Automaten
Einführung in die Computerlinguistik reguläre Sprachen und endliche Automaten Dozentin: Wiebke Petersen May 3, 2010 Wiebke Petersen Einführung CL (SoSe2010) 1 Operationen auf Sprachen Seien L Σ und K Σ
MehrWALL COVER. by acousticpearls
WALL COVER by acousticpearls 2 ACOUSTIC SURFACE SYSTEM WALL COVER Akustik-Paneelsystem für maßgeschneiderte Wandlösungen Das textile Wandpaneel-System WALL COVER von acousticpearls hat großes mit Ihrem
MehrJ RG IMMENDORFF STANDORT F R KRITIK MALEREI UND INSPIRATION ERSCHEINT ZUR AUSSTELLUNG IM MUSEUM LU
J RG IMMENDORFF STANDORT F R KRITIK MALEREI UND INSPIRATION ERSCHEINT ZUR AUSSTELLUNG IM MUSEUM LU 8 Feb, 2016 JRISFRKMUIEZAIMLAPOM-PDF33-0 File 4,455 KB 96 Page If you want to possess a one-stop search
MehrAutomatentheorie und formale Sprachen reguläre Ausdrücke
Automatentheorie und formale Sprachen reguläre Ausdrücke Dozentin: Wiebke Petersen 6.5.2009 Wiebke Petersen Automatentheorie und formale Sprachen - SoSe09 1 Formal language Denition A formal language L
MehrEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Reguläre Ausdrücke und reguläre Grammatiken Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 20 Regular expressions (1) Let Σ be an alphabet. The
MehrLevel 2 German, 2016
91126 911260 2SUPERVISOR S Level 2 German, 2016 91126 Demonstrate understanding of a variety of written and / or visual German texts on familiar matters 2.00 p.m. Tuesday 29 November 2016 Credits: Five
MehrAlgorithmic Bioinformatics III Graphs, Networks, and Systems SS2008 Ralf Zimmer
Algorithmic Bioinformatics III Graphs, Networks, and Systems SS2008 Ralf Zimmer Graph Theory Introduction Ralf Zimmer, LMU Institut für Informatik, Lehrstuhl für Praktische Informatik und Bioinformatik,
MehrResearch Collection. Backward stochastic differential equations with super-quadratic growth. Doctoral Thesis. ETH Library. Author(s): Bao, Xiaobo
Research Collection Doctoral Thesis Backward stochastic differential equations with super-quadratic growth Author(s): Bao, Xiaobo Publication Date: 2009 Permanent Link: https://doi.org/10.3929/ethz-a-005955736
Mehr