Stony Brook University Problem Set 2 Jason Starr Fall 2014 MAT 614 Problem Set 1
نویسنده
چکیده
Homework Policy. Please read through all the problems. I will be happy to discuss the solutions during office hours. Problems. Problem 1. For a finite type, separated k-scheme X, recall the alternative definition of the subgroup Ratl(X) ⊂ Zl(X). It equals the subgroup generated by all pushforward classes, i∗[W0]− i∗[W∞], for all k-schemes W of pure dimension l + 1, and for all proper morphisms (h, i) : W → P ×k X,
منابع مشابه
Stony Brook University Problem Set 3 Jason Starr Fall 2014 MAT 614 Problem Set
(a) Prove that there exists a (left-right) inverse σ(t) in K [[t]] to the image of λ(t) if and only if a0 is invertible in K. In this case, prove that the inverse σ(t) is unique. More generally, for every element a0− a1t+ . . . in K [[t]], prove that the element is invertible if and only if a0 is invertible in K, in which case the inverse is unique. (b) Assume that λ(t) ∈ K[t] has an inverse σ(...
متن کاملProblem Set 4 Jason Starr Fall 2014 MAT 614 Problem Set 4
Problems. Problem 1. Let Y be a finite type, separated k-scheme. Let E be a locally free OY -module of rank r + 1. Let πE : PY (E)→ Y, φ : π∗E∨ → O(1) be a universal pair of a morphism to Y together with an invertible quotient of the pullback of E∨ (to help calibrate conventions, this is covariant in E with respect to locally split monomorphisms of locally free sheaves). Recall in the proof of ...
متن کاملProblem Set 10 Jason Starr Fall 2015 MAT 536 Problem Set 10
Problem 1.(The Mapping Cone is a Homotopy Limit and a Homotopy Colimit) Let A be an Abelian category. Let A● and B● be objects in Ch●(A). Let f ● ∶ A● → B● be a morphism in Ch●(A). For every object T ● of Ch●(A), a left homotopy annihilator to T ● is a pair (Q●, σ●) of a morphism Q● ∶ B● → T ● in Ch●(A) and a nullhomotopy (σn ∶ An → T n−1)n∈Z of Q● ○ f ●, i.e., for every n ∈ Z, Q ○ f = dn−1 T ○...
متن کاملOn Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász’s theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using t...
متن کاملCollision avoidance for mobile robots with limited sensing and limited information about moving obstacles
This paper addresses the problem of safely navigating a mobile robot with limited sensing capability and limited information about stationary and moving obstacles. We consider two sensing limitations: blind spots between sensors and limited sensing range. We study three notions of safety: (1) static safety, which ensures collision-freedom with respect to stationary obstacles, (2) passive safety...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014