Related papers: Patterns of resemblance and Bachmann-Howard fixed …
We compactify M(atrix) theory on Riemann surfaces Sigma with genus g>1. Following [1], we construct a projective unitary representation of pi_1(Sigma) realized on L^2(H), with H the upper half-plane. As a first step we introduce a suitably…
In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system $OT$ is introduced based on $\psi$-functions. Provable $\Sigma_{1}$-sentences on $L_{\omega_{1}^{CK}}$ are bounded through…
We present a higher well-ordering principle which is equivalent (over Simpson's set theoretic version of $\text{ATR}_0$) to the existence of transitive models of Kripke-Platek set theory, and thus to $\Pi^1_1$-comprehension. This is a…
Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…
We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…
The aim of this paper is twofold. In the first part, we consider twisted Rota-Baxter operators on associative algebras that were introduced by Uchino as a noncommutative analogue of twisted Poisson structures. We construct an…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Given a set of 'simple-minded' objects in a derived category, Rickard constructed a complex, which over a symmetric algebra provides a derived equivalence sending the 'simple-minded' objects to simple ones. We characterise in terms of…
Human similarity judgments are inconsistent with Euclidean, Hamming, Mahalanobis, and the majority of measures used in the extensive literatures on similarity and dissimilarity. From intrinsic properties of brain circuitry, we derive…
For a smooth, projective, complex algebraic variety $X$, the Riemann--Hilbert correspondence establishes a complex analytic isomorphism between the `Betti moduli space' of rank $n$ local systems on $X^\mathrm{an}$ and the `de Rham moduli…
Sampling is a basic operation in image processing. In classic literature, a morphological sampling theorem has been established, which shows how sampling interacts by morphological operations with image reconstruction. Many aspects of…
We investigate commutative analogues of Clifford algebras -- algebras whose generators square to $\pm1$ but commute, instead of anti-commuting as they do in Clifford algebras. We observe that commutativity allows for elegant results. We…
The techniques developed by Popescu, Muhly-Solel and Good for the study of algebras generated by weighted shifts are applied to generalize results of Sarkar and of Bhattacharjee-Eschmeier-Keshari-Sarkar concerning dilations and invariant…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
A definition of summability is put forward in the framework of general Carleman ultraholomorphic classes in sectors, so generalizing $k-$summability theory as developed by J.-P. Ramis. Departing from a strongly regular sequence of positive…
Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and…
We formally demonstrate that the relative seriality model of Kallman, et al. maps exactly onto a simple type of convolutional neural network. This approach leads to a natural interpretation of feedforward connections in the convolutional…
Motivated by the problem of longitudinal data assimilation, e.g., in the registration of a sequence of images, we develop the higher-order framework for Lagrangian and Hamiltonian reduction by symmetry in geometric mechanics. In particular,…
We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…