Related papers: Substructural fixed-point theorems and the diagona…
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
We extend Mazzola's counterpoint model using category theory, generalizing from the category $\mathbf{Set}$ to other topoi with suitable properties. This generalization suggests that counterpoint's essential structure depends on specific…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
The Lefschetz fixed point theorem and its converse have many generalizations. One of these generalizations is to endomorphisms of a space relative to a fixed subspace. In this paper we define relative Lefschetz numbers and Reidemeister…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
We give a simple and more elementary proof that the notions of Domain of Holomorphy and Weak Domain of Holomorphy are equivalent. This proof is based on a combination of Baire's Category Theorem and Montel's Theorem. We also obtain…
The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
When formalized, some diagonal arguments do not show the diagonal object to be impossible but rather reveal some other anomaly (e.g., that one of the relevant sets is ill-defined). This raises the possibility that some diagonal arguments…
The diagonal lemma asserts that if a map of bisimplicial sets is a levelwise weak equivalence in the Kan-Quillen model structure, then it induces a weak equivalence of the diagonal simplicial sets. In this short note, we observe that the…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
General coherence theorems are constructed that yield explicit presentations of categorical and algebraic objects. The categorical structures involved are finitary discrete Lawvere 2-theories, though they are approached within the language…
In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…
By a theorem of Dixmier-Douady the unitary group of an infinite-dimensional separable Hilbert space $H$ in the strong operator topology is contractible. The Dixmier-Douady proof is based on an explicit construction of families of subspaces…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…
Our paper is the first study of what one might call "reverse mathematics of explicit fixpoints". We study two methods of constructing such fixpoints for formulas whose principal connective is the intuitionistic Lewis arrow. Our main…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We prove an existence and uniqueness theorem for fixed points of contraction maps in the framework of quantum metric spaces, where distinguishability is defined by the $L^2$ norm: $d_Q(\psi_1,\psi_2) = \|\psi_1 - \psi_2\|$. The result…