Master of Science / Department of Mathematics / Roman Fedorov / The purpose of this report is to serve as an introduction to the language of sheaves and schemes via algebraic geometry. The main objective is to use examples from algebraic geometry to motivate the utility of the perspective from sheaf and scheme theory. Basic facts and definitions will be provided, and a categorical approach will be frequently incorporated when appropriate.

No description available.

No description available.

We classify the smooth complete intersections with positive-definite intersection form on their middle cohomology. There are two families. The first family are quadric hypersurfaces in P(4k+1) with k a positive integer. The middle cohomology is always of rank two and the intersection lattice corresponds to the identity matrix. The second family are complete intersections of two quadrics in P(4k+2) (k a positive integer). Here the intersection lattices are the Gamma(4(k+1)) lattices; in particular, the intersection lattice of a smooth complete intersection of two quadrics in P(6) is the famous E8 lattice. / Thesis (Master, Mathematics & Statistics) -- Queen's University, 2012-10-15 13:19:42.654

<p>This thesis analyzes the Chow motives of 3 types of smooth projective varieties: the desingularized elliptic self fiber product, the Fano surface of lines on a cubic threefold and an ample hypersurface of an Abelian variety. For the desingularized elliptic self fiber product, we use an isotypic decomposition of the motive to deduce the Murre conjectures. We also prove a result about the intersection product. For the Fano surface of lines, we prove the finite-dimensionality of the Chow motive. Finally, we prove that an ample hypersurface on an Abelian variety possesses a Chow-Kunneth decomposition for which a motivic version of the Lefschetz hyperplane theorem holds.</p> / Dissertation

Wong, Sen. / Thesis submitted in: November 2006. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaf 85). / Abstracts in English and Chinese. / Chapter 1 --- From algebraic sets to Preschemes --- p.5 / Chapter 1.1 --- Affine varieties and prevarieties --- p.5 / Chapter 1.2 --- Affine schemes and preschemes --- p.13 / Chapter 1.3 --- Morphisms --- p.16 / Chapter 1.4 --- Prevarieties vs Preschemes --- p.29 / Chapter 1.5 --- Summary and Products --- p.37 / Chapter 2 --- More on prevarieties --- p.43 / Chapter 2.1 --- Introduction --- p.43 / Chapter 2.2 --- Subprevarieties and product of prevarieties --- p.48 / Chapter 2.3 --- Dominating and birational morphisms --- p.60 / Chapter 2.4 --- Complete varieties --- p.64 / Chapter 2.5 --- Chow's Theorem --- p.68 / Chapter 3 --- From preschemes to schemes --- p.71 / Chapter 3.1 --- Introduction --- p.71 / Chapter 3.2 --- Open subpreschemes and Open immersions --- p.74 / Chapter 3.3 --- Closed subpreschemes and Closed immersions --- p.76 / Chapter 3.4 --- Schemes --- p.79 / Chapter A --- Hilbert's Nullstellensatz --- p.81 / Bibliography --- p.85

The projective plane, PG(2;q), over a Galois field Fq is an incidence structure of points and lines. A (k;n)-arc K in PG(2;q) is a set of k points such that no n+1 of them are collinear but some n are collinear. A (k;n)-arc K in PG(2;q) is called complete if it is not contained in any (k+1;n)-arc. The existence of arcs for particular values of k and n pose interesting problems in finite geometry. It connects with coding theory and graph theory, with important applications in computer science. The main problem, known as the packing problem, is to determine the largest size mn(2;q) of K in PG(2;q). This problem has received much attention. Here, the work establishes complete arcs with a large number of points. In contrast, the problem to determine the smallest size tn(2;q) of a complete (k;n)-arc is mostly based on the lower bound arising from theoretical investigations. This thesis has several goals. The first goal is to classify certain (k;4)-arcs for k = 6,...,38 in PG(2;13). This classification is established through an approach in Chapter 2. This approach uses a new geometrical method; it is a combination of projective inequivalence of (k;4)-arcs up to k = 6 and certain sdinequivalent (k;4)-arcs that have sd-inequivalent classes of secant distributions for k = 7,...,38. The part related to projectively inequivalent (k;4)-arcs up to k=6 starts by fixing the frame points f1;2;3;88g and then classify the projectively inequivalent (5;4)-arcs. Among these (5;4)-arcs and (6;4)-arcs, the lexicographically least set are found. Now, the part regarding sd-inequivalent (k;4)-arcs in this method starts by choosing five sd-inequivalent (7;4)-arcs. This classification method may not produce all sd-inequivalent classes of (k;4)-arcs. However, it was necessary to employ this method due to the increasing number of (k;4)-arcs in PG(2;13) and the extreme computational difficulty of the problem. It reduces the constructed number of (k;4)-arcs in each process for large k. Consequently, it reduces the executed time for the computation which could last for years. Also, this method decreases the memory usage needed for the classification. The largest size of (k;4)-arc established through this method is k = 38. The classification of certain (k;4)-arcs up to projective equivalence, for k = 34,35,36,37,38, is also established. This classification starts from the 77 incomplete (34;4)-arcs that are constructed from the sd-inequivalent (33;4)-arcs given in Section 2.29, Table 2.35. Here, the largest size of (k;4)-arc is still k = 38. In addition, the previous process is re-iterated with a different choice of five sd-inequivalent (7;4)-arcs. The purpose of this choice is to find a new size of complete (k;4)-arc for k > 38. This particular computation of (k;4)-arcs found no complete (k;4)-arc for k > 38. In contrast, a new size of complete (k;4)-arc in PG(2;13) is discovered. This size is k = 36 which is the largest complete (k;4)-arc in this computation. This result raises the second largest size of complete (k;4)-arc found in the first classification from k = 35 to k = 36. The second goal is to discuss the incidence structure of the orbits of the groups of the projectively inequivalent (6;4)-arcs and also the incidence structures of the orbits of the groups other than the identity group of the sd-inequivalent (k;4)-arcs. In Chapter 3, these incidence structures are given for k = 6,7,8,9,10,11,12,13,14,38. Also, the pictures of the geometric configurations of the lines and the points of the orbits are described. The third goal is to find the sizes of certain sd-inequivalent complete (k;4)-arcs in PG(2;13). These sizes of complete (k;4)-arcs are given in Chapter 4 where the smallest size of complete (k;4)-arc is at most k = 24 and the largest size is at least k = 38. The fourth goal is to give an example of an associated non-singular quartic curve C for each complete (k;4)-arc and to discuss the algebraic properties of each curve in terms of the number I of inflexion points, the number jC \K j of rational points on the corresponding arc, and the number N1 of rational points of C . These curves are given in Chapter 5. Also, the algebraic properties of complete arcs of the most interesting sizes investigated in this thesis are studied. In addition, there are two examples of quartic curves C (g0 1) and C (g0 2) attaining the Hasse-Weil- Serre upper bound for the number N1 of rational points on a curve over the finite field of order thirteen. This number is 32. The fifth goal is to classify the (k;4)-arcs in PG(2;13) up to projective inequivalence for k < 10. This classification is established in Chapter 6. It starts by fixing a triad, U1, on the projective line, PG(1;13). Here, the number of projectively inequivalent (k;4)-arcs are tested by using the tool given in Chapter 2. Then, among the number of the projectively inequivalent (10;4)-arcs found, the classification of sd-inequivalent (k;4)-arcs for k = 10 is made. The number of these sd-inequivalent arcs is 36. Then, the 36 sd-inequivalent arcs are extended. The aim here is to investigate if there is a new size of sd-inequivalent (k;4)-arc for k > 38 that can be obtained from these arcs. The largest size of sd-inequivalent (k;4)-arc in this process is the same as the largest size of the sd-inequivalent (k;4)-arc established in Chapter 2, that is, k = 38. In addition, the classification of (k;n)-arcs in PG(2;13) is extended from n = 4 to n = 6. This extension is given in Chapter 7 where some results of the classification of certain (k;6)-arcs for k = 9; : : : ;25 are obtained using the same method as in Chapter 2 for k = 7,...,38. This process starts by fixing a certain (8;6)-arc containing six collinear points in PG(2;13).

Tropical polynomials are similar to classical polynomials, however addition and multiplication are replaced with tropical addition (minimums) and tropical multiplication (addition). Within this new construction, polynomials become piecewise linear curves with interesting behavior. All tropical polynomials are piecewise linear curves, and each linear component uniquely corresponds to a particular monomial. In addition, certain monomial in the tropical polynomial can be trivial due to the fact that tropical addition is the minimum operator. Therefore, it makes sense to consider a graph of connectivity of the monomials for any given tropical polynomial. We investigate tropical polynomials where all coefficients are chosen from a standard normal distribution, and ask what the distribution will be for the graphs of connectivity amongst the monomials. We present a rudimentary algorithm for analytically determining the probability and show a Monte Carlo based confirmation for our results. In addition, we will give a variety of different theorems comparing relative likelihoods of different types of tropical polynomials.

Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, June 1997. / Includes bibliographical references. Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 2001. / Typescript. Vita. Includes bibliographical references (leaf 37). Also available on the Internet.