English
Related papers

Related papers: Notes on summation polynomials

200 papers

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

Commutative Algebra · Mathematics 2018-12-12 Carlos D'Andrea , Teresa Krick , Agnes Szanto , Marcelo Valdettaro

The purpose of this article is to prove a ``Newton over Hodge'' result for exponential sums on curves. Let $X$ be a smooth proper curve over a finite field $\mathbb{F}_q$ of characteristic $p\geq 3$ and let $V \subset X$ be an affine curve.…

Number Theory · Mathematics 2021-03-03 Joe Kramer-Miller

Let R be a commutative ring with 1. For every homogeneous polynomial f(X_0,X_1,X_2) in R[X_0,X_1,X_2] of degree d <= 25, we find a explicit linear Pfaffian R-representation of f. We describe an empirical method that leads us to find such…

Algebraic Geometry · Mathematics 2018-04-10 David Oscari

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

Number Theory · Mathematics 2025-02-25 Guido Lido

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Algebraic Geometry · Mathematics 2008-07-22 Tim Netzer

Function values are, in some sense, "almost as good" as general linear information for $L_2$-approximation (optimal recovery, data assimilation) of functions from a reproducing kernel Hilbert space. This was recently proved by new upper…

Numerical Analysis · Mathematics 2022-03-23 Aicke Hinrichs , David Krieg , Erich Novak , Jan Vybiral

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

We develop a graph-theoretic algorithm to compute the $\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\mathbb{Q}(i)$, where $b \in \mathbb{Z}[i]$ and $\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a…

Number Theory · Mathematics 2025-06-24 Anthony Kling , Ben Savoie

We study the parity of 2-Selmer ranks in the family of quadratic twists of an arbitrary elliptic curve E over an arbitrary number field K. We prove that the fraction of twists (of a given elliptic curve over a fixed number field) having…

Number Theory · Mathematics 2022-10-11 Zev Klagsbrun , Barry Mazur , Karl Rubin

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

We begin a generalized study of sum-product type phenomenon in different fields by considering pairs $P(x,y)$ and $Q(x,y)$ of two variable polynomials that simultaneously exhibit small symmetric expansion. Our first result is that such…

Combinatorics · Mathematics 2019-10-15 Yifan Jing , Souktik Roy , Chieu-Minh Tran

Let G < SL(V) be a finite group, V is finite dimensional over a field F, p=char F and S(V) is the symmetric algebra of V. We determine when the subring of G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if F is…

Commutative Algebra · Mathematics 2024-11-20 Amiram Braun

In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte. It says that a symmetric real polynomial $F$ of degree $d$ in $n$ variables is positive on $\R^n$ (on $\R^{n}_{\geq 0}$) if and only if it…

Algebraic Geometry · Mathematics 2013-03-22 Cordian Riener

We study the generalized Lam\'e equation on an elliptic curve $E$ with multiple singularities. By restricting to the locus admitting solutions with quasi-periodic properties, we construct two curves: (i) The generalized Lam'e curve: with…

Algebraic Geometry · Mathematics 2026-04-24 You-Cheng Chou , Chin-Lung Wang , Po-Sheng Wu

In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…

Number Theory · Mathematics 2007-05-23 D. Sadornil

We introduce SP$\mathbb{Q}$R, a new Mathematica package for the division and elimination of variables from polynomial systems. SP$\mathbb{Q}$R works by sampling and reconstructing results over finite fields, in an analogous manner to many…

High Energy Physics - Theory · Physics 2025-11-20 Vsevolod Chestnov , Giulio Crisanti

We show that if $E/\mathbb{Q}$ is an elliptic curve without complex multiplication and for which there is a prime $q$ such that the image of $\bar{\rho}_{E,q}$ is contained in the normaliser of a split Cartan subgroup of…

Number Theory · Mathematics 2018-10-24 Pedro Lemos

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Algebraic Geometry · Mathematics 2025-09-03 Boris Kazarnovskii

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Number Theory · Mathematics 2011-10-24 Thomas Stoll

The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise…

Computational Complexity · Computer Science 2013-07-31 Adam Chalcraft , Samuel Kutin , David Petrie Moulton
‹ Prev 1 8 9 10 Next ›