Number Theory and Combinatorics
β B. Sury
π Library
π
2017
π Indian Academy of Sciences
β¦ LIBER β¦
π
Combinatorics, automata, and number theory
β Scribed by ValΓ©rie BerthΓ©, Michel Rigo
- Publisher
- CUP
- Year
- 2010
- Tongue
- English
- Leaves
- 629
- Series
- Encyclopedia of Mathematics and its Applications
- Edition
- draft
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
This collaborative volume presents recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.
π SIMILAR VOLUMES
Combinatorics and Number Theory [Lecture
β Joseph R. Mileti
π Library
π
2016
π English
Combinatorial Optimization: Theory and A
β Bernhard Korte, Jens Vygen
π Library
π
2005
π Springer
π English
This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
Combinatorial Optimization: Theory and A
β Bernhard Korte, Jens Vygen
π Library
π
2002
π Springer
π English
Combinatorial Optimization: Theory and A
β Bernhard Korte
π Library
π
2012
π Springer
π English
<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This
Combinatorial Number Theory and Additive
β Alfred Geroldinger, Imre Z. Ruzsa
π Library
π
2009
π BirkhΓ€user Basel
π English
<P>Additive combinatorics is a relatively recent term coined to comprehend the developments of the more classical additive number theory, mainly focussed on problems related to the addition of integers. Some classical problems like the Waring problem on the sum of k-th powers or the Goldbach conject