Related papers: Divisibility sequences of polynomials and heights …
This paper is complementary to the work Rosen-Silverman, which derives a criteria on the number fields for the independence of Heegner points associated to them on non-CM elliptic curves. We show that the same criteria holds for CM elliptic…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
We introduce the notion of $\epsilon$-irreducibility for arithmetic cycles meaning that the degree of its analytic part is small compared to the degree of its irreducible classical part. We will show that for every $\epsilon>0$ any…
The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…
We provide a lower bound on the degree of curves of the projective plane $\mathbb{P}^2$ passing through the centers of a divisorial valuation $\nu$ of $\mathbb{P}^2$ with prescribed multiplicities, and an upper bound for the Seshadri-type…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…
Consider an elliptic curve $E$ over a number field $K$. Suppose that $E$ has supersingular reduction at some prime $\mathfrak{p}$ of $K$ lying above the rational prime $p$. We completely classify the valuations of the $p^n$-torsion points…
We study the problem of uncertainty quantification for the numerical solution of elliptic partial differential equation boundary value problems posed on domains with stochastically varying boundaries. We also use the uncertainty…
Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…
We prove an explicit surjectivity result for products of non-isotrivial, non-isogenous elliptic curves over a function field of arbitrary characteristic. This is by way of an isogeny degree bound in this setting, generated from bounds for…
For E/k an elliptic curve with CM by O, we determine a formula for (a generalization of) the arithmetic local constant of [4] at almost all primes of good reduction. We apply this formula to the CM curves defined over Q and are able to…
In this paper, under GRH for elliptic $L$-functions, we give an upper bound for the probability for an elliptic curve with analytic rank $\leq a$ for $a \geq 11$, and also give an upper bound of $n$-th moments of analytic ranks of elliptic…
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…
We study the quantitative unique continuation property of some higher order elliptic operators. In the case of $P=(-\Delta)^m$, where $m$ is a positive integer, we derive lower bounds of decay at infinity for any nontrivial solutions under…