Combinatorial applications of the subspace theorem

DOI10.1007/978-88-7642-525-7_7MaRDI QIDQ5895216zbMATH OpenOpenAlexFDO

Authors Ryan Schwartz, József Solymosi

Publication date 20 October 2015

Published in Geometry, Structure and Randomness in Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.3743

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Arithmetic combinatorics; higher degree uniformity (11B30) Schmidt Subspace Theorem and applications (11J87)

Abstract: The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and the construction of transcendental numbers. But its usefulness extends beyond the realms of number theory. Other applications of the Subspace Theorem include linear recurrence sequences and finite automata. In fact, these structures are closely related to each other and the construction of transcendental numbers. The Subspace Theorem also has a number of remarkable combinatorial applications. The purpose of this paper is to give a survey of some of these applications including sum-product estimates and bounds on unit distances. The presentation will be from the point of view of a discrete mathematician. We will state a number of variants of the Subspace Theorem below but we will not prove any of them as the proofs are beyond the scope of this work. However we will give a proof of a simplified special case of the Subspace Theorem which is still very useful for many problems in discrete mathematics.

Recommendations

• Quantitative versions of the subspace theorem and applications
• The Many Faces of the Subspace Theorem (after Adamczewski, Bugeaud, Corvaja, Zannier...)
• Applications of the Subspace Theorem to Certain Diophantine Problems
• scientific article; zbMATH DE number 7673576
• Applications of Diophantine Approximation to Integral Points and Transcendence

Cited in

(5)

• On badly approximable subspaces
• Some combinatorial principles defined in terms of elementary submodels
• EXPANDING POLYNOMIALS ON SETS WITH FEW PRODUCTS
• On the subset Combinatorics of G-spaces
• The sum-product problem for integers with few prime factors

This page was built for publication: Combinatorial applications of the subspace theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895216)