Lectures related to Fundamental Solutions

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Explores probability convergence, discussing conditions for random variable sequences to converge and the uniqueness of convergence.

Explores implicit schemes in numerical analysis, emphasizing stability and convergence properties in solving differential equations.

Explores curves with Poritsky property, Birkhoff integrability, and Liouville nets in billiards.

Covers the Hadamard factorisation theorem for entire functions of order at most 1.

Covers the approximation of functions in Sobolev spaces using smooth functions.

Covers implicit schemes in numerical analysis for solving partial differential equations.

Explains the Wronskian and its role in determining linear independence of solutions to differential equations.