English
Related papers

Related papers: Strong Homology, Derived Limits, and Set Theory

200 papers

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…

Combinatorics · Mathematics 2020-05-11 Adam Timar

A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…

Logic in Computer Science · Computer Science 2016-10-04 Hadrian Andradi , Weng Kin Ho

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

Logic · Mathematics 2007-05-23 Benno van den Berg , Federico De Marchi

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Combinatorics · Mathematics 2022-07-19 T. Mitchell Roddenberry , Santiago Segarra

In this article we study asymptotic slopes of strongly semistable vector bundles on a smooth projective surface. A connection between asymptotic slopes and strong restriction theorem of a strongly semistable vector bundle is shown. We also…

Algebraic Geometry · Mathematics 2022-01-10 Mitra Koley , A. J. Parameswaran

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski

We show that a derivator is stable if and only if homotopy finite limits and homotopy finite colimits commute, if and only if homotopy finite limit functors have right adjoints, and if and only if homotopy finite colimit functors have left…

Algebraic Topology · Mathematics 2021-07-14 Moritz Groth , Mike Shulman

We prove a strong law of large numbers for random sets with bounded and closed values contained in an arbitrary (not necessarily separable) Banach space. We make use of a notion of convergence of sets introduced by Fisher, which is stronger…

Probability · Mathematics 2011-10-31 Francesco S. de Blasi , Luca Tomassini

In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…

Logic · Mathematics 2024-11-19 Ben De Bondt , Alessandro Vignati

This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…

Logic · Mathematics 2007-12-17 Kenny Easwaran

I have argued elsewhere that second order logic provides a foundation for mathematics much in the same way as set theory does, despite the fact that the former is second order and the latter first order, but second order logic is marred by…

Logic · Mathematics 2023-02-14 Jouko Väänänen

We describe in this paper additively left stable sets, i.e. sets satisfying $\left((A+A)-\inf(A)\right)\cap[\inf(A),\sup(A)]=A$ (meaning that $A-\inf(A)$ is stable by addition with itself on its convex hull), when $A$ is a finite subset of…

Number Theory · Mathematics 2025-01-13 Paul Péringuey , Anne de Roton

We consider three types of set-systems that have interesting applications in algebraic combinatorics and representation theory: maximal collections of the so-called strongly separated, weakly separated, and chord separated subsets of a set…

Combinatorics · Mathematics 2018-05-25 V. I. Danilov , A. V. Karzanov , G. A. Koshevoy

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

Algebraic Geometry · Mathematics 2020-07-20 David Kazhdan , Tamar Ziegler

GR can be interpreted as a theory of evolving 3-geometries. A recent such formulation, the 3-space approach of Barbour, Foster and \'{O} Murchadha, also permits the construction of a limited number of other theories of evolving…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Edward Anderson

Given a real closed field $R$, we identify exactly four proper reducts of $R$ which expand the underlying (unordered) $R$-vector space structure. Towards this theorem we introduce a new notion, of strongly bounded reducts of linearly…

Logic · Mathematics 2023-11-08 Hind Abu Saleh , Ya'acov Peterzil

We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the…

Algebraic Topology · Mathematics 2022-11-22 Sergey A. Melikhov

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction. Once…

Logic in Computer Science · Computer Science 2016-06-22 José Espírito Santo