Surveys in Combinatorics 2024 (eBook, PDF)

Redaktion: Fischer, Felix (Queen Mary University of London); Johnson, Robert (Queen Mary University of London)

• Format: PDF

Produktbeschreibung

This volume contains nine survey articles by the invited speakers of the 30th British Combinatorial Conference, held at Queen Mary University of London in July 2024. Each article provides an overview of recent developments in a current hot research topic in combinatorics. Topics covered include: Latin squares, Erdos covering systems, finite field models, sublinear expanders, cluster expansion, the slice rank polynomial method, and oriented trees and paths in digraphs. The authors are among the world's foremost researchers on their respective topics but their surveys are accessible to nonspecialist readers: they are written clearly with little prior knowledge assumed and with pointers to the wider literature. Taken together these surveys give a snapshot of the research frontier in contemporary combinatorics, helping researchers and graduate students in mathematics and theoretical computer science to keep abreast of the latest developments in the field.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 29. Mai 2024
• ISBN-13: 9781009490542
• Artikelnr.: 72353017

Inhaltsangabe

1. Intersection theory of matroids: variations on a theme Federico Ardila-Mantilla
2. Erd¿s covering systems Paul Balister
3. The cluster expansion in combinatorics Matthew Jenssen
4. Sublinear expanders and their applications Shoham Letzter
5. Transversals in Latin squares Richard Montgomery
6. Finite field models in arithmetic combinatorics - twenty years on Sarah Peluse
7. The slice rank polynomial method - a survey a few years later Lisa Sauermann
8. An introduction to transshipments over time Martin Skutella
9. Oriented trees and paths in digraphs Maya Stein.