English
Related papers

Related papers: Bound the difference of two singular moduli

200 papers

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

We prove that $|x-y|\ge 800X^{-4}$, where $x$ and $y$ are distinct singular moduli of discriminants not exceeding $X$. We apply this result to the "primitive element problem" for two singular moduli. In a previous article Faye and Riffaut…

Number Theory · Mathematics 2020-06-02 Yuri Bilu , Bernadette Faye , Huilin Zhu

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…

Number Theory · Mathematics 2011-01-11 Eric Errthum

We give a new lower bound for the discrete norm of a polynomial on the circle

Complex Variables · Mathematics 2012-03-13 V. N. Dubinin

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

When $\{\alpha_i\}_{1 \leq i \leq m}$ is a sequence of distinct non-zero elements of an integral domain $A$ and $\gamma$ is a common multiple of the $\alpha_i$ in $A$ we obtain, by means of a simple identity for the Vandermonde determinant,…

Number Theory · Mathematics 2015-06-26 D. S. Ramana

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

Number Theory · Mathematics 2022-03-22 Shabnam Akhtari , Jeffrey D. Vaaler

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

Dynamical Systems · Mathematics 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Number Theory · Mathematics 2017-09-27 Nicole Looper

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

Commutative Algebra · Mathematics 2016-02-23 M. Domokos

If a module $M$ has finite projective dimension, then the Ext modules of $M$ against any other module eventually vanish and the projective dimension of $M$ gives a uniform bound for this vanishing. For modules of infinite projective…

Commutative Algebra · Mathematics 2025-09-24 Andrew J. Soto Levins

This paper gives a sharp upper bound for the Betti numbers of a finitely generated multigraded $R$-module, where $R=\Bbbk [x_{1},...,x_{m}]$ is the polynomial ring over a field $\Bbbk$ in $m$ variables. The bound is given in terms of the…

Commutative Algebra · Mathematics 2007-05-23 Amanda Beecher

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

Combinatorics · Mathematics 2018-11-26 Ilya Vyugin

A common problem in analytic number theory is to bound the sum of an arithmetic function over a set of integers. Nair and Tenenbaum found a very general bound that applies to short sums of a multivariable arithmetic function over polynomial…

Number Theory · Mathematics 2015-05-27 Kevin Henriot

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

Numerical Analysis · Mathematics 2024-11-26 Prashant Batra

For a prime m, let Phi_m be the classical modular polynomial, and let h(Phi_m) denote its logarithmic height. By specializing a theorem of Cohen, we prove that h(Phi_m) <= 6 m log m + 16 m + 14 sqrt m log m. As a corollary, we find that…

Number Theory · Mathematics 2012-06-26 Reinier Broker , Andrew V. Sutherland

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang
‹ Prev 1 2 3 10 Next ›