Related papers: Badly approximable numbers over imaginary quadrati…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

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…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of $p$--adic continued fractions, i.e. continued…

This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

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…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i=0,1,...,n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is…

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

In this article, for a certain subset $\mathcal{X}$ of the extended set of rational numbers, we introduce the notion of {\it best $\mathcal{X}$-approximations} of a real number. The notion of best $\mathcal{X}$-approximation is analogous to…

We give an overview of universal quadratic forms and lattices, focusing on the recent developments over the rings of integers in totally real number fields. In particular, we discuss indecomposable algebraic integers as one of the main…

In this paper we find a new lower bound on the number of imaginary quadratic extensions of the function field $\mathbb{F}_{q}(x)$ whose class groups have elements of a fixed odd order. More precisely, for $q$, a power of an odd prime, and…

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Let $k$ be a $d$-local field of characteristic 0, and let $K$ be the function field of a nice curve over $k$. We give a defect to weak approximation for reductive groups over $K$ using arithmetic dualities.

The list of norm-Euclidean imaginary quadratic fields is known and finite. For each known case, we give a division algorithm that finds a remainder at distance less than the Euclidean minimum of the field.

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…