Pierre Simon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pierre Simon has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Itay Kaplan
Einstein Institute of Mathematics, Hebrew University of Jerusalem, 91904, Jerusalem, Israel
7 shared publications - Szymon Toruńczyk
University of Warsaw, Warsaw, Poland
3 shared publications - Alf Onshuus
Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia
2 shared publications - Martin Bays
Mathematical Institute, University of Oxford, Andrew Wiles Building, Radcliffe Observatory Quarter, Woodstock Road, Oxford OX2 6GG, UK
2 shared publications - Martin Bays
Universität Münster, Münster, Germany
2 shared publications - Nicholas Ramsey
University of Notre Dame
2 shared publications
Latest Publications
- 10 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Dependent finitely homogeneous rosy structures
We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington and Lachlan proved for [Formula: see text]-stable [Formula: see text]-categorical structures. In particular, we prove that such structures have finite þ-rank and are coordinatized by a þ-rank 1 set. We show that they admit a distal, finitely axiomatizable, expansion. These results show that there are, up to inter-definability, at most countably many dependent rosy structures [Formula: see text] which are homogeneous in a finite relational language.
- 10 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Dependent finitely homogeneous rosy structures
We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington and Lachlan proved for [Formula: see text]-stable [Formula: see text]-categorical structures. In particular, we prove that such structures have finite þ-rank and are coordinatized by a þ-rank 1 set. We show that they admit a distal, finitely axiomatizable, expansion. These results show that there are, up to inter-definability, at most countably many dependent rosy structures [Formula: see text] which are homogeneous in a finite relational language.
- 14 October 2026
- Published by European Mathematical Society - EMS - Publishing House GmbH
- p. 171-191
Some NIP-like phenomena in NTP₂
We introduce the notion of an NTP${2}$-smooth measure and prove that they exist assuming NTP${2}$. Using this, we propose a notion of distality in NTP${2}$ that unfortunately does not intersect simple theories trivially. We then prove a finite alternation theorem for a subclass of NTP${2}$ that contains resilient theories. In the last section we prove that under NIP, any type over a model of singular size is finitely satisfiable in a smaller model, and ask if a parallel result (with non-forking replacing finite satisfiability) holds in NTP$\_{2}$.
- 14 October 2026
- Published by European Mathematical Society - EMS - Publishing House GmbH
- p. 171-191
Some NIP-like phenomena in NTP₂
We introduce the notion of an NTP${2}$-smooth measure and prove that they exist assuming NTP${2}$. Using this, we propose a notion of distality in NTP${2}$ that unfortunately does not intersect simple theories trivially. We then prove a finite alternation theorem for a subclass of NTP${2}$ that contains resilient theories. In the last section we prove that under NIP, any type over a model of singular size is finitely satisfiable in a smaller model, and ask if a parallel result (with non-forking replacing finite satisfiability) holds in NTP$\_{2}$.
- 11 April 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (4) , 1410-1439
DP AND OTHER MINIMALITIES
A first-order expansion of $(\mathbb {R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, p -adic fields, ordered abelian groups with only finitely many convex subgroups (in particular archimedean ordered abelian groups), and abelian groups equipped with archimedean cyclic group orders. The latter allows us to describe unary definable sets in dp-minimal expansions of $(\mathbb {Z},+,S)$ , where S is a cyclic group order. Along the way we describe unary definable sets in dp-minimal expansions of ordered abelian groups. In the last section we give a canonical correspondence between dp-minimal expansions of $(\mathbb {Q},+,<)$ and o-minimal expansions ${\mathscr R}$ of $(\mathbb {R},+,<)$ such that $({\mathscr R},\mathbb {Q})$ is a “dense pair.”.- 11 April 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (4) , 1410-1439
DP AND OTHER MINIMALITIES
A first-order expansion of $(\mathbb {R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, p -adic fields, ordered abelian groups with only finitely many convex subgroups (in particular archimedean ordered abelian groups), and abelian groups equipped with archimedean cyclic group orders. The latter allows us to describe unary definable sets in dp-minimal expansions of $(\mathbb {Z},+,S)$ , where S is a cyclic group order. Along the way we describe unary definable sets in dp-minimal expansions of ordered abelian groups. In the last section we give a canonical correspondence between dp-minimal expansions of $(\mathbb {Q},+,<)$ and o-minimal expansions ${\mathscr R}$ of $(\mathbb {R},+,<)$ such that $({\mathscr R},\mathbb {Q})$ is a “dense pair.”.- Open Access
- 13 June 2024
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 71 (3) , 1-45
Twin-Width IV: Ordered Graphs and Matrices
We establish a list of characterizations of bounded twin-width for hereditary classes of totally ordered graphs: as classes of at most exponential growth studied in enumerative combinatorics, as monadically NIP classes studied in model theory, as classes that do not transduce the class of all graphs studied in finite model theory, and as classes for which model checking first-order logic is fixed-parameter tractable studied in algorithmic graph theory. This has several consequences. First, it allows us to show that every hereditary class of ordered graphs either has at most exponential growth, or has at least factorial growth. This settles a question first asked by Balogh et al. [ 5 ] on the growth of hereditary classes of ordered graphs, generalizing the Stanley-Wilf conjecture/Marcus-Tardos theorem. Second, it gives a fixed-parameter approximation algorithm for twin-width on ordered graphs. Third, it yields a full classification of fixed-parameter tractable first-order model checking on hereditary classes of ordered binary structures. Fourth, it provides a model-theoretic characterization of classes with bounded twin-width. Finally, it settles the small conjecture [ 8 ] in the case of ordered graphs.
- 13 June 2024
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 71 (3) , 1-45
Open AccessTwin-Width IV: Ordered Graphs and Matrices
We establish a list of characterizations of bounded twin-width for hereditary classes of totally ordered graphs: as classes of at most exponential growth studied in enumerative combinatorics, as monadically NIP classes studied in model theory, as classes that do not transduce the class of all graphs studied in finite model theory, and as classes for which model checking first-order logic is fixed-parameter tractable studied in algorithmic graph theory. This has several consequences. First, it allows us to show that every hereditary class of ordered graphs either has at most exponential growth, or has at least factorial growth. This settles a question first asked by Balogh et al. [ 5 ] on the growth of hereditary classes of ordered graphs, generalizing the Stanley-Wilf conjecture/Marcus-Tardos theorem. Second, it gives a fixed-parameter approximation algorithm for twin-width on ordered graphs. Third, it yields a full classification of fixed-parameter tractable first-order model checking on hereditary classes of ordered binary structures. Fourth, it provides a model-theoretic characterization of classes with bounded twin-width. Finally, it settles the small conjecture [ 8 ] in the case of ordered graphs.
- Open Access
- 8 April 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12
Generic Stability Independence and Treeless Theories
- 8 April 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12
Open AccessGeneric Stability Independence and Treeless Theories
- 18 February 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 27 (7) , 2751-2793
Density of compressible types and some consequences
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we obtain explicit uniform honest definitions for NIP formulas (answering a question of Eshel and the second author), and build compressible models in countable NIP theories.
- 18 February 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 27 (7) , 2751-2793
Density of compressible types and some consequences
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we obtain explicit uniform honest definitions for NIP formulas (answering a question of Eshel and the second author), and build compressible models in countable NIP theories.
- Open Access
- 4 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- Vol. 23 (5) , 2159-2173
ON LARGE EXTERNALLY DEFINABLE SETS IN NIP
We study cofinal systems of finite subsets of $\omega _1$ . We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: In an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.- 4 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- Vol. 23 (5) , 2159-2173
Open AccessON LARGE EXTERNALLY DEFINABLE SETS IN NIP
We study cofinal systems of finite subsets of $\omega _1$ . We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: In an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals. - Open Access
- 21 October 2023
- Published by Mathematical Sciences Publishers in Model Theory
- Vol. 2 (2) , 255-284
Residue field domination in some henselian valued fields
We generalize previous results about stable domination and residue field domination to henselian valued fields of equicharacteristic 0 with bounded Galois group, and we provide an alternate characterization of stable domination in algebraically closed valued fields for types over parameters in the field sort.
- 21 October 2023
- Published by Mathematical Sciences Publishers in Model Theory
- Vol. 2 (2) , 255-284
Open AccessResidue field domination in some henselian valued fields
We generalize previous results about stable domination and residue field domination to henselian valued fields of equicharacteristic 0 with bounded Galois group, and we provide an alternate characterization of stable domination in algebraically closed valued fields for types over parameters in the field sort.
- Open Access
On large externally definable sets in NIP
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.Open AccessOn large externally definable sets in NIP
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals. - Open Access
Generic Stability Independence and Treeless theories
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories contains both binary theories and stable theories and give several applications of the theory of independence for treeless theories. As a corollary, we show that every binary NSOP$_{3}$ theory is simple.
Open AccessGeneric Stability Independence and Treeless theories
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories contains both binary theories and stable theories and give several applications of the theory of independence for treeless theories. As a corollary, we show that every binary NSOP$_{3}$ theory is simple.