Related papers: Correspondence and translation principles for the …
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We address some fundamental problems concerning the structure of idealistic equivalence relations. In particular, we show that, under analytic determinacy, there are continuum many idealistic analytic equivalence relations that are not…
Transformers underlie almost all state-of-the-art language models in computational linguistics, yet their cognitive adequacy as models of human sentence processing remains disputed. In this work, we use a surprisal-based linking mechanism…
Review of: Brigitte Le Roux and Henry Rouanet, Geometric Data Analysis, From Correspondence Analysis to Structured Data Analysis, Kluwer, Dordrecht, 2004, xi+475 pp.
We solve the longstanding conjecture by Milnor (1993) concerning the connectedness locus $M_1$ of the family of quadratic rational maps tangent to the identity at $\infty$. We prove that this locus in homeomorphic to the Mandelbrot set $M$…
The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…
The combinatorial Mandelbrot set is a continuum in the plane, whose boundary can be defined, up to a homeomorphism, as the quotient space of the unit circle by an explicit equivalence relation. This equivalence relation was described by…
We interpret the construction of relative Cuntz-Pimsner algebras of correspondences in terms of the correspondence bicategory, as a reflector into a certain sub-bicategory. This generalises a previous characterisation of absolute…
Motivated by sensor networks and other distributed settings, several models for distributed learning are presented. The models differ from classical works in statistical pattern recognition by allocating observations of an independent and…
Let H be any reductive p-adic group. We introduce a notion of cuspidality for enhanced Langlands parameters for H, which conjecturally puts supercuspidal H-representations in bijection with such L-parameters. We also define a cuspidal…
The Law of Quadratic Reciprocity was conjectured by Euler and Legendre who both found an incomplete proof. Gauss called this law "Theorema Fundamentale", and he was the first who gave a complete proof, he also highlighted the equivalence of…
Given a compact interval $I \subseteq \mathbb{R}$, and a function $f$ that is a product of a nonzero polynomial with a Gaussian, it will be shown that the translates $\{ f(\cdot - \lambda) : \lambda \in \Lambda \}$ are complete in $C(I)$ if…
In this Comment, we refute conclusions made in Phys. Rev. Lett. 112, 233601 (2014) by L.-G. Wang, L. Wang, M. Al-Amri, S.-Y. Zhu, and M. S. Zubairy. These conclusions stem from the use of the linear theory, which is not applicable to…
In this article, we give a new method for proving Howe correspondence in the case of dual pairs of type $({\rm GL}_n, {\rm GL}_m)$ over a non-Archimedean locally compact field $F$. The proof consists in combining a study on Kudla's…
These notes are an introduction to symplectic groupoids and the double structures associated with them. The treatment is intended to lie about midway between the original account of Coste, Dazord and Weinstein, which relied on effective use…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…
We generalize a beautiful method of Blasius and Ramakrishnan, that in order to exhibit particular instances of the Langlands functorial correspondence, it is enough to show that the correspondence holds in the semistable case, provided the…
We solve two problems in the theory of correspondences that have important implications in the theory of product systems. The first problem is the question whether every correspondence is the correspondence associated (by the representation…