Related papers: The generic pair conjecture for dependent finite d…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
A new case of Shelah's eventual categoricity conjecture is established: $\mathbf{Theorem}$ Let $K$ be an AEC with amalgamation. Write $H_2 := \beth_{\left(2^{\beth_{\left(2^{\text{LS} (K)}\right)^+}}\right)^+}$. Assume that $K$ is…
We give a short overview of the proof of Shelah's eventual categoricity conjecture in universal classes with amalgamation in arXiv:1506.07024 .
This is the second part of a work initiated in \cite{GaHa}, where we constructed a model category, $\Qt$, for set theory. In the present paper we use this model category to introduce homotopy-theoretic intuitions to set theory. Our main…
Kobayashi-Ochiai proved that the set of dominant maps from a fixed variety to a fixed variety of general type is finite. We prove the natural extension of their finiteness theorem to Campana's orbifold pairs.
We prove: $\mathbf{Theorem}$ Let $K$ be a universal class. If $K$ is categorical in cardinals of arbitrarily high cofinality, then $K$ is categorical on a tail of cardinals. The proof stems from ideas of Adi Jarden and Will Boney, and also…
In this note, we extend the theories of the canonical bundle formula and adjunction to the case of generalized pairs. As an application, we study a particular case of a conjecture by Prokhorov and Shokurov.
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…
We prove that a universal class categorical in a high-enough cardinal is categorical on a tail of cardinals. As opposed to other results in the literature, we work in ZFC, do not require the categoricity cardinal to be a successor, do not…
In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an…
We prove the finiteness of $B$-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation.…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
We present a category theoretical generalization of the Goussarov theorem for finite type invariants, relating generating sets for generalized finite type theories with diagrams systems for the corresponding topological objects. We will…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
We prove a Generic Vanishing Theorem for coherent sheaves on an abelian variety over an algebraically closed field $k$. When $k=\CC$ this implies a conjecture of Green and Lazarsfeld.
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.