| Line 8: | Line 8: | ||
=== To Wikidata === | === To Wikidata === | ||
==== Properties ==== | |||
* [[:wikidata:Wikidata:Property_proposal/OpenML_dataset_ID|OpenML dataset ID]] (proposed | |||
==== Items ==== | |||
* [[:wikidata:Q192760|fundamental theorem of algebra (Q192760)]] | * [[:wikidata:Q192760|fundamental theorem of algebra (Q192760)]] | ||
* [[:wikidata:Q670235|fundamental theorem of arithmetic (Q670235)]] | * [[:wikidata:Q670235|fundamental theorem of arithmetic (Q670235)]] | ||
Revision as of 12:28, 9 November 2022
This page is for test edits and unsorted notes.
NFDI interactions
Interwiki links
To Wikidata
Properties
- OpenML dataset ID (proposed
Items
- fundamental theorem of algebra (Q192760)
- fundamental theorem of arithmetic (Q670235)
- fundamental theorem of calculus (Q1217677)
- fundamental theorem of Riemannian geometry (Q2185349)
- fundamental theorem of linear algebra (Q5508975)
- fundamental theorem of algebraic K-theory (Q17015004)
To Wikiversity
Math videos
- "The greatest shortcoming of the human race is our inability to understand the exponential function. But this kind of steady growth is the centrepiece of the entire global economy. Who would realise at 5 minutes to 12, that there is a problem? Think about it."
- The Map of Mathematics
- Data and Mathematics, or Mathematics and Data
- Why is algebra so hard?
- Wikidata on Apache Jena and Fuseki
- Pythagoras twisted squares: Why did they not teach you any of this in school?
- But what is the Fourier Transform? A visual introduction
Math & biology
- RCC-5 classification
- Merging taxonomies under RCC-5 algebraic articulations (Q114740027): "CLEANTAX uses the RCC-5 [Randell et al. 1992] topological algebra as the basis for representing articulations. This algebra describes relationships between sets, and supports the expression of incomplete knowledge when stating articulations. The RCC-5 algebra uses the same five basic relations (B5) as several biological taxonomic alignments and taxonomic reasoning systems [Berendsohn 2003; Koperski et al. 2000; Franz et al. 2007]. Given any two non-empty sets N and M, exactly one of the B5 relations holds (cf. Figure 5) between them: (i) congruence (N ≡ M), (ii) proper inclusion (N # M), (iii) proper inverse inclusion (N ! M), (iv) partial overlap (N ⊕ M), or (v) exclusion (disjointness) (N ! M)."
