z-logo
Premium
Two conjectures on the arithmetic in ℝ and ℂ
Author(s) -
Tyszka Apoloniusz
Publication year - 2010
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.200910004
Subject(s) - arithmetic , mathematics , saturation arithmetic , computer science , arbitrary precision arithmetic
Let G be an additive subgroup of ℂ, let W n = { x i = 1, x i + x j = x k : i, j, k ∈ {1, …, n }}, and define E n = { x i = 1, x i + x j = x k , x i · x j = x k : i, j, k ∈ {1, …, n }}. We discuss two conjectures. (1) If a system S ⊆ E n is consistent over ℝ (ℂ), then S has a real (complex) solution which consists of numbers whose absolute values belong to [0, 2 2 n –2 ]. (2) If a system S ⊆ W n is consistent over G , then S has a solution ( x 1 , …, x n ) ∈ ( G ∩ ℚ) n in which | x j | ≤ 2 n –1 for each j.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom