Related papers: Bound the difference of two singular moduli

We study the moduli of continuity of functions of bounded variation and of their variation functions. It is easy to see that the modulus of continuity of a function of bounded variation is always smaller or equal to the modulus of…

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

The equidistribution of roots of quadratic congruences with prime moduli depends crucially upon effective bounds for a special Weyl linear form. Duke, Friedlander and Iwaniec discovered a strong estimate for this Weyl linear form when the…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Some new Frobenius norm bounds of the unique solution to certain structured Sylvester equation are derived. Based on the derived norm upper bounds, new multiplicative perturbation bounds are provided both for subunitary polar factors and…

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a…

Let $\Lambda=\Bbb Z[t,t^{-1}]$ be the ring of Laurent polynomials over $\Bbb Z$. We classify all $\Lambda$-modules $M$ with $|M|=p^n$, where $p$ is a primes and $n\le 4$. Consequently, we have a classification of Alexander quandles of order…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

We establish sharp lower bounds for shifted (with two shifts) moments of Dirichlet $L$-function of fixed modulus under the generalized Riemann hypothesis.

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…