filmeu

Class Abstract Algebra

  • Presentation

    Presentation

    This course aims to provide a solid foundation in the fundamentals of Abstract Algebra, with a special focus on the study of algebraic structures such as rings, fields, groups, and elementary applications to graphs. These concepts form the theoretical foundation of numerous areas of mathematics and computer science, notably cryptography, code theory, the study of symmetries, and algebraic modeling of computational problems. This course plays a fundamental role in the basic training of students in Mathematics and Computer Science, providing indispensable tools for understanding more advanced disciplines such as computational algebra, algebraic geometry, computer theory, and information security. Furthermore, it encourages abstract and structured thinking, essential for solving complex problems in both academic and professional contexts.
  • Code

    Code

    ULHT6638-24504
  • Syllabus

    Syllabus

    List of contents Numbers, Polynomials, and Factorization Arithmetic in Integers: Divisibility, Greatest Common Divisor, Euclid's Algorithm Polynomials with Coefficients in Integers, Rationals, and Finite Fields Factorization of Polynomials and Irreducibility Criterion Rings, Domains, and Fields Definition of Ring, Integrity Domain, and Field Euclidean, Principal, and Factorial Domains Field Extensions and Fraction Fields Ring Homomorphisms and Ideals Ring Homomorphisms and Isomorphisms Kernel and Image Ideals and Principal Ideals Quotient Rings Homomorphism Theorem Introduction to Group Theory (Emphasis on Matrix Groups) Groups, Subgroups, Inverse Elements Permutation Groups and Matrix Groups (GL(n), SL(n)) Order of a Group and an Element Generated Subgroups, Covalent Classes Lagrange's Theorem Group Homomorphisms and Quotient Groups Group Actions and Applications Introduction to Graphs and Algebraic Modeling Finite-Field Cryptography CAS
  • Objectives

    Objectives

    Understand the fundamental concepts of Abstract Algebra, such as rings, fields, groups, and homomorphisms. Analyze structural properties of polynomials and know how to perform factorizations in different algebraic contexts. Apply the basic theorems of ring and group theory to solve mathematical and computational problems. Work with groups of matrices and recognize their relevance in modeling symmetries and transformations. Use concepts of algebraic structures (such as half-rings) to analyze problems involving graphs and shortest paths. Develop abstraction skills, mathematical rigor, and generalization skills, essential for advanced areas of mathematics and computing. Relate the concepts studied to practical applications, such as cryptography, error correction, and optimization algorithms. Be able to construct rigorous mathematical arguments, identify algebraic structures in concrete problems, and communicate solutions clearly and precisely.
  • Teaching methodologies and assessment

    Teaching methodologies and assessment

    Active and participatory methodologies will be used, such as collaborative problem-solving, the use of computer algebra software (e.g., SageMath), and the integration of real-world computer science applications. The use of digital simulations will allow for practical and contextualized consolidation of the content, fostering students' autonomy and critical thinking.
  • References

    References

    Gonçalves, Adilson - Introdução à Álgebra. Edição: 6. Publicação: IMPA, 2017. Páginas: 192. ISBN: 978-85-244-0430-6. West, D. B. (2001). Introduction to graph theory (Vol. 2, pp. 1-512). Upper Saddle River: Prentice hall.  
SINGLE REGISTRATION
Lisboa 2020 Portugal 2020 Small financiado eu 2024 prr 2024 republica portuguesa 2024 Logo UE Financed Provedor do Estudante Livro de reclamaões Elogios