Related papers: Lewisian Fixed Points I: Two Incomparable Construc…
We give an unified framework to solve rough differential equations. Based on flows, our approach unifies the former ones developed by Davie, Friz-Victoir and Bailleul. The main idea is to build a flow from the iterated product of an almost…
We investigate the perturbative renormalisation of deformed conformal field theories from the Hamiltonian perspective. We discuss the relation with conformal perturbation theory, to which we provide an explicit match up to third order in…
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
We study strictly positive logics in the language $\mathscr{L}^+$, which constructs formulas from $\top$, propositional variables, conjunction, and diamond modalities. We begin with the base system $\bf K^+$, the strictly positive fragment…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
Some applications of simple current techniques and fixed point resolution to theories of open strings are discussed. In addition to a brief review of work presented in two recent papers with L. Huiszoon and N. Sousa, some new results…
It is well known that many theorems in recursion theory can be "relativized". This means that they remain true if partial recursive functions are replaced by functions that are partial recursive relative to some fixed oracle set. Uspensky…
We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
In the first of this two-part series, we find `fixed point factorisation' formulas, towards an understanding of the fusion ring of WZW models. Fixed-point factorisation refers to the simplifications in the data of a CFT involving primary…
In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…
In the first part of the article, a new interesting system of difference equations is introduced. It is developed for re-rating purposes in general insurance. A nonlinear transformation $\varphi $ of a d-dimensional $(d \ge 2)$ Euclidean…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…
We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We derive a fixed-point formula for integrals on moduli spaces of stable maps to projective spaces of even dimension. This gives a formula for the equivariant open Gromov-Witten invariants of (RP^{2m},CP^{2m}) and the structure constants of…