Results 71 to 80 of about 1,868 (172)

Topological data analysis and topological deep learning beyond persistent homology: a review. [PDF]

open access: yesArtif Intell Rev
Su Z   +7 more
europepmc   +1 more source

Most totally real fields do not have universal forms or the Northcott property. [PDF]

open access: yesProc Natl Acad Sci U S A
Daans N   +4 more
europepmc   +1 more source

An effective deep learning algorithm for medical image registration. [PDF]

open access: yesPLOS Digit Health
Deng J   +5 more
europepmc   +1 more source

On the Non-Trivial Simplification of the Quotient $\frac{\pi^2}{\pi}$ and Its Deep Implications for Modern Mathematics, Theoretical Physics, Computational Number Theory, Algebraic Topology, Differential Geometry, Category Theory, and the General Understanding of the Universe: A Comprehensive, Exhaustive, and Definitive Treatment with Historical, Philosophical, and Epistemological Considerations Regarding the Nature of Mathematical Truth Itself

open access: yes
In this landmark paper, we undertake what is perhaps the most comprehensive, rigorous, and exhaustive investigation ever attempted in the history of mathematical literature regarding the simplification of the expression $\frac{\pi^2}{\pi}$. Through a meticulous application of the fundamental laws of exponentiation, the axioms of real analysis, the ...
openaire   +2 more sources

Some Properties of the Plaquette Random-Cluster Model. [PDF]

open access: yesMath Phys Anal Geom
Duncan P, Schweinhart B.
europepmc   +1 more source

On Algebraic Knots I : Computatability of Their Jones Polynomials(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)

open access: yesOn Algebraic Knots I : Computatability of Their Jones Polynomials(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)
We prove that the Jones polynomial of any Conway algebraic link diagram with n crossings can be computed in O(n^2) time. In particular, the Jones polynomial of any Montesinos link and two-bridge knot or link with minimum crossing number n can be computed in O(n^2) time. この論文は国立情報学研究所の電子図書館事業により電子化されました。
openaire  

Home - About - Disclaimer - Privacy