Related papers: NSOP$_1$-like independence in AECats
We give simple homological conditions for a rational homology 3-sphere Y to have infinite order in the rational homology cobordism group, and for a collection of rational homology spheres to be linearly independent. These translate…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic…
Periodic orbits for the classical $\phi^4$ theory on the one dimensional lattice are systematically constructed by extending the normal modes of the harmonic theory, for periodic, fixed and free boundary conditions. Through the process, we…
We explain how structures analogous to those appearing in the theory of stability conditions on abelian and triangulated categories arise in geometric invariant theory. This leads to an axiomatic notion of a central charge on a scheme with…
New Foundations ($\mathrm{NF}$) is a set theory obtained from naive set theory by putting a stratification constraint on the comprehension schema; for example, it proves that there is a universal set $V$. $\mathrm{NFU}$ ($\mathrm{NF}$ with…
A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…
By generalizing the algebra of operators of the Asymmetric Simple Exclusion Process (ASEP), a multi-species ASEP in which particles can overtake each other,is defined on both open and closed one dimensional chains. On the ring the steady…
Conditional independence has been widely used in AI, causal inference, machine learning, and statistics. We introduce categoroids, an algebraic structure for characterizing universal properties of conditional independence. Categoroids are…
We produce infinite families of knots $\{K^i\}_{i\geq 1}$ for which the set of cables $\{K^i_{p,1}\}_{i,p\geq 1}$ is linearly independent in the knot concordance group. We arrange that these examples lie arbitrarily deep in the solvable and…
We study two axioms for social choice functions that capture the impact of similar candidates: independence of clones (IoC) and composition consistency (CC). We clarify the relationship between these axioms by observing that CC is strictly…
We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…
We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We determine the structure of category $\cO$ for the rational Cherednik algebra of $G(m,1,n)$ in the case where the $\KZ$ functor satisfies a condition called \emph{separating simples}. As a consequence, we show that the property of having…
Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…
We show that many definitions of stability found in the learning theory literature are equivalent to one another. We distinguish between two families of definitions of stability: distribution-dependent and distribution-independent Bayesian…
This paper has three parts. First, we study and characterize amenable and extremely amenable topological semigroups in terms of invariant measures using integral logic. We prove definability of some properties of a topological semigroup…