scholarly journals Corrigendum to “Algebraic numbers and density modulo 1” [J. Number Theory 128 (3) (2008) 645–661]

2009 ◽  
Vol 129 (11) ◽  
pp. 2879-2881
Author(s):  
Roman Urban
2021 ◽  
Author(s):  
Sourangshu Ghosh

In this paper, we discuss the properties of lattices and their application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to study the properties of algebraic numbers. It has an application in various other fields of mathematics especially the study of Diophantine equations, analysis of functional analysis, etc. This paper gives an elementary introduction to the field of the geometry of numbers. In this paper, we shall first give a broad overview of the concept of lattice and then discuss the geometrical properties it has and its applications.


Author(s):  
Sourangshu Ghosh

In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory.  This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to study the properties of algebraic numbers. It has application on various other fields of mathematics especially the study of Diophantine equations, analysis of functional analysis etc. This paper gives an elementary introduction to the field of geometry of numbers. In this paper we shall first give a broad overview of the concept of lattice and then discuss about the geometrical properties it has and its applications.


1994 ◽  
Vol 133 ◽  
pp. 1-55 ◽  
Author(s):  
Hiroshi Umemura

In this paper we propose a new category Qcl of complex numbers which contains π, e and the set of algebraic numbers. In fact this category contains most of the numbers studied so far in number theory. An element of the category is here called a classical number. The category of the classical numbers forms an algebraically closed field and consists of countably many numbers. The definition depends on algebraic differential equations related with algebraic groups. Throughout the paper unless otherwise stated, we deal with functions of one variable and a differential equation is an ordinary differential equation. We are inspired of the Leçons de Stockholm of Painlevé [P].


2017 ◽  
Vol 63 ◽  
pp. 487-525
Author(s):  
William Chen ◽  
Robert Vaughan

Klaus Friedrich Roth, who died in Inverness on 10 November 2015 aged 90, made fundamental contributions to different areas of number theory, including diophantine approximation, the large sieve, irregularities of distribution and what is nowadays known as arithmetic combinatorics. He was the first British winner of the Fields Medal, awarded in 1958 for his solution in 1955 of the famous Siegel conjecture concerning approximation of algebraic numbers by rationals. He was elected a Fellow of the Royal Society in 1960, and received its Sylvester Medal in 1991. He was also awarded the De Morgan Medal of the London Mathematical Society in 1983, and elected Fellow of University College London in 1979, Honorary Fellow of Peterhouse in 1989, Honorary Fellow of the Royal Society of Edinburgh in 1993 and Fellow of Imperial College London in 1999.


2006 ◽  
Vol 16 (05n06) ◽  
pp. 567-590 ◽  
Author(s):  
EE-CHIEN CHANG ◽  
SUNG WOO CHOI ◽  
DO YONG KWON ◽  
HYUNGJU PARK ◽  
CHEE K. YAP

An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p,q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n2 log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first give a direct proof of the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.


1971 ◽  
Vol 69 (1) ◽  
pp. 157-161 ◽  
Author(s):  
J. Coates

Let α1, …, αn be n ≥ 2 algebraic numbers such that log α1,…, log αn and 2πi are linearly independent over the field of rational numbers Q. It is well known (see (6), Ch. 1) that the Thue–Siegel–Roth theorem implies that, for each positive number δ, there are only finitely many integers b1,…, bn satisfyingwhere H denotes the maximum of the absolute values of b1, …, bn. However, such an argument cannot provide an explicit upper bound for the solutions of (1), because of the non-effective nature of the theorem of Thue–Siegel–Roth. An effective proof that (1) has only a finite number of solutions was given by Gelfond (6) in the case n = 2, and by Baker(1) for arbitrary n. The work of both these authors is based on arguments from the theory of transcendental numbers. Baker's effective proof of (1) has important applications to other problems in number theory; in particular, it provides an algorithm for solving a wide class of diophantine equations in two variables (2).


1963 ◽  
Vol 3 (4) ◽  
pp. 408-434 ◽  
Author(s):  
K. Mahler

In his Topics in Number Theory, vol. 2, chapter 2 (Reading, Mass., 1956) W. J. LeVeque proved an important generalisation of Roth's theorem (K. F. Roth, Mathematika 2,1955, 1—20).Let ξ be a fixed algebraic number, σ a positive constant, and K an algebraic number field of degree n. For κ∈K denote by κ(1), …, κ(n) the conjugates of κ relative to K, by h(κ) the smallest positive integer such that the polynomial has rational integral coefficients, and by q(κ) the quantity


Author(s):  
Hugh L. Montgomery ◽  
Robert C. Vaughan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document