English
Related papers

Related papers: A Gel'fond type criterion in degree two

200 papers

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

Number Theory · Mathematics 2007-05-23 Damien Roy , Michel Waldschmidt

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

Number Theory · Mathematics 2007-05-23 Damien Roy

We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…

Number Theory · Mathematics 2007-05-23 Neil Berry , Arturas Dubickas , Noam D. Elkies , Bjorn Poonen , Chris Smyth

We prove that an additive form of degree $d=2m$, $m$ odd, $m\ge3$, over the unramified quadratic extension $\mathbb{Q}_2(\sqrt{5})$ has a nontrivial zero if the number of variables $s$ satisifies $s \ge 4d+1$. If $3 \nmid d$, then there…

Number Theory · Mathematics 2022-07-21 Drew Duncan , David B. Leep

We present a general result of simultaneous approximation to several transcendental real, complex or p-adic numbers xi_1,...,xi_t by conjugate algebraic numbers of bounded degree over Q, provided that the given transcendental numbers…

Number Theory · Mathematics 2013-01-07 Damien Roy

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

Optimization and Control · Mathematics 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

In this paper, I give sufficient conditions for any linear combination in $\mathbb{Q}$ of numbers $\sum_{n=1}^{\infty}\frac{b_{1,n}}{\alpha_{1,n}}$, $\ldots$, $\sum_{n=1}^{\infty}\frac{b_{K,n}}{\alpha_{K,n}}$ to have algebraic degree…

Number Theory · Mathematics 2025-02-25 Mathias Løkkegaard Laursen

Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…

Commutative Algebra · Mathematics 2011-06-07 Tigran Ananyan , Melvin Hochster

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

Number Theory · Mathematics 2011-11-15 Jean Bureau , Jorge Morales

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…

Number Theory · Mathematics 2022-11-15 Chatchai Noytaptim , Clayton Petsche

We establish the first effective improvements on the Liouville inequality for approximation to complex non-real algebraic numbers by complex algebraic numbers of degree at most 4.

Number Theory · Mathematics 2024-11-18 Prajeet Bajpai , Yann Bugeaud

We study totally real number fields that admit a universal quadratic form whose coefficients are rational integers. We show that $\mathbb Q(\sqrt 5)$ is the only such real quadratic field, and that among fields of degrees 3, 4, 5, and 7…

Number Theory · Mathematics 2020-11-30 Vítězslav Kala , Pavlo Yatsyna

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Optimization and Control · Mathematics 2008-02-12 Jiawang Nie , Kristian Ranestad

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

Number Theory · Mathematics 2026-04-28 Shamik Das , Debajyoti De , Sudipa Mondal

For a given positive integer $k$, we prove that there are at least $x^{1/2-o(1)}$ integers $d\leq x$ such that the real quadratic fields $\mathbb Q(\sqrt{d+1}),\dots,\mathbb Q(\sqrt{d+k})$ have class numbers essentially as large as…

Number Theory · Mathematics 2023-07-18 Giacomo Cherubini , Alessandro Fazzari , Andrew Granville , Vítězslav Kala , Pavlo Yatsyna

Let xi be a real number which is neither rational nor quadratic over Q. Based on work of Davenport and Schmidt, Bugeaud and Laurent have shown that, for any real number theta, there exist a constant c>0 and infinitely many non-zero…

Number Theory · Mathematics 2014-02-26 Damien Roy , Dmitrij Zelo

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Classical Analysis and ODEs · Mathematics 2020-09-28 Soham Basu
‹ Prev 1 2 3 10 Next ›