English
Related papers

Related papers: On the complexity of algebraic number I. Expansion…

200 papers

In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…

Number Theory · Mathematics 2026-02-10 Simona Fryšová , Magdaléna Tinková

There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…

General Mathematics · Mathematics 2011-07-07 Mohd Abubakr

The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…

Number Theory · Mathematics 2023-03-30 Gergely Kiss , Gábor Somlai , Tamás Terpai

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…

Logic · Mathematics 2022-11-03 Caleb M. H. Camrud , Timothy H. McNicholl

The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…

Number Theory · Mathematics 2007-12-19 Giovanni Panti

We prove the following theorems: Theorem 1: For any E-field with cyclic kernel, in particular $\mathbb C$ or the Zilber fields, all real abelian algebraic numbers are pointwise definable. Theorem 2: For the Zilber fields, the only pointwise…

Logic · Mathematics 2014-10-28 Jonathan Kirby , Angus Macintyre , Alf Onshuus

One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…

Commutative Algebra · Mathematics 2012-03-28 A. V. Dória , S. H. Hassanzadeh , A. Simis

We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or,…

Logic · Mathematics 2021-05-28 Stevo Todorčević , Zoltán Vidnyánszky

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

Logic · Mathematics 2018-02-12 Russell Miller , Hans Schoutens

Given $b=-A\pm i$ with $A$ being a positive integer, we can represent any complex number as a power series in $b$ with coefficients in $\mathcal A=\{0,1,\ldots, A^2\}$. We prove that, for any real $\tau\geq 2$ and any non-empty proper…

Number Theory · Mathematics 2023-10-19 Gerardo González Robert , Mumtaz Hussain , Nikita Shulga

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Logic · Mathematics 2025-05-13 Linus Richter

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

Number Theory · Mathematics 2025-02-27 Jaroslav Hancl , Mathias L. Laursen , Simon Kristensen

In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…

Number Theory · Mathematics 2022-06-28 Tirthankar Bhattacharyya , Soham Bakshi , Arka Das

We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…

In this paper, we prove a criterion for complexity in $g$-ary expansions of a rational fraction $a/b<1$ with gcd$(a,b)=1$. We prove that for any purely periodic proper fraction $a/b$ and all $j\geq 1$, each sequence of $j$ digits occurs in…

Number Theory · Mathematics 2022-10-14 Josefina López , Peter Stoll

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

Computational Complexity · Computer Science 2018-05-08 Masaki Nakanishi , Marcos Villagra

Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…

Number Theory · Mathematics 2007-05-23 Greg Martin

We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…

Combinatorics · Mathematics 2015-06-03 Florian Greinecker