Sebastien Vasey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sebastien Vasey has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jiří Rosický
Masaryk University
9 shared publications - Michael Lieberman
Department of Mathematics and Statistics, Faculty of Science, Masaryk University, Brno, Czech Republic
9 shared publications - Will Boney
Department of Mathematics, Harvard University, Cambridge, USA
5 shared publications - Saharon Shelah
The Hebrew University of Jerusalem
3 shared publications - Hossein Estiri
Massachusetts General Hospital
2 shared publications - Leonid Positselski
Institute of Mathematics, Czech Academy of Sciences, Prague 1, Czech Republic
2 shared publications
Latest Publications
- Open Access
- 15 May 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 26 (7) , 2301-2372
Categoricity and multidimensional diagrams
We study multidimensional diagrams in independent amalgamation in the framework of abstract elementary classes (AECs). We use them to prove the eventual categoricity conjecture for AECs, assuming a large cardinal axiom. More precisely, we show assuming the existence of a proper class of strongly compact cardinals that an AEC which has a single model of some high enough cardinality will have a single model in any high enough cardinal. Assuming a weak version of the generalized continuum hypothesis, we also establish the eventual categoricity conjecture for AECs with amalgamation.
- 15 May 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 26 (7) , 2301-2372
Open AccessCategoricity and multidimensional diagrams
We study multidimensional diagrams in independent amalgamation in the framework of abstract elementary classes (AECs). We use them to prove the eventual categoricity conjecture for AECs, assuming a large cardinal axiom. More precisely, we show assuming the existence of a proper class of strongly compact cardinals that an AEC which has a single model of some high enough cardinality will have a single model in any high enough cardinal. Assuming a weak version of the generalized continuum hypothesis, we also establish the eventual categoricity conjecture for AECs with amalgamation.
- Open Access
Categoricity and multidimensional diagrams
We study multidimensional diagrams in independent amalgamation in the framework of abstract elementary classes (AECs). We use them to prove the eventual categoricity conjecture for AECs, assuming a large cardinal axiom. More precisely, we show assuming the existence of a proper class of strongly compact cardinals that an AEC which has a single model of some high-enough cardinality will have a single model in any high-enough cardinal. Assuming a weak version of the generalized continuum hypothesis, we also establish the eventual categoricity conjecture for AECs with amalgamation.
Open AccessCategoricity and multidimensional diagrams
We study multidimensional diagrams in independent amalgamation in the framework of abstract elementary classes (AECs). We use them to prove the eventual categoricity conjecture for AECs, assuming a large cardinal axiom. More precisely, we show assuming the existence of a proper class of strongly compact cardinals that an AEC which has a single model of some high-enough cardinality will have a single model in any high-enough cardinal. Assuming a weak version of the generalized continuum hypothesis, we also establish the eventual categoricity conjecture for AECs with amalgamation.
- 18 May 2022
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 88 (2) , 811-834
CELLULAR CATEGORIES AND STABLE INDEPENDENCE
We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický.
- 18 May 2022
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 88 (2) , 811-834
CELLULAR CATEGORIES AND STABLE INDEPENDENCE
We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický.
- Open Access
- 12 October 2020
- Published by Oxford University Press (OUP) in Journal of the American Medical Informatics Association
- Vol. 28 (3) , 559-568
Generative transfer learning for measuring plausibility of EHR diagnosis records
Objective: Due to a complex set of processes involved with the recording of health information in the Electronic Health Records (EHRs), the truthfulness of EHR diagnosis records is questionable. We present a computational approach to estimate the probability that a single diagnosis record in the EHR reflects the true disease. Materials and Methods: Using EHR data on 18 diseases from the Mass General Brigham (MGB) Biobank, we develop generative classifiers on a small set of disease-agnostic features from EHRs that aim to represent Patients, pRoviders, and their Interactions within the healthcare SysteM (PRISM features). Results: We demonstrate that PRISM features and the generative PRISM classifiers are potent for estimating disease probabilities and exhibit generalizable and transferable distributional characteristics across diseases and patient populations. The joint probabilities we learn about diseases through the PRISM features via PRISM generative models are transferable and generalizable to multiple diseases. Discussion: The Generative Transfer Learning (GTL) approach with PRISM classifiers enables the scalable validation of computable phenotypes in EHRs without the need for domain-specific knowledge about specific disease processes. Conclusion: Probabilities computed from the generative PRISM classifier can enhance and accelerate applied Machine Learning research and discoveries with EHR data.
- 12 October 2020
- Published by Oxford University Press (OUP) in Journal of the American Medical Informatics Association
- Vol. 28 (3) , 559-568
Open AccessGenerative transfer learning for measuring plausibility of EHR diagnosis records
Objective: Due to a complex set of processes involved with the recording of health information in the Electronic Health Records (EHRs), the truthfulness of EHR diagnosis records is questionable. We present a computational approach to estimate the probability that a single diagnosis record in the EHR reflects the true disease. Materials and Methods: Using EHR data on 18 diseases from the Mass General Brigham (MGB) Biobank, we develop generative classifiers on a small set of disease-agnostic features from EHRs that aim to represent Patients, pRoviders, and their Interactions within the healthcare SysteM (PRISM features). Results: We demonstrate that PRISM features and the generative PRISM classifiers are potent for estimating disease probabilities and exhibit generalizable and transferable distributional characteristics across diseases and patient populations. The joint probabilities we learn about diseases through the PRISM features via PRISM generative models are transferable and generalizable to multiple diseases. Discussion: The Generative Transfer Learning (GTL) approach with PRISM classifiers enables the scalable validation of computable phenotypes in EHRs without the need for domain-specific knowledge about specific disease processes. Conclusion: Probabilities computed from the generative PRISM classifier can enhance and accelerate applied Machine Learning research and discoveries with EHR data.
- 1 October 2020
- Published by Elsevier in Journal of Algebra
- Vol. 560, 1297-1310
Cofibrant generation of pure monomorphisms
- 1 October 2020
- Published by Elsevier in Journal of Algebra
- Vol. 560, 1297-1310
Cofibrant generation of pure monomorphisms
- 26 September 2020
- Published by Springer Nature
- p. 414-424
Transitive Sequential Pattern Mining for Discrete Clinical Data
- 26 September 2020
- Published by Springer Nature
- p. 414-424
Transitive Sequential Pattern Mining for Discrete Clinical Data
- 20 July 2020
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 87 (2) , 545-563
ON CATEGORICITY IN SUCCESSIVE CARDINALS
We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb {L}_{\omega _1, \omega }$ sentence categorical on an end segment of cardinals below $\beth _\omega $ must be categorical also everywhere above $\beth _\omega $ . This is done without any additional model-theoretic hypotheses (such as amalgamation or arbitrarily large models) and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.- 20 July 2020
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 87 (2) , 545-563
ON CATEGORICITY IN SUCCESSIVE CARDINALS
We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb {L}_{\omega _1, \omega }$ sentence categorical on an end segment of cardinals below $\beth _\omega $ must be categorical also everywhere above $\beth _\omega $ . This is done without any additional model-theoretic hypotheses (such as amalgamation or arbitrarily large models) and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.- 20 May 2020
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 238 (1) , 243-278
Sizes and filtrations in accessible categories
- 20 May 2020
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 238 (1) , 243-278
Sizes and filtrations in accessible categories
- Open Access
On categoricity in successive cardinals
We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb{L}_{\omega_1, \omega}$ sentence categorical on an end segment of cardinals below $\beth_\omega$ must be categorical also everywhere above $\beth_\omega$. This is done without any additional model-theoretic hypotheses (such as amalgamation or arbitrarily large models) and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.Open AccessOn categoricity in successive cardinals
We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb{L}_{\omega_1, \omega}$ sentence categorical on an end segment of cardinals below $\beth_\omega$ must be categorical also everywhere above $\beth_\omega$. This is done without any additional model-theoretic hypotheses (such as amalgamation or arbitrarily large models) and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.