Related papers: On Kim-Independence

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…

We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…

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…

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in (Kontinen and Vaananen 2013) and (Hannula 2015). We prove a characterization…

We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…

We continue the study of $n$-dependent groups, fields and related structures, largely motivated by the conjecture that every $n$-dependent field is dependent. We provide evidence towards this conjecture by showing that every infinite…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…

Spherical and hyperspherical data are commonly encountered in diverse applied research domains, underscoring the vital task of assessing independence within such data structures. In this context, we investigate the properties of test…

We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…

A recent article of Chernikov, Hrushovski, Kruckman, Krupinski, Moconja, Pillay and Ramsey finds the first examples of simple structures with formulas which do not fork over $\emptyset$ but are universally measure zero. In this article we…

The notion of a tensor product with projections or with inclusions is defined. It is shown that the definition of stochastic independence relies on such a structure and that independence can be defined in an arbitrary category with a tensor…

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…

We propose some formulations of the notion of "operational independence" of two subsystems of a larger quantum system and clarify their relation to other independence concepts in the literature. In addition, we indicate why the operational…

This paper provides a full controlled version of algebraic $K$-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem…

We prove a non-linear version of a theorem of Grayson which is an analogue of the Fundamental Theorem of Algebraic $K$-theory and identify the $K$-theory of the endomorphism category over a space $X$ in terms of reduced $K$-theory of a…

In this article we study various forms of $\ell$-independence (including the case $\ell=p$) for the cohomology and fundamental groups of varieties over finite fields and equicharacteristic local fields. Our first result is a strong form of…

We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…

In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we…

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…