Combinatorial problems - a place where classical enumeration fails | Pavol Kollár

Value of the Information & Strength of the Argument

The talk provides valuable insights into advanced combinatorial enumeration problems. The speaker clearly explains the motivation and the mathematical background, and presents his own contributions, including a computational algorithm and a theorem about boundary matrices. The argumentation is solid, with references to prior work and logical reasoning. However, some parts are presented as ongoing work without complete proofs, which is acceptable for a lecture but limits the depth of the argumentation.

Scientific Rigor, Source Quality, Title Accuracy

The speaker references several papers, including those by Janet Goyak, Robert and Gareth Jones, and the trio Yaiti, Yates, and Opal. He also mentions his own paper in preparation. The sources are relevant and well-integrated. The title accurately reflects the content, focusing on combinatorial problems where classical enumeration fails. The talk is well-structured and the mathematical rigor is high, though the presentation is at a level suitable for an academic audience.

The title accurately reflects the content, which focuses on combinatorial enumeration problems where classical methods fail, and presents alternative approaches.

7/10

The talk presents original research in combinatorics, with references to established papers and ongoing computational work. The speaker is a student, but the content is rigorous and well-structured. Some claims are not fully detailed due to time constraints, but the methodology is sound.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction and overview of the presentation structure.
• 01:00Definition of graphs and graph automorphisms.
• 03:00Introduction to vertex-transitive graphs and Cayley graphs.
• 06:00Generalization to r-regular families and prior work by Goyak, Jones, and Carrick.
• 10:00Computational approach using Fourier transforms and matrix representations.
• 15:00Estimation of the number of r-regular families on five elements.
• 20:00Introduction to boundary matrices and anti-dictionary languages.
• 25:00Dynamic programming approach and transition graphs.
• 30:00Theorem on the growth of boundary matrices and the existence of a single recurrence.
• 35:00Conclusion and future directions.

• Goyak, J. (1996). Quasi-groups and graph automorphisms. — Mentioned as the origin of the concept of quasi-groups and r-regular families.
• Yaiti, R., & Jones, G. (year unknown). Paper on r-regular families. — Mentioned as the first generalization of Cayley graphs to r-regular families.
• Carrick, P. (bachelor thesis). Generation of r-regular families. — Mentioned as using computer power to generate lists of r-regular families.
• Yaiti, R., Yates, & Opal (2018). Paper on boundary matrices. — Mentioned as revisiting dynamic programming for boundary matrices.

• Yaiti, R., & Jones, G. (year unknown). Paper on r-regular families. — The speaker's work builds on this paper, and the results are consistent with it.
• Yaiti, R., Yates, & Opal (2018). Paper on boundary matrices. — The speaker's dynamic programming approach is based on this paper, and his theorem extends it.

• None — No discordant sources were mentioned in the talk.