Related papers: Independence and Induction in Reverse Mathematics
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…
We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This…
Proposed for rapid document similarity estimation in web search engines, the celebrated property of minwise independence imposes highly symmetric constraints on a family $\mathcal{F}$ of permutations of $\{1,\ldots, n\}$: The property is…
We provide a general framework to study convergence properties of families of maps. For manifolds $M$ and $N$ where $M$ is equipped with a volume form $\mathcal{V}$ we consider families of maps in the collection $\{(\phi, B) : B \subset M,…
For a property $\Gamma$ and a family of sets $\cF$, let $f(\cF,\Gamma)$ be the size of the largest subfamily of $\cF$ having property $\Gamma$. For a positive integer $m$, let $f(m,\Gamma)$ be the minimum of $f(\cF,\Gamma)$ over all…
We study the coupling matrix of $\mathcal{N}=2$ $SU(N)$ gauge theories with $2N$ fundamental hypermultiplets in the special vacuum, where a residual $\mathbb{Z}_N$ symmetry restores nontrivial modular structure. Using symmetry and…
We show that, consistently, every MAD family has cardinality strictly bigger than the dominating number, that is a > d, thus solving one of the oldest problems on cardinal invariants of the continuum. The method is a contribution to the…
It is often desirable to summarise a probability measure on a space $X$ in terms of a mode, or MAP estimator, i.e.\ a point of maximum probability. Such points can be rigorously defined using masses of metric balls in the small-radius…
Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum…
In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak…
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
We study a family of variants of Jensen's\emph{subcomplete forcing axiom}, $\mathsf{SCFA}$ and \emph{subproper forcing axiom}, $\mathsf{SubPFA}$. Using these we develop a general technique for proving non-implications of $\mathsf{SCFA}$,…
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…
For a family F (a collection of subsets of Z_+), the notion of F-independence is defined both for topological dynamics (t.d.s.) and measurable dynamics (m.d.s.). It is shown that there is no non-trivial {syndetic}-independent m.d.s.; a…
We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an ''intensional'' or ''effective'' view of respectively ill-and well-foundedness properties to an…
We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $\varphi(a)$ in the first-order language of set theory is true in the set-theoretic universe $V$, then it is also true in a proper inner…
Answering questions of A. Avil\'es, F. Cabello S\'anchez, J. Castillo, M. Gonz\'alez and Y. Moreno we show that the following statements are independent of the usual axioms ZFC with arbitrarily large continuum: for every (some)…