相关论文: Files for Gabriel-Zisman localization
These notes are a brief summary of the main results from the book `Discriminants, Resultants and Multidimensional Determinants' by Gelfand-Kapranov-Zelevinsky. We sketch the key ideas involved in the proofs, using as little technical…
We review the literature on the localization transition for the class of polymers with random potentials that goes under the name of copolymers near selective interfaces. We outline the results, sketch some of the proofs and point out the…
We introduce the method of topological quantization for gravitational fields in a systematic manner. First we show that any vacuum solution of Einstein's equations can be represented in a principal fiber bundle with a connection that takes…
In this paper we prove the Zariski-Lipman conjecture for log canonical spaces.
The well know conjecture of {\it Coburn} [{\it L.A. Coburn, {On the Berezin-Toeplitz calculus}, Proc. Amer. Math. Soc. 129 (2001) 3331-3338.}] proved by {\it Lo} [{\it M-L. Lo, {The Bargmann Transform and Windowed Fourier Transform},…
Motivated by the problem of testing for the existence of a signal of known parametric structure and unknown ``location'' (as explained below) against a noisy background, we obtain for the maximum of a centered, smooth random field an…
This paper provides an informal sketch of a proof of the Baez-Dolan cobordism hypothesis, which provides a classification for extended topological quantum field theories.
This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…
This text is the English translation, due to Naoufal Bouchareb, of an unpublished manuscript of 1969 (the French version is available on HAL as hal-00384928) inspired by Zariski's theory of saturation. Its publication is justified by the…
Foundational material on complex Lie supergroups and their radial operators is presented. In particular, Berezin's recursion formula for describing the radial parts of fundamental operators in general linear and ortho-symplectic cases is…
We report the results of the first experiments with learning proof dependencies from the formalizations done with the Coq system. We explain the process of obtaining the dependencies from the Coq proofs, the characterization of formulas…
For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…
This work developes a quantitative framework for describing the overcompleteness of a large class of frames. A previous paper introduced notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and…
This is a collection of references (papers, books, preprints, book reviews, Ph. D. thesis, patents, web sites, etc.), sorted alphabetically and (some of them) classified by subject, on foundations of quantum mechanics and quantum…
Three arguments based on the Greenberger-Horne-Zeilinger (GHZ) proof of the nonexistence of local hidden variables are presented. The first is a description of a simple game which a team that uses the GHZ method will always win. The second…
In this paper we prove the abelian localization theorem for modules over cyclotomic Rational Cherednik algebras.
In this article we give a totally new proof of the integral localization formula for equivariantly closed differential forms (Theorem 7.11 in [BGV]). We restate it here as Theorem 2. This localization formula is very well known, but the…
Visual localization is a useful alternative to standard localization techniques. It works by utilizing cameras. In a typical scenario, features are extracted from captured images and compared with geo-referenced databases. Location…
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables…
The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…