Related papers: Strong Homology, Derived Limits, and Set Theory
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
The attracting set and the inverse limit set are important objects associated to a self-map on a set. We call \emph{stable set} of the self-map the projection of the inverse limit set. It is included in the attracting set, but is not equal…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
We introduce the notion of strong embeddability for a metric space. This property lies between coarse embeddability and property A. A relative version of strong embeddability is developed in terms of a family of set maps on the metric…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
The strong coupling limit of a quantum system is in general quite complicated, but in some cases a great simplification occurs: the strongly coupled limit is equivalent to the weakly coupled limit of some other system. In string theory…
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…
It is known that homology and inverse limit functors do not commute. In the paper we consider this very problem and find its application for various homology theories. In particular, on the category of general topological spaces, there are…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…
We show that, in the model constructed by adding sufficiently many Cohen reals, derived limits are additive on a large class of systems. This generalizes the work of Jeffrey Bergfalk, Michael Hru\v s\'ak, and Chris Lambie-Hanson which…
Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…
The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing…
Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
To a homology theory one can associate an additive site and a new homological functor with values in the category of additive sheaves on that site. If this category of sheaves can be shown to be equivalent to a category of comodules of a…
In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…
We study the nonlinear realization of supersymmetry in a dynamical/cosmological background in which derivative terms like kinetic terms are finite. Starting from linearly realized theories, we integrate out heavy modes without neglecting…
We study some closely interrelated notions of Homological Algebra: (1) We define a topology on modules over a not-necessarily commutative ring $R$ that coincides with the $R$-topology defined by Matlis when $R$ is commutative. (2) We…