Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Irreducible Polynomials and Finite Fields
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Chinese Remainder Theorem and Euclidean Domains
Explores the Chinese remainder theorem, systems of congruences, and Euclidean domains in integer numbers and polynomial rings.
Local Homeomorphisms and Coverings
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.
Reed Solomon Codes: Basics and Applications
Introduces Reed Solomon Codes, their applications, polynomial definitions, interpolation, roots, and the Fundamental Theorem of Algebra.
Stein Algorithm: Polynomial Identity Testing
Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.
Polynomials: Definitions and Operations
Covers the definition and operations of polynomials, including addition and multiplication, degree, coefficients, and their role in algebraic systems.
Chinese Remainder Theorem and Polynomial Rings
Covers the Chinese remainder theorem, polynomial rings, and Euclidean domains among other topics.
Polynomial Factorization and Decomposition
Covers polynomial factorization, irreducible polynomials, ideal decomposition, and the theorem of Bézout.
Minimal Polynomials: Uniqueness and Division
Explores the uniqueness of minimal polynomials and the division algorithm for polynomials.
Polynomials: Roots and Factorization
Explores polynomial roots, factorization, and the Euclidean algorithm in depth.
Polynomials on a Field
Covers the construction of polynomials on a field and the concept of minimal polynomials.