Related papers: Simultaneous approximation by conjugate algebraic …
The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…
The purpose of this article is to give a short introduction to the concept of quasi-unitary equivalence of quadratic forms and its consequences. In particular, we improve an estimate concerning the transitivity of quasi-unitary equivalence…
We discuss computational results on field extensions $K/{\mathbb Q}$ of degree $n\le11$ with Galois group of the Galois closure isomorphic to the full symmetric group ${\mathfrak S}_n$. More precisely, we present statistics on the number of…
Is it possible to distinguish algebraic from transcendental real numbers by considering the $b$-ary expansion in some base $b\ge2$? In 1950, \'E. Borel suggested that the answer is no and that for any real irrational algebraic number $x$…
It is widely believed that the continued fraction expansion of every irrational algebraic number $\alpha$ either is eventually periodic (and we know that this is the case if and only if $\alpha$ is a quadratic irrational), or it contains…
It is known that, for each real number x such that 1,x,x^2 are linearly independent over Q, the uniform exponent of simultaneous approximation to (1,x,x^2) by rational numbers is at most (sqrt{5}-1)/2 (approximately 0.618) and that this…
We propose a general framework for converting global and local similarities between biological sequences to quasi-metrics. In contrast to previous works, our formulation allows asymmetric distances, originating from uneven weighting of…
Let $\theta=(\theta_1,\ldots,\theta_m) \in \R^m, \kappa=(\kappa_1,\ldots,\kappa_n) \in \R^n$ be two tuples of real numbers each linearly independent over $\Q$, and $T$ the transcendence degree of the field generated by $\{\exp(\theta_i…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…
For Lebesgue generic $(x_1,x_2)\in \mathbb{R}^2$, we investigate the distribution of small values of products $q\cdot \|qx_1\| \cdot \|qx_2\|$ with $q\in\mathbb{N}$, where $\|\cdot \|$ denotes the distance to the closest integer. The main…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…
In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.
We give two kinds of approximation of Lyapunov exponents of rational functions of degree more than one on the projective line over more general fields than that of complex numbers.
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…