Related papers: Bound the difference of two singular moduli

Consider the Fourier expansions of two elements of a given space of modular forms. How many leading coefficients must agree in order to guarantee that the two expansions are the same? Sturm gave an upper bound for modular forms of a given…

Given a singular modulus $j_0$ and a set of rational primes $S$, we study the problem of effectively determining the set of singular moduli $j$ such that $j-j_0$ is an $S$-unit. For every $j_0 \neq 0$, we provide an effective way of finding…

We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…

In this work we study the moduli part in the canonical bundle formula of an lc-trivial fibration whose generic fibre is a rational curve. In particular we find a bound for the denominators of the discriminant and the moduli divisor.

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

We obtain lower bounds for the maximum dimension of a simple FG-module, where G is a finite group and F is an algebraically closed field of characteristic p. The bounds are described in terms of properties of p-subgroups of G. When p is 2…

We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

This talk presents work concepts and results for the determination of the fine structure constant $\alpha$ at the $Z_0$ mass resonance. The problem consisting of the break-down of global duality for singular integral weights is circumvented…

Simple upper and lower bounds are established for the integral $\int_0^x\mathrm{e}^{-\beta u}u^\nu t_{\mu,\nu}(u)\,\mathrm{d}u$, where $x>0$, $0<\beta<1$, $\mu+\nu>-2$, $\mu-\nu\geq-3$, and $t_{\mu,\nu}(x)$ is the modified Lommel function…

Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.

We give explicit upper and lower bounds on the size of the coefficients of the modular polynomials $\Phi_N$ for the elliptic $j$-function. These bounds make explicit the best previously known asymptotic bounds. We then give an explicit…

An upper bound on operator norms of compound matrices is presented, and special cases that involve the $\ell_1$, $\ell_2$ and $\ell_\infty$ norms are investigated. The results are then used to obtain bounds on products of the largest or…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We prove an improvement on Schmidt's upper bound on the number of number fields of degree $n$ and absolute discriminant less than X for $6 \leq n \leq 94$. We carry this out by improving and applying a uniform bound on the number of monic…

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…