The Copenhagen Summer of Counting & Algebraic Complexity
mid-June to August 2023 🇩🇰
A critical mass of researchers gathers to learn and collaborate together, much in the style of a Simons Institute semester, with reading groups, discussions, research in groups, and talks. Meeting spaces and offices will be provided by the IT University of Copenhagen.
We will cover
counting problems
(e.g., partition functions, homomorphisms, approximate counting),algebraic complexity
(e.g., lower bounds, algebraic techniques in algorithms),fine-grained and parameterized complexity relating to the above
(e.g., low-width instances, counting small patterns), andconnections between the above and quantum information theory
(e.g., Holant problems, algorithms for tensor networks).
This summer is a great opportunity to have a sabbatical, research visit, or short post-doc job in the beautiful city of Copenhagen, where you can also connect with the world-leading BARC, MIAO, and QMATH groups and other researchers. Graduate students are explicitly invited to participate.
The new ERC Starting Grant CountHom can fund participants with matching research interests as visitors (1-8 weeks), or as post-docs/researchers (≥ 3 months, PhD required), with continuation options.
Local participants
Radu Curticapean (organizer)
counting & parameterized complexity, homomorphisms
Nutan Limaye
algebraic complexity
Thore Husfeldt
algebraic graph algorithms
Paloma Thomé de Lima
graph width parameters
Michael Kastoryano
quantum information theory & tensor networks
Marcin Pilipczuk
parameterized algorithms & structural graph theory
Laura Mančinska
quantum information theory & homomorphisms
David Earl Roberson
quantum information theory & homomorphisms
Tentative weekly focus
June 19-23: algebraic methods for algorithms
June 26-30: CSPs, graph isomorphism and Weisfeiler-Leman
July 3-7: graph isomorphism and Weisfeiler-Leman
July 10-14: ICALP workshop and homomorphism counts
July 17-21: algebraic methods for algorithms (?)
July 24-28: approximate counting
July 31 - Aug 4: approximate counting and algebraic complexity
Aug 7-11: algebraic complexity
Aug 14-18: WAC workshop and algebraic complexity
Aug 21-25: homomorphism counts
Aug 28 - Sep 1: algebraic complexity
Related activities
This event is funded by Radu Curticapean's ERC Starting Grant project CountHom that studies counting problems and algebraic complexity through the lens of homomorphisms.
If you're traveling from afar, you might be interested in combining your visit with other TCS events in Europe:
June 2-4 in Prague 🇨🇿: The IGAFIT Highlights of Algorithms (HALG), which provides a broad picture of the latest research in algorithms.
July 10-14 in Paderborn 🇩🇪: The ad hoc workshop on July 10, which is an ICALP satellite workshop on the mathematical theory and algorithmic aspects of homomorphism counts. And of course ICALP itself, the flagship TCS conference in Europe.
August 14-18 in Göteborg 🇸🇪: The Workshop on Algebra and Computation organized by Nutan Limaye, Srikanth Srinivasan and Devdatt Dubhashi.
September 4-8 in Amsterdam 🇳🇱: The ALGO meeting, an annual conference cluster that combines its main conference ESA with several specialized symposia and workshops.
Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them.