Related papers: An explicit height bound for the classical modular…
The second part of Hilbert's 16th problem concerns determining the maximum number $H(m)$ of limit cycles that a planar polynomial vector field of degree $m$ can exhibit. A natural extension to the three-dimensional space is to study the…
Given a prime $p \ge 5$ and an abstract odd representation $\rho_n$ with coefficients modulo $p^n$ (for some $n \ge 1$) and big image, we prove the existence of a lift of $\rho_n$ to characteristic $0$ whenever local lifts exist (under some…
There are two fundamental problems motivated by Silverman's conversations over the years concerning the nature of the exact values of canonical heights of $f(z)\in\bar{\mathbb{Q}}(z)$ where $f$ has degree $d\geq 2$. The first problem is the…
We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…
The classical modular polynomials $\Phi_\ell(X,Y)$ give plane curve models for the modular curves $X_0(\ell)/\mathbb{Q}$ and have been extensively studied. In this article, we provide closed formulas for $\ell$ nontrivial coefficients of…
Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z)…
We consider the problem of explicitly computing Beilinson--Bloch heights of homologically trivial cycles on varieties defined over number fields. Recent results have established a congruence, up to the rational span of logarithms of primes,…
The largest coefficient (in absolute value) of a cyclotomic polynomial $\Phi_n$ is called its height $A(n)$. In case $p$ is a fixed prime it turns out that as $q$ and $r$ range over all primes satisfying $p<q<r$, the height $A(pqr)$ assumes…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…
We prove sharp estimates on the quadratic strand of the resolution of any homogeneous prime ideal in a standard graded polynomial ring over an arbitrary field. Our bounds only depend on the height of the prime ideal, and they are optimal…
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…
In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…
Given an endomorphism f of projective space, we exhibit explicit bounds on the difference between the naive height of a divisor and its canonical height relative to f.
In this paper, we consider sums of four generalized polygonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restriction on m modulo 30, we show that for n sufficiently large, it can…
We completely determine the minimal polynomial of an arbitrary simple highest weight module $L(\lambda)$ over a complex classical Lie algebra $\mathfrak{g}\subseteq\mathfrak{gl}_N$ relative to its defining module $\pi=\mathbb{C}^{N}$. These…
Given a polynomial $g$ of positive degree over a finite field, we show that the proportion of polynomials of degree $n$, which can be written as $h+g^k$, where $h$ is an irreducible polynomial of degree $n$ and $k$ is a nonnegative integer,…
By means of the $q$-Zeilberger algorithm, we prove a basic hypergeometric supercongruence modulo the fifth power of the cyclotomic polynomial $\Phi_n(q)$. This result appears to be quite unique, as in the existing literature so far no basic…