lu.se

Forskar­utbildnings­kurser

Lunds tekniska högskola | Lunds universitet

Detaljer för kurs FMA091F Diskret matematik

Utskriftsvänlig visning

Allmänt
  • FMA091F
  • Tillfällig
Kursnamn
  • Discrete Mathematics
Kursomfattning
  • 7,5
Undervisningsform
  • Gemensam kurs, avancerad nivå och forskarnivå
Administrativ information
  • 7151 (Matematikcentrum (inst LTH) / Matematik (LTH))
  •  -11-15
  • FN1/Anders Gustafsson

Aktuell fastställd kursplan

Allmänt
Syfte
  • The aim of the course is to treat some basic parts of discrete mathematics, of importance in computer science, information theory, signal processing, physics and many other subjects in technology and science. The aim is also to develop the students' ability to solve problems and to assimilate mathematical text. The course should also provide general mathematical education.
Innehåll
  • Number theory: Divisibility. Prime numbers. The Euclidean algorithm. Chinese remainder theorem. Modular arithmetic.

    Sets, functions and relations: Injective, surjective and bijective functions. Inverse function. Equivalence relations.

    Combinatorics: The four cases of counting with or without repetition and with or without regard to order. Binomial coefficients. The principle of inclusion and exclusion. The method of generating functions.

    Recursion: Recursion formulae and difference equations.

    Rings and fields: Definition. Applications to coding.

    Graph theory: Terminology and basic concepts. Eulerian and Hamiltonian graphs.
Kunskap och förståelse
  • För godkänd kurs skall doktoranden
  • be able to understand and in his or her own words clearly define the central concepts in combinatorics, number theory, graph theory, functions and relations, and the theory of finite fields.
    in his or her own words be able to describe the logical connections between the occurring concepts (theorems and proofs).
    with confidence be able to carry out routine calculations within the framework of the course.
    in practical situations, with confidence be able to identify different combinatorial selections: with/without repetition, with/without regard to order.
    understand how results about finite fields and linear algebra may be used for coding.
Färdighet och förmåga
  • För godkänd kurs skall doktoranden
  • be able to demonstrate ability to identify problems which can be solved with methods from discrete mathematics and to choose an appropriate method.
    in connection with problem solving be able to demonstrate ability to integrate results from various parts of the course.
    with proper terminology, in a well-structured way and with clear logic be able to explain the solution to a problem.
    be able to use basic theorems of graph theory to draw conclusions about a given graph (of moderate size).
Värderingsförmåga och förhållningssätt
  • För godkänd kurs skall doktoranden
Undervisningsformer
  • Föreläsningar
  • Seminarier
  • övningar
Examinationsformer
  • Skriftlig tentamen
  • Muntlig tentamen
  • Underkänd, godkänd
Förkunskapskrav
Förutsatta förkunskaper
  • Elementary linear algebra and analysis (FMAB65 and FMAB20).
Urvalskriterier
Litteratur
  • Grimaldi, Ralph P.: Discrete and Combinatorial Mathematics: Pearson New International Edition. 2013. ISBN 9781292022796.
    Andersson, K.: Finite Fields and Error-Correcting Codes.. Matematikcentrum, 2015.
  • Available as a pdf-file on the web. 54 pages.
Övrig information
Kurskod
  • FMA091F
Administrativ information
  • 2021-03-01
  • Professor Thomas Johansson

Alla fastställda kursplaner

2 kursplaner.

Kurskod ▽ Kursnamn ▽ Avdelning ▼ Inrättad ▽ Gäller från och med ▽ Första inlämning ▽ Andra inlämning ▽ Fastställd ▽
FMA091F Diskret matematik Matematik (LTH) 2013‑11‑15 HT 2013 2013‑10‑11 17:55:59 2013‑10‑29 15:52:00 2013‑11‑15
FMA091F Diskret matematik Matematik (LTH) 2021‑03‑01 HT 2021 2021‑02‑16 08:39:12 2021‑02‑17 17:48:30 2021‑03‑01

Aktuellt eller kommande publicerat kurstillfälle

Inget matchande kurstillfälle hittades.

Alla publicerade kurstillfällen

Inga matchande kurstillfällen hittades.

0 kurstillfällen.


Utskriftsvänlig visning