2000 character limit reached
Diophantine Approximation Groups, Kronecker Foliations and Independence
Published 12 Jan 2012 in math.NT | (1201.2708v3)
Abstract: We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of $K$-linear and algebraic dependence. As a consequence we find reformulations -- as algebraic and geometric (graph) rigidities -- of the Theorems of Baker and Lindemann-Weierstrass, the Logarithm Conjecture and the Schanuel Conjecture. There is an Appendix describing diophantine approximation groups as model theoretic types.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.