A Lectures by Richard Borcherds

martinbn
Science Advisor
Messages
4,235
Reaction score
2,288
Not sure where the right place would be to put this, but I just noticed that Borcherds has videos of lectures he has given. I had seen the ones on schemes, but he has now a good selection of topics. They are not only algebraic, so may be the general forum would have been better, but anyway here it is.

https://www.youtube.com/@richarde.borcherds7998
 
Physics news on Phys.org
I found his biography on Wikipedia:

Richard Ewen Borcherds (/ˈbɔːrtʃərdz/; born 29 November 1959)[2] is a British[4] mathematician currently working in quantum field theory. He is known for his work in lattices, group theory, and infinite-dimensional algebras,[5][6] for which he was awarded the Fields Medal in 1998. He is well known for his proof of monstrous moonshine using ideas from string theory.

https://en.wikipedia.org/wiki/Richard_Borcherds

It's pretty interesting that he proved the Monstrous Moonshine theorem using string theory.

https://en.wikipedia.org/wiki/Monstrous_moonshine

The relationship between the montrous moonshine group and modular forms.



The other interesting thing he was a doctoral student of John Horton Conway.
 
  • Like
  • Informative
Likes pines-demon and martinbn
jedishrfu said:
I found his biography on Wikipedia:



https://en.wikipedia.org/wiki/Richard_Borcherds

It's pretty interesting that he proved the Monstrous Moonshine theorem using string theory.

https://en.wikipedia.org/wiki/Monstrous_moonshine

The relationship between the montrous moonshine group and modular forms.



The other interesting thing he was a doctoral student of John Horton Conway.

Damn that's amazing. I had no idea.

He says that everyone hates statistics so they change the name to things like "data science."
 
Last edited:
  • Haha
  • Like
Likes pines-demon and mad mathematician
Hornbein said:
Damn that's amazing. I had no idea.

He says that everyone hates statistics so they change the name to things like "data science."
Sometimes in order to find a job you have to "bite the bullet" so to say... :oldmad:
 
Yep thats wuite popular in comp sci business products.

Years ago IBM had a database product called ISAM vs GE’s ISP. ISAM was indexed sequential access method vs indexed sequential processing.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top