Workshops

Fall 2016

{Symmetry, Logic, Computation}

Nov 7, 2016 to Nov 10, 2016

Return to event »

Click on the titles of individual talks for abstract, slides and archived video.

Monday, November 7th, 2016
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:30 am		Orbit-Finite Sets Mikolaj Bojanczyk, University of Warsaw
10:30 am–11:00 am		Break
11:00 am–11:30 am		The Power of Two Variables Howard Straubing, Boston College
11:30 am–12:00 pm		Towards Capturing Order-Independent P Neil Immerman, University of Massachusetts
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		New Results on Register Automata Andrzej Murawski, University of Warwick
2:30 pm–3:00 pm		Simulation and Bisimulations for Probabilistic Systems, and their Logical Contents Nathanaël Fijalkow, University of Oxford
3:00 pm–3:30 pm		Operations on Languages and Codensity Monads Daniela Petrisan, Université Paris Diderot
3:30 pm–4:00 pm		Break
4:00 pm–4:30 pm		Fibred Categories of Tree Automata Colin Riba, ENS Lyon
4:30 pm–5:00 pm		Pro-Aperiodic Monoids via Saturated Models Sam Van Gool, City College of New York
5:00 pm–6:00 pm		Reception

Tuesday, November 8th, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Lower Bounds for Subgraph Isomorphism and Consequences in First-Order Logic Benjamin Rossman, University of Toronto
10:30 am–11:00 am		Break
11:00 am–11:30 am		A Dichotomy Structure Theorem for the Resilience Problem Cibele Freire, University of Massachusetts
11:30 am–12:00 pm		Symmetric Circuits and Fixed-Point Logics Matthew Anderson, Union College
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		One Eilenberg Theorem to Rule Them All Stefan Milius, Universität Erlangen-Nürnberg
2:30 pm–3:00 pm		A Finite Alternation Result for Reversible Boolean Circuits Peter Selinger, Dalhousie University
3:00 pm–3:30 pm		Graph Isomorphism Via Non-Local Games Simone Severini, University College London
3:30 pm–4:00 pm		Break
4:00 pm–4:30 pm		Extending Symmetric Circuits Gregory Wilsenach, University of Cambridge
4:30 pm–5:00 pm		Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps Christoph Berkholz, Humboldt-Universität zu Berlin

Wednesday, November 9th, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		{Symmetry, Logic, Constraint Satisfaction Problem} Libor Barto, Charles University
10:30 am–11:00 am		Break
11:00 am–11:30 am		Combinatorial Properties of the Weisfeiler-Leman Algorithm Sandra Kiefer, RWTH Aachen
11:30 am–12:00 pm		Approximating Graph Isomorphism through Linear Maps Anuj Dawar, University of Cambridge
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Power and Limits of LP and SDP Relaxations Stanislav Zivny, University of Oxford
2:30 pm–3:00 pm		Reducts of Finitely Bounded Homogeneous Structures, and Lifting Tractability from Finite-Domain Constraint Satisfaction Antoine Mottet, TU Dresden
3:00 pm–3:30 pm		Finite Duality, Connectivity of Homomorphisms, Spatial Mixing and Gibbs Measures Andrei Bulatov, Simon Fraser University
3:30 pm–4:00 pm		Break
4:00 pm–4:30 pm		FO-Definable Constraint Satisfaction Problems Joanna Ochremiak, Universitat Politecnica de Catalunya
4:30 pm–5:00 pm		Braid Groups, Hecke Algebras, Representations, and Anyons Andreas Blass, University of Michigan

Thursday, November 10th, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:00 am		Functional Programming Over Sets with Atoms Bartek Klin, University of Warsaw
10:00 am–10:30 am		Logic and Bisimulation for Guarded Teams Erich Grädel, RWTH Aachen University
10:30 am–11:00 am		Break
11:00 am–11:30 am		Logic in Computer Science, Engineering and Industry Yuri Gurevich, Microsoft Research
11:30 am–12:00 pm		Symmetry-Preserving Finite Synthesis and Amalgamation Martin Otto, Technische Universität Darmstadt
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Logics of Finite Hankel Rank Johann Makowsky, Technion Israel Institute of Technology
2:30 pm–3:00 pm		The Logic of Counting Query Answers Hubie Chen, Universidad del País Vasco
3:00 pm–3:30 pm		Near-Optimal Expanding Generating Sets for Solvable Permutation Groups Prajakta Nimbhorkar, Chennai Mathematical Institute
3:30 pm–4:00 pm		Break
4:00 pm–4:30 pm		Testing Assignments to Constraint Satisfaction Problems Matt Valeriote, McMaster University
4:30 pm–5:00 pm		The Expressiveness of Recognizability by Orbite Finite Nominal Monoids Thomas Colcombet, IRIF