Largest known ranks of an elliptic curve over the rational numbers by 
Ciro Santilli 40 Updated 2025-07-16
Ciro Santilli 40 Updated 2025-07-16web.math.pmf.unizg.hr/~duje/tors/rankhist.html gives a list with Elkies (2006) on top with:TODO why this non standard formulation?
Output: another sequence of complex numbers such that:Intuitively, this means that we are braking up the complex signal into sinusoidal frequencies:and is the amplitude of each sine.
- : is kind of magic and ends up being a constant added to the signal because
- : sinusoidal that completes one cycle over the signal. The larger the , the larger the resolution of that sinusoidal. But it completes one cycle regardless.
- : sinusoidal that completes two cycles over the signal
- ...
- : sinusoidal that completes cycles over the signal
Motivation: similar to the Fourier transform:In particular, the discrete Fourier transform is used in signal processing after a analog-to-digital converter. Digital signal processing historically likely grew more and more over analog processing as digital processors got faster and faster as it gives more flexibility in algorithm design.
- compression: a sine would use N points in the time domain, but in the frequency domain just one, so we can throw the rest away. A sum of two sines, only two. So if your signal has periodicity, in general you can compress it with the transform
- noise removal: many systems add noise only at certain frequencies, which are hopefully different from the main frequencies of the actual signal. By doing the transform, we can remove those frequencies to attain a better signal-to-noise
Sample software implementations:
- numpy.fft, notably see the example: numpy/fft.py
DFT of with 25 points
. This is a simple example of a discrete Fourier transform for a real input signal. It illustrates how the DFT takes N complex numbers as input, and produces N complex numbers as output. It also illustrates how the discrete Fourier transform of a real signal is symmetric around the center point.A collection of closely related and curated C. elegans datasets.
The book unfortunately does not cover the history of quantum mechanics very, the author specifically says that this will not be covered, the focus is more on particles/forces. But there are still some mentions.
Basically, a "representation" means associating each group element as an invertible matrices, i.e. a matrix in (possibly some subset of) , that has the same properties as the group.
Or in other words, associating to the more abstract notion of a group more concrete objects with which we are familiar (e.g. a matrix).
This is basically what everyone does (or should do!) when starting to study Lie groups: we start looking at matrix Lie groups, which are very concrete.
Or more precisely, mapping each group element to a linear map over some vector field (which can be represented by a matrix infinite dimension), in a way that respects the group operations:
As shown at Physics from Symmetry by Jakob Schwichtenberg (2015)
- page 51, a representation is not unique, we can even use matrices of different dimensions to represent the same group
- 3.6 classifies the representations of . There is only one possibility per dimension!
- 3.7 "The Lorentz Group O(1,3)" mentions that even for a "simple" group such as the Lorentz group, not all representations can be described in terms of matrices, and that we can construct such representations with the help of Lie group theory, and that they have fundamental physical application
Bibliography:
- www.youtube.com/watch?v=9rDzaKASMTM "RT1: Representation Theory Basics" by MathDoctorBob (2011). Too much theory, give me the motivation!
- www.quantamagazine.org/the-useless-perspective-that-transformed-mathematics-20200609 The "Useless" Perspective That Transformed Mathematics by Quanta Magazine (2020). Maybe there is something in there amidst the "the reader might not know what a matrix is" stuff.
Founded by Craig Venter by joining up other existing institutes.
The exact opposite of argument from poor design!
This is the dude that made many of the amazing WEHImovies animation.
Unfortunately, the process appears to be quite manual and laborious, more art than simulation, based on the software list used: www.drewberry.com/faq
Animations of unseeable biology by Drew Berry (2021)
Source. Presented at TED.Draft by Ciro Santilli with cross language input/output test cases: github.com/cirosantilli/algorithm-cheat
By others:
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 3. Visual Studio Code extension installation.
Figure 4. Visual Studio Code extension tree navigation.
Figure 5. Web editor. You can also edit articles on the Web editor without installing anything locally.Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.Video 4. OurBigBook Visual Studio Code extension editing and navigation demo. Source. 
- Infinitely deep tables of contents:
.jpg){kind=link}
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact