YoVDO

A Random Hall-Paige Conjecture

Offered By: BIMSA via YouTube

Tags

Combinatorics Courses Algebra Courses Graph Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a lecture on the random Hall-Paige Conjecture delivered by Alexey Pokrovskiy, a renowned mathematician specializing in extremal combinatorics. Delve into the intersection of combinatorics and algebra as Pokrovskiy, a lecturer at University College London and recipient of the European Prize in Combinatorics, presents his research. Learn about the speaker's background, including his PhD on "Graph Powers, Partitions, and other Extremal Problems" and his work in Ramsey theory, Latin squares, and positional games. Gain insights from Pokrovskiy's experiences as a postdoc at Freie Universitat Berlin and ETH Zurich, and his current role at UCL. Discover how this one-hour lecture, presented at BIMSA, contributes to the field of mathematics and advances our understanding of complex combinatorial problems.

Syllabus

Alexey Pokrovskiy: A random Hall-Paige Conjecture


Taught by

BIMSA

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer