Listing 1 - 8 of 8 |
Sort by
|
Choose an application
Exploring the interplay between deep theory and intricate computation, this volume is a compilation of research and survey papers in number theory, written by members of the Women In Numbers (WIN) network, principally by the collaborative research groups formed at Women In Numbers 3, a conference at the Banff International Research Station in Banff, Alberta, on April 21-25, 2014. The papers span a wide range of research areas: arithmetic geometry; analytic number theory; algebraic number theory; and applications to coding and cryptography. The WIN conference series began in 2008, with the aim of strengthening the research careers of female number theorists. The series introduced a novel research-mentorship model: women at all career stages, from graduate students to senior members of the community, joined forces to work in focused research groups on cutting-edge projects designed and led by experienced researchers. The goals for Women In Numbers 3 were to establish ambitious new collaborations between women in number theory, to train junior participants about topics of current importance, and to continue to build a vibrant community of women in number theory. Forty-two women attended the WIN3 workshop, including 15 senior and mid-level faculty, 15 junior faculty and postdocs, and 12 graduate students.
Mathematics. --- Topological groups. --- Lie groups. --- Geometry. --- Number theory. --- Number Theory. --- Topological Groups, Lie Groups. --- Number theory --- Topological Groups. --- Mathematics --- Euclid's Elements --- Groups, Topological --- Continuous groups --- Number study --- Numbers, Theory of --- Algebra --- Groups, Lie --- Lie algebras --- Symmetric spaces --- Topological groups
Choose an application
Exploring the interplay between deep theory and intricate computation, this volume is a compilation of research and survey papers in number theory, written by members of the Women In Numbers (WIN) network, principally by the collaborative research groups formed at Women In Numbers 3, a conference at the Banff International Research Station in Banff, Alberta, on April 21-25, 2014. The papers span a wide range of research areas: arithmetic geometry; analytic number theory; algebraic number theory; and applications to coding and cryptography. The WIN conference series began in 2008, with the aim of strengthening the research careers of female number theorists. The series introduced a novel research-mentorship model: women at all career stages, from graduate students to senior members of the community, joined forces to work in focused research groups on cutting-edge projects designed and led by experienced researchers. The goals for Women In Numbers 3 were to establish ambitious new collaborations between women in number theory, to train junior participants about topics of current importance, and to continue to build a vibrant community of women in number theory. Forty-two women attended the WIN3 workshop, including 15 senior and mid-level faculty, 15 junior faculty and postdocs, and 12 graduate students.
Number theory --- Ordered algebraic structures --- Topological groups. Lie groups --- Geometry --- Mathematics --- topologie (wiskunde) --- wiskunde --- getallenleer --- geometrie --- topologie
Choose an application
This textbook, Counting Rocks!, is the written component of an interactive introduction to combinatorics at the undergradaute level. Throughout the text, we link to videos where we describe the material and provide examples; see the Youtube playlist on the Colorado State University (CSU) Mathematics YouTube channel. The major topics in this text are counting problems (Chapters 1-4), proof techniques (Chapter 5), recurrence relations and generating functions (Chapters 6-7), and graph theory (Chapters 8-12). The material and the problems we include are standard for an undergraduate combinatorics course. In this text, one of our goals was to describe the mathematical structures underlying problems in combinatorics. For example, we separate the description of sequences, permutations, sets and multisets in Chapter 3. In addition to the videos, we would like to highlight some other features of this book. Most chapters contain an investigation section, where students are led through a series of deeper problems on a topic. In several sections, we show students how to use the free online computing software SAGE in order to solve problems; this is especially useful for the problems on recurrence relations. We have included many helpful figures throughout the text, and we end each chapter (and many of the sections) with a list of exercises of varying difficulty.
Choose an application
This textbook, Counting Rocks!, is the written component of an interactive introduction to combinatorics at the undergradaute level. Throughout the text, we link to videos where we describe the material and provide examples; see the Youtube playlist on the Colorado State University (CSU) Mathematics YouTube channel. The major topics in this text are counting problems (Chapters 1-4), proof techniques (Chapter 5), recurrence relations and generating functions (Chapters 6-7), and graph theory (Chapters 8-12). The material and the problems we include are standard for an undergraduate combinatorics course. In this text, one of our goals was to describe the mathematical structures underlying problems in combinatorics. For example, we separate the description of sequences, permutations, sets and multisets in Chapter 3. In addition to the videos, we would like to highlight some other features of this book. Most chapters contain an investigation section, where students are led through a series of deeper problems on a topic. In several sections, we show students how to use the free online computing software SAGE in order to solve problems; this is especially useful for the problems on recurrence relations. We have included many helpful figures throughout the text, and we end each chapter (and many of the sections) with a list of exercises of varying difficulty.
Choose an application
"We study the Jacobian J of the smooth projective curve C of genus r-1 with affine model yr = xr-1(x+ 1)(x + t) over the function field Fp(t), when p is prime and r [greater than or equal to] 2 is an integer prime to p. When q is a power of p and d is a positive integer, we compute the L-function of J over Fq(t1/d) and show that the Birch and Swinnerton-Dyer conjecture holds for J over Fq(t1/d). When d is divisible by r and of the form p[nu] + 1, and Kd := Fp([mu]d, t1/d), we write down explicit points in J(Kd), show that they generate a subgroup V of rank (r-1)(d-2) whose index in J(Kd) is finite and a power of p, and show that the order of the Tate-Shafarevich group of J over Kd is [J(Kd) : V ]2. When r > 2, we prove that the "new" part of J is isogenous over Fp(t) to the square of a simple abelian variety of dimension [phi](r)/2 with endomorphism algebra Z[[mu]r]+. For a prime with pr, we prove that J[](L) = {0} for any abelian extension L of Fp(t)"--
Torsion --- Torsion (mécanique) --- Algebraic functions --- Fonctions algébriques --- Nombres, Théorie des --- Number theory --- Curves, Algebraic. --- Abelian varieties. --- Jacobians. --- Birch-Swinnerton-Dyer conjecture. --- Rational points (Geometry) --- Legendre's functions. --- Finite fields (Algebra)
Choose an application
"We study the Jacobian J of the smooth projective curve C of genus r-1 with affine model yr = xr-1(x+ 1)(x + t) over the function field Fp(t), when p is prime and r [greater than or equal to] 2 is an integer prime to p. When q is a power of p and d is a positive integer, we compute the L-function of J over Fq(t1/d) and show that the Birch and Swinnerton-Dyer conjecture holds for J over Fq(t1/d). When d is divisible by r and of the form p[nu] + 1, and Kd := Fp([mu]d, t1/d), we write down explicit points in J(Kd), show that they generate a subgroup V of rank (r-1)(d-2) whose index in J(Kd) is finite and a power of p, and show that the order of the Tate-Shafarevich group of J over Kd is [J(Kd) : V ]2. When r > 2, we prove that the "new" part of J is isogenous over Fp(t) to the square of a simple abelian variety of dimension [phi](r)/2 with endomorphism algebra Z[[mu]r]+. For a prime with pr, we prove that J[](L) = {0} for any abelian extension L of Fp(t)"--
Curves, Algebraic. --- Legendre's functions. --- Rational points (Geometry) --- Birch-Swinnerton-Dyer conjecture. --- Jacobians. --- Abelian varieties. --- Finite fields (Algebra)
Choose an application
Algebra and number theory have always been counted among the most beautiful and fundamental mathematical areas with deep proofs and elegant results. However, for a long time they were not considered of any substantial importance for real-life applications. This has dramatically changed with the appearance of new topics such as modern cryptography, coding theory, and wireless communication. Nowadays we find applications of algebra and number theory frequently in our daily life. We mention security and error detection for internet banking, check digit systems and the bar code, GPS and radar systems, pricing options at a stock market, and noise suppression on mobile phones as most common examples. This book collects the results of the workshops "Applications of algebraic curves" and "Applications of finite fields" of the RICAM Special Semester 2013. These workshops brought together the most prominent researchers in the area of finite fields and their applications around the world. They address old and new problems on curves and other aspects of finite fields, with emphasis on their diverse applications to many areas of pure and applied mathematics.
Choose an application
Listing 1 - 8 of 8 |
Sort by
|