English
Related papers

Related papers: Notes on summation polynomials

200 papers

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

Number Theory · Mathematics 2022-11-17 László Mérai , Igor E. Shparlinski , Arne Winterhof

For any number field K with a complex place, we present an infinite family of elliptic curves defined over K such that $dim \mathbb{F}_2 Sel_2(E^F/K) \ge dim \mathbb{F}_2 E^F(K)[2] + r_2$ for every quadratic twist E^F of every curve E in…

Number Theory · Mathematics 2012-10-23 Zev Klagsbrun

Let $\E$ be an elliptic curve over a finite field $\F_{q}$ of $q$ elements, with $\gcd(q,6)=1$, given by an affine Weierstra\ss\ equation. We also use $x(P)$ to denote the $x$-component of a point $P = (x(P),y(P))\in \E$. We estimate…

Number Theory · Mathematics 2010-05-27 Reza R. Farashahi , Igor E. Shparlinski

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…

Rings and Algebras · Mathematics 2016-09-07 Steve Seif , Zeljko Sokolovic , Csaba Szabo

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…

Computational Geometry · Computer Science 2011-03-01 Michael Burr , Sung Woo Choi , Ben Galehouse , Chee Yap

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…

Number Theory · Mathematics 2017-10-03 Alisa Sedunova

Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We study the sums \[ S_{\chi,P}(N,h) = \sum_{n=1}^N \chi(\psi_n(P)) \chi(\psi_{n+h}(P)), \] where…

Number Theory · Mathematics 2025-07-15 Subham Bhakta , Igor E. Shparlinski

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

Number Theory · Mathematics 2025-10-09 Masahiro Mine

Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…

Machine Learning · Computer Science 2023-12-05 Hannah Lawrence , Mitchell Tong Harris

We propose a First-Order System Least Squares (FOSLS) method based on deep-learning for numerically solving second-order elliptic PDEs. The method we propose is capable of dealing with either variational and non-variational problems, and…

Numerical Analysis · Mathematics 2022-12-15 Francisco M. Bersetche , Juan Pablo Borthagaray

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

We extend known results on the number of solutions to a linear equation in at least three prime numbers when the primes involved are required to lie in specified Chebotarev classes. We prove asymptotic results similar to previous ones only…

Number Theory · Mathematics 2012-11-07 Daniel M. Kane

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Number Theory · Mathematics 2019-01-04 Saiying He , James Mc Laughlin

Upon solving a finite discrete reduction of the difference Heun equation, we arrive at an elliptic generalization of the Racah polynomials. We exhibit the three-term recurrence relation and the orthogonality relations for these elliptic…

Classical Analysis and ODEs · Mathematics 2022-07-13 Jan Felipe van Diejen , Tamás Görbe

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

Number Theory · Mathematics 2022-08-26 Derek Garton