Related papers: Notes on summation polynomials

We compute the $F$-pure threshold of a degree three homogeneous polynomial in three variables with an isolated singularity. The computation uses elementary methods to prove a known result of Bhatt and Singh.

We use a recent characterization of minimal value set polynomials and $q$- Frobenius nonclassical curves to construct curves that generalize the Hermitian curve. The genus $g$ and the number $N$ of $\mathbb{F}_q$-rational points of the…

We discuss methods for using the Weil polynomial of an isogeny class of abelian varieties over a finite field to determine properties of the curves (if any) whose Jacobians lie in the isogeny class. Some methods are strong enough to show…

While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

In this work, the combine the theory of generalized critical values with the theory of iterated rings of bounded elements (real holomorphy rings). We consider the problem of computing the global infimum of a real polynomial in several…

Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…

Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

We give an explicit description of the behaviour of the root number in the family given by twists of an elliptic curve $E$ by the rational values of a polynomial $f(T)$. In particular, we give a criterion (on $f$ depending on $E$) for the…

Following Katz-Sarnak, Iwaniec-Luo-Sarnak, and Rubinstein, we use the 1- and 2-level densities to study the distribution of low lying zeros for one-parameter rational families of elliptic curves over Q(t). Modulo standard conjectures, for…

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

It has often been claimed in recent papers that one can find a degree d Sum-of-Squares proof if one exists via the Ellipsoid algorithm. In [O17], Ryan O'Donnell notes this widely quoted claim is not necessarily true. He presents an example…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…