COIN, or Coalgebra in the Netherlands, is a seminar taking place alternating at the Radboud University in Nijmegen and the CWI in Amsterdam. The aim of COIN is to bring together coalgebra researchers from various locations in the Netherlands, and share current results and questions in the world of coalgebra. We welcome presentations on any subject related to coalgebra. As usual, everyone who is interested is cordially invited to come.

Speakers:
Julian Salamanca: Equations and Coequations for Weighted Automata.
Renato Neves: Towards a calculus of hybrid components
Henning Basold: Dependent Inductive and Coinductive Types via Dialgebras in Fibrations

For more information, see http://cs.ru.nl/~hbasold/coin.

The Parallel Repetition Theorem is an important tool in complexity theory and cryptography, used to amplify the hardness of multiplayer games. It roughly states that if a game G, involving two non-communicating players, has value p, then the two-player game G^n -- n independent instances of G in parallel -- has value f(p,G)^n, where f(p,G) is some (complicated) function of p and the game. Recently, there has been much interest in proving a quantum analogue of the Parallel Repetition Theorem, where the players are allowed to use quantum entanglement as part of their strategy. We give improved parallel repetition theorems for entangled games in the case that the players' inputs are uncorrelated.

For more information, contact Ronald de Wolf (rdewolf at cwi.nl)

On Friday 5th of June there will be a workshop in honour of Professor Stephen Yablo (MIT). Yablo is a world-leading figure in metaphysics, philosophical logic, philosophy of language, philosophy of mathematics and philosophy of mind. The workshop will consist of three talks addressing different aspects of Yablo's work and will conclude with a keynote address by Yablo himself.

The workshop is free and you can simply turn up on the day, but if you are definitely planning to attend please email Luca Incurvati. For more information, please contact L.Incurvati at uva.nl.

For more information, see http://www.illc.uva.nl/lgc/seminar

For more information, see here or contact M.D.Aloni at uva.nl. After the talk there will be drinks to celebrate Henk's 25 year jubilee at the UvA.

For abstracts and more information, see http://www.illc.uva.nl/LoLa/DIP-Colloquium/.

We use the entanglement sampling techniques developed in (Dupuis et al., 2015) to find a lower bound on the entanglement needed by a coalition of cheaters attacking the quantum postition verification protocol using the four BB84 states (QPVBB84) in the scenario where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled state Φ. For a protocol using n qubits, a necessary condition for cheating is that the max-relative entropy of entanglement E_max(Φ) ≥ n − O(log n). This improves previously known best lower bound by a factor approx. 4, and it is essentially tight, since the protocol is vulnerable to a teleportation-based attack using n − O(1) ebits of entanglement.

For more information, see the article at http://arxiv.org/abs/1504.07171 or contact Christian Schaffner (c.schaffner at uva.nl).

The ILLC Colloquium is a half-yearly festive event (either the New Year's Colloquium, the Midsummernight Colloquium or the Midwinter Colloquium) that brings together the three research groups at the ILLC. Each colloquium consists of three main talks by representatives from the Logic and Language group, the Language and Computation group and the Logic and Computation group, which are occasionally followed by Wild Idea Talks. The colloquium is concluded by a get together of the entire ILLC community.

For more information, see http://www.illc.uva.nl/ILLCColloquium/

Inaugural lecture of Jeannette Schaeffer, professor of Language Acquisition.

For more information, see j.c.schaeffer at uva.nl

For more information, see http://www.cs.vu.nl/~tcs/seminar or here.

For abstracts and more information, see http://www.staff.science.uu.nl/~ooste110/seminar.html or contact Benno van den Berg (bennovdberg at gmail.com).