Related papers: Indiscernibles in monadically NIP theories
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
We examine indivisibility for classes of graphs. We show that the class of hereditarily $\alpha$-sparse graphs is indivisible if and only if $\alpha > 2$. Additionally, we show that the following classes of graphs are indivisible: perfect…
A theory of $\infty$-properads is developed, extending both the Joyal-Lurie $\infty$-categories and the Cisinski-Moerdijk-Weiss $\infty$-operads. Every connected wheel-free graph generates a properad, giving rise to the graphical category…
Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a…
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…
This text is an introduction to the study of NIP (or dependent) theories. It is meant to serve two purposes. The first is to present various aspects of NIP theories and give the reader the background material needed to understand almost any…
We consider piecewise expanding maps of the interval with finitely many branches of monotonicity and show that they are generically combinatorially stable, i.e., the number of ergodic attractors and their corresponding mixing periods do not…
We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
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,…
We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork…
We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…
We describe some families of differentiable vector fields with the Hopf bifurcation at infinity, without assuming the continuous differentiability. These vector fields have isolated singular points on the plane, and the initial families are…
In [13], it is proved that any subgroup of $\mathrm{Diff}_{+}^{\omega }(I)$ (the group of orientation preserving analytic diffeomorphisms of the interval) is either metaabelian or does not satisfy a law. A stronger question is asked whether…
This paper is a sequel to [1] and considers definability in differential-henselian monotone fields with c-map and angular component map. We prove an Equivalence Theorem among whose consequences are a relative quantifier reduction and an NIP…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Let $\mathcal{K}=(K,v,\ldots)$ be a dp-minimal expansion of a non-trivially valued field of characteristic $0$ and $\mathcal{F}$ an infinite field interpretable in $\mathcal{K}$. Assume that $\mathcal{K}$ is one of the following: (i)…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…