相关论文: Root numbers and the parity problem

We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…

Given an algebraic family $f\colon\Lambda\times \mathbb{A}^2 \to \Lambda\times \mathbb{A}^2$ of plane polynomial automorphisms of H\'enon type parameterized by a quasi-projective curve, defined over a number field $\mathbb{K},$ we…

Let $E/\mathbb{Q}$ be an elliptic curve and $p > 2$ be a prime of good ordinary reduction for $E$. Assume that the residue representation associated with $(E, p)$ is irreducible. In this paper, we prove more cases on several Iwasawa main…

The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…

We use Heegner points to prove the existence of nontorsion rational points on the elliptic curve $y^2 = x^3 + D$ for any rational number $D=a/b$ such that $a$ and $b$ are squarefree integers for which $6$, $a$, and $b$ are pairwise…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

The Casas-Alvero conjecture says that a degree $n$ complex univariate polynomial sharing a root with each of its derivative must have only one root. In this article we give three results. The first one, is that the number of possible…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

A family $\mathcal{F}$ of elliptic curves defined over number fields is said to be typically bounded in torsion if the torsion subgroups $E(F)[$tors$]$ of those elliptic curves $E_{/F}\in \mathcal{F}$ can be made uniformly bounded after…

A weaker form of a 1979 conjecture of Goldfeld states that for every elliptic curve $E/\mathbb{Q}$, a positive proportion of its quadratic twists $E^{(d)}$ have rank 1. Using tools from Galois cohomology, we give criteria on E and d which…

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…

This paper introduces the concept of generalized interlacing families of polynomials, which extends the classical interlacing polynomial method to handle polynomials of varying degrees. We establish a fundamental property for these…

We study the weak asymptotic behavior of the zeros of a family of a certain class of (generalized) hypergeometric polynomials, using the associated hypergeometric differential equation, as the parameters go to infinity. We describe the…

A complete subgraph of a given graph is called a clique. A clique Polynomial of a graph is a generating function of the number of cliques in $G$. A real root of the clique polynomial of a graph $G$ is called a \emph{clique root} of $G$. \\…