Related papers: Remarks on NIP in a model
We consider models for inference which involve observers which may have multiple copies, such as in the Sleeping Beauty problem. We establish a framework for describing these problems on a probability space satisfying Kolmogorov's axioms,…
In the context of generating uniform random contingency tables with pre-specified marginals, the number of (binary) matrices with given row- and column-sums is a well-studied object in the literature. We will denote this number by $N(p,q)$,…
For a first-order formula $\phi(x;y)$ we introduce and study the characteristic sequence $<P_n : n < \omega>$ of hypergraphs defined by $P_n(y_1,...,y_n) := (\exists x) \bigwedge_{i \leq n} \phi(x;y_i)$. We show that combinatorial and…
Let $R$ be a commutative ring $R$ with $1_R$ and with group of units $R^{\times}$. Let $\Phi = \Phi(t_1,\ldots, t_h) = \sum_{i=1}^h \varphi_it_i$ be an $h$-ary linear form with nonzero coefficients $\varphi_1,\ldots, \varphi_h \in R$. Let…
We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen lifting properties %(negation) of certain…
In this paper, we introduce the notion of bi-homotopy between subsets of continuous functions. A map $\phi$ from $A$ to $B$ is called an $h$-map if, for each two homotopic maps $f, g\in A$, their image (i.e., $\phi(f), \phi(g)$) are…
We apply the work of Bourgain, Fremlin and Talagrand on compact subsets of the first Baire class to show new results about phi-types for phi NIP. In particular, we show that if M is a countable model, then an M-invariant phi-type is Borel…
Let $G$ be a multiplicative subgroup of $\mathbb{Q}_p$. In this paper, we describe the theory of the pair $(\mathbb{Q}_p, G)$ under the condition that $G$ satisfies Mann property and is small as subset of a first-order structure. First, we…
We prove the existence of a model companion of the two-sorted theory of $c$-nilpotent Lie algebras over a field satisfying a given theory of fields. We describe a language in which it admits relative quantifier elimination up to the field…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
While many different models for $(\infty,1)$-categories are currently being used, it is known that they are Quillen equivalent to one another. Several higher-order analogues of them are being developed as models for $(\infty,…
We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…
We present an overview of results on the question of whether the non-stationary ideal of an uncountable regular cardinal $\kappa$ can be defined by a $\Pi_1$-formula using parameters of hereditary cardinality at most $\kappa$. These results…
In this paper we introduce the models for $(\infty, n)$-categories which have been developed to date, as well as the comparisons between them that are known and conjectured. We review the role of $(\infty, n)$-categories in the proof of the…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
Over the course of the last 50 years, many questions in the field of computability were left surprisingly unanswered. One example is the question of $P$ vs $NP\cap co-NP$. It could be phrased in loose terms as "If a person has the ability…
For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…
We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…