Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted Identifying Code, (Open) Open Locating-Dominating Set and Metric Dimension) of an interval or a permutation graph. In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices, using either the neighbourhood within the solution set or the distances to the solution vertices. Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for interval graphs of diameter 2 and permutation graphs of diameter 2. While Identifying Code and (Open) Locating-Dominating Set are trivially fixed-parameter-tractable when parameterized by solution size, it is known that in the same setting Metric Dimension is W[2]-hard. We show that for interval graphs, this parameterization of Metric Dimension is fixed-parameter-tractable

Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$. In this paper, we classify all finite digraphs which only admit their whole vertex set in any identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well known theorem of A. Bondy on set systems we classify the extremal cases for this theorem

A glimpse into Thurston's work

We present an overview of some significant results of Thurston and their impact on mathematics. The final version of this paper will appear as Chapter 1 of the book "In the tradition of Thurston: Geometry and topology", edited by K. Ohshika and A. Papadopoulos (Springer, 2020)

Gaussian automorphisms whose ergodic self-joinings are Gaussian

 We study ergodic properties of the class of Gaussian automorphisms whose ergodic self-joinings remain Gaussian. For such automorphisms we describe the structure of their factors and of their centralizer. We show that Gaussian automorphisms with simple spectrum belong to this class.  We prove a new sufficient condition for non-disjointness of automorphisms giving rise to a better understanding of Furstenberg's problem relating disjointness to the lack of common factors. This and an elaborate study of isomorphisms between classical factors of Gaussian automorphisms allow us to give a complete solution of the disjointness problem between a Gaussian automorphism whose ergodic self-joinings remain Gaussian and an arbitrary Gaussian automorphism