We are happy to have Amirreza Asadzadeh to give a talk for us! Join us via Zoom:
https://utoronto.zoom.us/j/82906855125
See below for details, including the abstract of Amirreza’s talk.
Date: 3 May 2021, 4:30 – 5:00pm
Title: A brief introduction to Matroid Theory
Abstract: Have you ever noticed the subtle hidden connections between seemingly unrelated mathematical ideas, for instance the connection between the dimension of a spanning subspace, the size of a spanning forest, and the size of a complete matching? Matroids, introduced by Whitney in 1935, are combinatorial structures that capture the essence of independence abstractly and unify many mathematical fields such as linear algebra, graph theory, matching theory, projective geometry, and algebraic field theory in terms of independence. In this talk, we briefly introduce matroids and their basic operations, which will shed light on how valuable these combinatorial objects can be in coding theory and other fields. Moreover, matroids arise naturally in combinatorial optimization since they are precisely the structures for which the greedy algorithm works optimally.
Bio: Amirreza Asadzadeh is a first-year M.A.Sc. student under the supervision of Prof. Stark Draper. He received his B.Sc. degree in Electrical Engineering with a minor degree in Mathematics from Sharif University of Technology, Tehran, Iran in 2019. As part of his undergraduate studies, he spent two summer internships, one in CUHK at the Institute of Network Coding (INC), and the other one in TU Berlin under the supervision of Prof. Giuseppe Caire. His research interests include information theory, coding theory, optimization theory, and learning theory.
IT@UofT 