Related papers: Lecture notes on infinity-properads
We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known…
Several notions of multiplicativity are introduced for forms of degree $d\geq 3$ over a field of characteristic 0 or greater than d. Examples of multiplicative and strongly multiplicative forms of higher degree are given. Conditions…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that…
These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…
Motivated by works on extension sets in standard domains we introduce a notion of the Carath\'eodory set that seems better suited for the methods used in proofs of results on characterization of extension sets. A special stress is put on a…
This set of lecture notes constitutes the free textbook project I initiated towards the end of Summer 2015, while preparing for the Fall 2015 Analytical Methods in Physics course I taught to upper level undergraduates at the University of…
Dendroidal sets have been introduced as a combinatorial model for homotopy coherent operads. We introduce the notion of fully Kan dendroidal sets and show that there is a model structure on the category of dendroidal sets with fibrant…
These lectures give a short introduction to the study of curves on algebraic varieties. After an elementary proof of the dimension formula for the space of curves, we summarize the basic properties of uniruled and of rationally connected…
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…
A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…
This is a write-up of some lectures I gave in the Fall of 2021 at the Fields Institute in Toronto, as part of the Thematic Programme on Trends in Pure and Applied Model Theory. The goal of the module was to give a quick introduction to the…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…
This article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures. We introduce the notion of grading by multiary groups and investigate…
The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in…
We introduce the study of parametrized higher category theory and parametrized higher algebra, and we describe the main theorems of the series of Expos\'es that make up the monograph.
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…