Teorema de Riemann-Roch e aplicações

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Teorema de Riemann-Roch, morfismos de Frobenius e a hipótese de Riemann

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Il teorema di Riemann-Roch

Superfici di Riemann compatte, divisori, Teorema di Riemann Roch, immersioni nello spazio proiettivo.

El teorema de Riemann-Roch y el morfismo de Gysin en geometría aritmética

Le th eor eme de Riemann-Roch originale a rme que pour tout morphisme propre f : Y ! X entre vari et es quasi-projectifs lisses sur un corps, et tout el ement a 2 K0(Y ) du groupe de Grothendieck des br es vectoriels on a ch(f!(a)) = f {u100000}Td(Tf ) ch(a) (cf. [BS58]). Ici ch est le caract ere de Chern, Td(Tf ) est la classe de Todd du br e tangent relative et f et f! sont les images directes de l'anneau de Chow et K0 respectivement. Apr es, Baum, Fulton et MacPherson ont d emontr e en [BFM75] le th eor eme de Riemann-Roch pour des morphismes localement intersection compl ete entre des sch emas alg ebriques (sch emas s epar es et localement de type ni sur un corps) projectifs et singuli eres. En [FG83] Fulton et Gillet ont d emontr e le th eor eme sans hypoth eses projectifs. L'extension a la th eorie K sup erieure pour des sch emas r eguli eres sur une base fut d emontr e par Gillet en [Gil81]. Le th eor eme de Riemann-Roch qu'il prouve est pour des morphismes projectifs entre des sch emas lisses et quasi-projectifs. Donc, dans le cas des sch emas sur un corps, le r esultat de Gillet n'inclus pas le th eor eme de [BFM75]. La plus grande g en eralisation du th eor eme de Riemann-Roch que je connais est [D eg14] et [HS15], o u D eglise et Holmstrom-Scholbach obtiennent ind ependamment le th eor eme de Riemann- Roch pour la K-th eorie sup erieure et les morphismes projectifs lic entre sch emas r eguli eres sur une base noetherienne de dimension nie... NOTA 520 8 El teorema de Riemann-Roch original de Grothendieck a rma que para todo mor smo propio f : Y ! X, entre variedades irreducibles quasiproyectivas lisas sobre un cuerpo, y todo elemento a 2 K0(Y ) del grupo de Grothendieck de brados vectoriales se satisface la relaci on ch(f!(a)) = f {u100000}Td(Tf ) ch(a) (cf. [BS58]). Recu erdese que ch denota el car acter de Chern, Td(Tf ) la clase de Todd del brado tangente relativo y f y f! las im agenes directas en el anillo de Chow y K0 respectivamente. M as tarde Baum, Fulton MacPherson probaron en [BFM75] el teorema de Riemann-Roch para mor smos localmente intersecci on completa entre esquemas algebraicos (es decir, esquemas separados localmente de tipo nito sobre cuerpo) proyectivos singulares. En [FG83] Fulton y Gillet probaron el teorema sin hip otesis proyectivas. La notable extensi on a la teor a K superior para esquemas regulares sobre una base fue probada por Gillet en [Gil81]. El teorema de Riemann-Roch all probado es para mor smos proyectivos entre esquemas lisos quasiproyectivos. Sin embargo, obs ervese que en el caso de esquemas sobre cuerpo el resultado de Gillet no recupera el teorema de [BFM75]. La mayor generalizaci on del teorema de Riemann-Roch que yo conozco es [D eg14] y [HS15] donde D eglise y Holmstrom-Scholbach obtuvieron independientemente el teorema de Riemann-Roch para teor a K superior y mor smos proyectivos lic entre esquemas regulares sobre una base noetheriana nito dimensional...

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.

Classificação de corpos de funções algébricas

Pós-graduação em Matemática - IBILCE

Aspects of atomic decompositions and Bergman projections

The concept of an atomic decomposition was introduced by Coifman and Rochberg (1980) for weighted Bergman spaces on the unit disk. By the Riemann mapping theorem, functions in every simply connected domain in the complex plane have an atomic decomposition. However, a decomposition resulting from a conformal mapping of the unit disk tends to be very implicit and often lacks a clear connection to the geometry of the domain that it has been mapped into. The lattice of points, where the atoms of the decomposition are evaluated, usually follows the geometry of the original domain, but after mapping the domain into another this connection is easily lost and the layout of points becomes seemingly random. In the first article we construct an atomic decomposition directly on a weighted Bergman space on a class of regulated, simply connected domains. The construction uses the geometric properties of the regulated domain, but does not explicitly involve any conformal Riemann map from the unit disk. It is known that the Bergman projection is not bounded on the space L-infinity of bounded measurable functions. Taskinen (2004) introduced the locally convex spaces LV-infinity consisting of measurable and HV-infinity of analytic functions on the unit disk with the latter being a closed subspace of the former. They have the property that the Bergman projection is continuous from LV-infinity onto HV-infinity and, in some sense, the space HV-infinity is the smallest possible substitute to the space H-infinity of analytic functions. In the second article we extend the above result to a smoothly bounded strictly pseudoconvex domain. Here the related reproducing kernels are usually not known explicitly, and thus the proof of continuity of the Bergman projection is based on generalised Forelli-Rudin estimates instead of integral representations. The minimality of the space LV-infinity is shown by using peaking functions first constructed by Bell (1981). Taskinen (2003) showed that on the unit disk the space HV-infinity admits an atomic decomposition. This result is generalised in the third article by constructing an atomic decomposition for the space HV-infinity on a smoothly bounded strictly pseudoconvex domain. In this case every function can be presented as a linear combination of atoms such that the coefficient sequence belongs to a suitable Köthe co-echelon space.

Problème inverse de Galois : critère de rigidité

Dans ce mémoire, on étudie les extensions galoisiennes finies de C(x). On y démontre le théorème d'existence de Riemann. Les notions de rigidité faible, rigidité et rationalité y sont développées. On y obtient le critère de rigidité qui permet de réaliser certains groupes comme groupes de Galois sur Q. Plusieurs exemples de types de ramification sont construis.

Ein inverses Rückstreuproblem der elektrischen Impedanztomographie

Die vorliegende Arbeit untersucht das inverse Hindernisproblem der zweidimensionalen elektrischen Impedanztomographie (EIT) mit Rückstreudaten. Wir präsentieren und analysieren das mathematische Modell für Rückstreudaten, diskutieren das inverse Problem für einen einzelnen isolierenden oder perfekt leitenden Einschluss und stellen zwei Rekonstruktionsverfahren für das inverse Hindernisproblem mit Rückstreudaten vor. Ziel des inversen Hindernisproblems der EIT ist es, Inhomogenitäten (sogenannte Einschlüsse) der elektrischen Leitfähigkeit eines Körpers aus Strom-Spannungs-Messungen an der Körperoberfläche zu identifizieren. Für die Messung von Rückstreudaten ist dafür nur ein Paar aus an der Körperoberfläche nahe zueinander angebrachten Elektroden nötig, das zur Datenerfassung auf der Oberfläche entlang bewegt wird. Wir stellen ein mathematisches Modell für Rückstreudaten vor und zeigen, dass Rückstreudaten die Randwerte einer außerhalb der Einschlüsse holomorphen Funktion sind. Auf dieser Grundlage entwickeln wir das Konzept des konvexen Rückstreuträgers: Der konvexe Rückstreuträger ist eine Teilmenge der konvexen Hülle der Einschlüsse und kann daher zu deren Auffindung dienen. Wir stellen einen Algorithmus zur Berechnung des konvexen Rückstreuträgers vor und demonstrieren ihn an numerischen Beispielen. Ferner zeigen wir, dass ein einzelner isolierender Einschluss anhand seiner Rückstreudaten eindeutig identifizierbar ist. Der Beweis dazu beruht auf dem Riemann'schen Abbildungssatz für zweifach zusammenhängende Gebiete und dient als Grundlage für einen Rekonstruktionsalgorithmus, dessen Leistungsfähigkeit wir an verschiedenen Beispielen demonstrieren. Ein perfekt leitender Einschluss ist hingegen nicht immer aus seinen Rückstreudaten rekonstruierbar. Wir diskutieren, in welchen Fällen die eindeutige Identifizierung fehlschlägt und zeigen Beispiele für unterschiedliche perfekt leitende Einschlüsse mit gleichen Rückstreudaten.

Surfaces de Riemann compactes et formule de trace d'Eichler

Dans ce mémoire, nous étudierons quelques propriétés algébriques, géométriques et topologiques des surfaces de Riemann compactes. Deux grand sujets seront traités. Tout d'abord, en utilisant le fait que toute surface de Riemann compacte de genre g plus grand ou égal à 2 possède un nombre fini de points de Weierstrass, nous allons pouvoir conclure que ces surfaces possèdent un nombre fini d'automorphismes. Ensuite, nous allons étudier de plus près la formule de trace d'Eichler. Ce théorème nous permet de trouver le caractère d'un automorphisme agissant sur l'espace des q-différentielles holomorphes. Nous commencerons notre étude en utilisant la quartique de Klein. Nous effectuerons un exemple de calcul utilisant le théorème d'Eichler, ce qui nous permettra de nous familiariser avec l'énoncé du théorème. Finalement, nous allons démontrer la formule de trace d'Eichler, en prenant soin de traiter le cas où l'automorphisme agit sans point fixe séparément du cas où l'automorphisme possède des points fixes.

Geometrical wave equation and the cauchy-like theorem for octonions

Riemann surfaces, cohomology and homology groups, Cartan's spinors and triality, octonionic projective geometry, are all well supported by Complex Structures [1], [2], [3], [4]. Furthermore, in Theoretical Physics, mainly in General Relativity, Supersymmetry and Particle Physics, Complex Theory Plays a Key Role [5], [6], [7], [8]. In this context it is expected that generalizations of concepts and main results from the Classical Complex Theory, like conformal and quasiconformal mappings [9], [10] in both quaternionic and octonionic algebra, may be useful for other fields of research, as for graphical computing enviromment [11]. In this Note, following recent works by the autors [12], [13], the Cauchy Theorem will be extended for Octonions in an analogous way that it has recentely been made for quaternions [14]. Finally, will be given an octonionic treatment of the wave equation, which means a wave produced by a hyper-string with initial conditions similar to the one-dimensional case.

Zeros da função zeta de Riemann e o teorema dos números primos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Riemann-Hilbert Problems with Canonical Normalization and Families of Commuting Operators

2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.

Application of a new discreet form of Gauss’ theorem for measuring volume

Volume measurements are useful in many branches of science and medicine. They are usually accomplished by acquiring a sequence of cross sectional images through the object using an appropriate scanning modality, for example x-ray computed tomography (CT), magnetic resonance (MR) or ultrasound (US). In the cases of CT and MR, a dividing cubes algorithm can be used to describe the surface as a triangle mesh. However, such algorithms are not suitable for US data, especially when the image sequence is multiplanar (as it usually is). This problem may be overcome by manually tracing regions of interest (ROIs) on the registered multiplanar images and connecting the points into a triangular mesh. In this paper we describe and evaluate a new discreet form of Gauss’ theorem which enables the calculation of the volume of any enclosed surface described by a triangular mesh. The volume is calculated by summing the vector product of the centroid, area and normal of each surface triangle. The algorithm was tested on computer-generated objects, US-scanned balloons, livers and kidneys and CT-scanned clay rocks. The results, expressed as the mean percentage difference ± one standard deviation were 1.2 ± 2.3, 5.5 ± 4.7, 3.0 ± 3.2 and −1.2 ± 3.2% for balloons, livers, kidneys and rocks respectively. The results compare favourably with other volume estimation methods such as planimetry and tetrahedral decomposition.