English
Related papers

Related papers: Independence in generic incidence structures

200 papers

It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…

Quantum Physics · Physics 2024-03-14 David Schmid , John H. Selby , Matthew F. Pusey , Robert W. Spekkens

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

Logic · Mathematics 2016-02-09 Saharon Shelah

For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of a transitive tournament. We prove that almost every…

Combinatorics · Mathematics 2026-05-26 Meili Liang , Yue Guan , Ruiling Zheng , Jianxi Liu

We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…

Logic · Mathematics 2013-08-14 Itaï Ben Yaacov , Artem Chernikov

We develop the theory of Kim-independence in the context of NSOP$_{1}$ theories satsifying the existence axiom. We show that, in such theories, Kim-independence is transitive and that $\ind^{K}$-Morley sequences witness Kim-dividing. As…

Logic · Mathematics 2023-06-05 Artem Chernikov , Byunghan Kim , Nicholas Ramsey

We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free…

Combinatorics · Mathematics 2014-01-21 Pavle Blagojević , Boris Bukh , Roman Karasev

This course introduces the fruitful links between model theory and a combinatoric of sets given by independence relations. An independence relation on a set is a ternary relation between subsets. Chapter 1 should be considered as an…

Logic · Mathematics 2025-01-28 Christian d'Elbée

Let $E$ be an elliptic curve, with identity $O$, and let $C$ be a cyclic subgroup of odd order $N$, over an algebraically closed field $k$ with $\operatorname{char} k \nmid N$. For $P \in C$, let $s_P$ be a rational function with divisor $N…

Number Theory · Mathematics 2021-06-29 Bradley W. Brock , Bruce W. Jordan , Bjorn Poonen , Anthony J. Scholl , Joseph L. Wetherell

We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…

Logic · Mathematics 2025-04-01 Artem Chernikov , Nadja Hempel

We show that approximations of strict order can calibrate the fine structure of genericity. Particularly, we find exponential behavior within the $\mathrm{NSOP}_{n}$ hierarchy from model theory. Let $0$-$\eth$-independence denote…

Logic · Mathematics 2023-05-31 Scott Mutchnik

In this paper an example of a $k$-independent $(n,k)$-type GKM-graph without nontrivial extensions is constructed for any $n\geq k\geq 3$. It is shown that this example cannot be realized by a GKM-manifold for any $n=k=3$ or $n\geq k\geq…

Combinatorics · Mathematics 2022-05-17 Grigory Solomadin

In a previous paper [Pearl and Verma, 1991] we presented an algorithm for extracting causal influences from independence information, where a causal influence was defined as the existence of a directed arc in all minimal causal models…

Artificial Intelligence · Computer Science 2013-03-25 Tom S. Verma , Judea Pearl

We investigate the distribution of zeros of the independence polynomial ${\rm I}(G, x)$ for the family of Generalized Petersen graphs ${\rm GP}(n, k)$ in the complex plane. While the independence numbers and coefficients of these graphs…

Combinatorics · Mathematics 2026-01-08 Rohan Pandey

We wish to test whether a real-valued variable $Z$ has explanatory power, in addition to a multivariate variable $X$, for a binary variable $Y$. Thus, we are interested in testing the hypothesis $\mathbb{P}(Y=1\, | \, X,Z)=\mathbb{P}(Y=1\,…

Methodology · Statistics 2025-12-23 John H. J. Einmahl , Denis Kojevnikov , Bas J. M. Werker

We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there…

Logic · Mathematics 2013-08-15 Artem Chernikov

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

Logic · Mathematics 2026-05-06 Samuel Braunfeld , Michael C. Laskowski

Kim's Lemma is a key ingredient in the theory of forking independence in simple theories. It asserts that if a formula divides, then it divides along every Morley sequence in type of the parameters. Variants of Kim's Lemma have formed the…

Logic · Mathematics 2024-08-14 Alex Kruckman , Nicholas Ramsey

The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying probability space. We study various notions…

Logic · Mathematics 2014-09-05 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

We study the generic theory of algebraically closed fields of fixed positive characteristic with a predicate for an additive subgroup, called $\mathrm{ACFG}$. This theory was introduced recently as a new example of $\mathrm{NSOP}_1$ non…

Logic · Mathematics 2019-11-01 Christian d'Elbée

Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…

Logic in Computer Science · Computer Science 2025-05-23 Wojciech Przybyszewski , Szymon Toruńczyk