new section |
|||
Line 24: | Line 24: | ||
* [https://www.youtube.com/watch?v=q3T1T51cH3A Wikidata on Apache Jena and Fuseki] | * [https://www.youtube.com/watch?v=q3T1T51cH3A Wikidata on Apache Jena and Fuseki] | ||
* [https://www.youtube.com/watch?v=Y5wiWCR9Axc Pythagoras twisted squares: Why did they not teach you any of this in school?] | * [https://www.youtube.com/watch?v=Y5wiWCR9Axc Pythagoras twisted squares: Why did they not teach you any of this in school?] | ||
* [https://www.youtube.com/watch?v=spUNpyF58BY But what is the Fourier Transform? A visual introduction] | |||
== Math & biology == | == Math & biology == |
Revision as of 00:45, 28 October 2022
This page is for test edits and unsorted notes.
NFDI interactions
Interwiki links
To Wikidata
- 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 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)."