Stammdaten

Titel: Lessons Learned from Cutting Trees
Beschreibung:

In a series of articles over the last few years, the concept of deterministic tree reductions has been studied intensively. Two core questions in this context can be formulated as follows: given some deterministic reduction procedure (e.g., "cut away all left-most leaves"), how many iterations have to be applied to trees of given size such that they are completely reduced? And, after applying a fixed number of iterations, how many vertices have been removed / how  large is the resulting tree?

In this seminar talk, we will walk through the main ideas behind the combinatorial and asymptotic analysis of these questions. Along this path, we will also encounter interesting combinatorial parameter interpretations and bijective proofs. Simultaneously, we explore with live demonstrations in how far the computer mathematics software system SageMath can support us when it comes to the asymptotic calculus.

Schlagworte:
Typ: Angemeldeter Vortrag
Homepage: https://www.sfb050.risc.jku.at/events/sfb-statusseminar-3
Veranstaltung: Statusseminar (SFB: Algorithmic and Enumerative Combinatorics) (IFEB, Strobl am Wolfgangsee)
Datum: 10.12.2019
Vortragsstatus:

Beteiligte

Zuordnung

Organisation Adresse
Fakultät für Technische Wissenschaften
 
Institut für Mathematik
Universitätsstraße 65-67
9020 Klagenfurt am Wörthersee
Österreich
   math@aau.at
https://www.aau.at/mathematik
zur Organisation
Universitätsstraße 65-67
AT - 9020  Klagenfurt am Wörthersee

Kategorisierung

Sachgebiete
  • 101008 - Funktionentheorie
  • 101012 - Kombinatorik
  • 101002 - Analysis
  • 101005 - Computeralgebra
Forschungscluster Kein Forschungscluster ausgewählt
Vortragsfokus
  • Science to Science (Qualitätsindikator: II)
Klassifikationsraster der zugeordneten Organisationseinheiten:
TeilnehmerInnenkreis
  • Überwiegend national
Publiziert?
  • Nein
Arbeitsgruppen
  • Diskrete Mathematik und Optimierung

Kooperationen

Keine Partnerorganisation ausgewählt