index.html
  1. /*****************************
  2. * Personal Data *
  3. *****************************/
  4. #name: Daan van Gent
  5. #email: d.m.h.van.gent@math.leidenuniv.nl
  6. #occupation: PhD candidate
  7. #university: Leiden University
  8. #office: Snellius Building, Room 242
  9. #address: Niels Bohrweg 1, 2333 CA Leiden, Netherlands
  10. #supervisor: H.W. Lenstra (~hwl)
  11. #supervisor: R.M. van Luijk (~rvl)
  13. /*****************************
  14. * Seminars *
  15. *****************************/
  16. #newitem aia
  17. #title: Algorithms in Algebra
  18. #date: 2022, Spring
  19. #file: aia.md
  21. /*****************************
  22. * Teachings *
  23. *****************************/
  24. // As teacher
  25. #newitem wwt
  26. #title: Wiskunde Wedstrijd Training
  27. #date: 2020, Spring
  28. #file: wwt.html
  30. // As teaching assistant
  31. #newitem pcmi-2020
  32. #title: Polynomial time algorithms in algebraic number theory
  33. #date: 2020, July
  34. #address: 24 600 E #4, Salt Lake City, UT 84102, United States
  35. #file: pdf/pcmi.pdf
  36. #newitem ec-2020
  37. #title: Elliptic Curves (Mastermath)
  38. #date: 2020, Spring
  39. #newitem ant-2019
  40. #title: Algebraic Number Theory (Mastermath)
  41. #date: 2019, Fall
  42. #newitem dbk-2018
  43. #title: Discrete Besliskunde
  44. #date: 2018, Fall
  45. #newitem opt-2018
  46. #title: Optimalisering
  47. #date: 2018, Spring
  48. #newitem la2-2017
  49. #title: Lineare Algebra II
  50. #date: 2017, Fall
  51. #newitem la2-2016
  52. #title: Lineaire Algebra II
  53. #date: 2016, Fall
  55. /*****************************
  56. * Writings *
  57. *****************************/
  58. // Publications
  59. #newitem ieee-cog-2020
  60. #title: Order versus Chaos
  61. #date: 2020, August
  62. #coauthor: M. J. H. van Den Bergh
  63. #coauthor: S. T. Castelein
  64. #file: ieee-cog.org/2020/papers/paper_142.pdf
  66. // Theses
  67. #newitem bachelor-thesis
  68. #title: Graph-Isomorphism in Quasi-Polynomial Time
  69. #date: 2016, June
  70. #supervisor: O. Biesel (owenbiesel.com)
  71. #file: pdf/bachelor.pdf
  73. #newitem master-thesis
  74. #title: Algorithms for finding the gradings of reduced rings
  75. #date: 2019, July
  76. #supervisor: H.W. Lenstra (~hwl)
  77. #file: pdf/master.pdf
  79. /*****************************
  80. * extracurricular activities *
  81. *****************************/
  82. // Programming
  83. #newitem bapc-jury
  84. #discr: Jury member for the Benelux Algorithm Programming Contest
  85. #date: 2019, Spring - Present
  86. #site: jury.bapc.eu
  87. #newitem icpc
  88. #discr: International Collegiate Programming Contest finalist
  89. #date: 2019
  90. #site: icpc.baylor.edu
  91. #newitem ccc
  92. #discr: Catalyst Coding Contest winner
  93. #date: 2017
  1. // Exercise sheets
  2. #newitem week0
  3. #date: 2020-02-12
  4. #file: pdf/wwt/week0.pdf
  6. #newitem week1
  7. #title: Inductie
  8. #date: 2020-02-26
  9. #file: pdf/wwt/week1.pdf
  11. #newitem week2
  12. #title: Combinatoriek
  13. #date: 2020-03-11
  14. #file: pdf/wwt/week2.pdf
  1. Algorithms in algebra seminar
  2. =============================
  3. This seminar will be an assorted selection of mostly independent talks on algorithms with topics chosen by you, the participants.
  4. The focus will lie on the mathematics behind these algorithms, not on computation. Some ideas for topics include:
  5. * integer factorization and primality tests
  6. * algorithms for finitely generated abelian groups and finite rings
  7. * computing unit groups, class groups and other invariants of number fields
  8. * lattice algorithms and lattice based cryptography
  9. * Groebner bases and other algorithms for polynomial algebras
  10. * type theory, proof assistants and LEAN
  11. We assume an intuitive understanding of algorithms and their analysis (read time-complexity).
  12. Any further knowledge will depend on the topic of the lecture, but we intend to appeal to broad audience.
  14. Organization
  15. ============
  16. A regular meeting time is to be determined. The default will be Thursday 13:15-15:00 in Snellius room 403.
  18. Planning
  19. ========
  20. DATE | TIME | LOCATION | SPEAKER | SUBJECT
  21. -----------+-------+----------+-------------------+-------------------------------------------------------------------------------------
  22. 2022-04-28 | 13:15 | Sn 312 | Daan van Gent | Introduction, organization and multiplication (pdf/aia/multiplication.pdf)
  23. 2022-05-12 | 13:15 | Sn 312 | Onno Berrevoets | PRIMES is in P
  24. 2022-05-19 | 13:15 | Sn 312 | Alex Braat | Algorithms in algebraic number theory
  25. 2022-05-26 | | | -ASCENSION DAY- |
  26. 2022-06-02 | 13:15 | Sn 312 | Mike Daas | The quadratic and number field sieves for factorising large integers
  27. 2022-06-09 | 13:15 | Sn 312 | Pim Spelier | NP-Complete problems in group theory and ring theory
  28. 2022-06-16 | 13:15 | Sn 312 | Ludo Pulles | Lattice reductions
  29. -----------+-------+----------+-------------------+-------------------------------------------------------------------------------------
  30. 2022-09-15 | 13:15 | Sn 403 | Koen de Boer | Provably sampling ideals from a set: near-prime, smooth or otherwise