
Recent Posts
Tags
 CayleyHamilton Theorem
 characters
 Chinese remainder theorem
 Compression
 Diophantine approximation
 Dirichlet's theorem
 Dirichlet's approximation theorem
 Dirichlet's unit theorem
 Domino
 Dynamics
 eigenvalues
 Entropy
 Euclid
 Fourier transform
 gaussian integers
 Generic Matrix
 Geometry
 Geometry of numbers
 Homogeneous spaces
 Hyperbolic space
 isoperimetric inequality
 Klein group
 lattice
 Lattices
 Linearity testing
 mediant
 Minkowski's Theorem
 mobius
 Number Theory
 Peg Solitaire
 Pell's equations
 planar geometry
 poinare disk
 prime numbers
 Pythagoras
 radar
 random walk
 self similar sets
 shortest vector problem
 Sierpinski carpet
 Sierpinski triangle
 SL_2(Z)
 stochastic matrices
 Weak Law of Large Numbers
Archives
Tag Archives: Diophantine approximation
Minkowski’s theorem
In the post about Diophantine approximation, we saw that in order to find “good” rational approximations to a real number, it is enough to prove that given a lattice and a “big enough” box around the origin, the box must … Continue reading
From Diophantine approximation to geometry of numbers
We all know about Pythagoras and his obsession with triangles. Usually when we first learn about the rational and real numbers, we are also told about the Pythagoreans, a 6th century BCE cult that started with the followers of Pythagoras and … Continue reading