English
Related papers

Related papers: Points on polynomial curves in small boxes modulo …

200 papers

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Number Theory · Mathematics 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

Combinatorics · Mathematics 2017-01-24 Leyla Işık , Alev Topuzoğlu

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas

We obtain variants of the classical Minkowski Theorem on inhomogeneous approximation where we require moreover that the solutions $p, q$ be coprime integers. We link the subject with density exponents of lattice orbits in the real plane.

Number Theory · Mathematics 2011-10-26 Michel Laurent , Arnaldo Nogueira

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Number Theory · Mathematics 2013-07-23 P. B. Borwein , I. E. Pritsker

For a large class (heuristically most) of irreducible binary cubic forms $F(x,y) \in \mathbb Z[x,y]$, Bennett and Dahmen proved that the generalized superelliptic equation $F(x,y)=z^l$ has at most finitely many solutions in $x,y \in \mathbb…

Number Theory · Mathematics 2020-04-20 George Catalin Turcas

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…

Number Theory · Mathematics 2022-01-24 Nathan Kaplan , Vlad Matei

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

Following Kraitchik and Lehmer, we say that a positive integer $n\equiv1\pmod 8$ is an $x$-pseudosquare if it is a quadratic residue for each odd prime $p\le x$, yet is not a square. We extend this defintion to algebraic curves and say that…

Number Theory · Mathematics 2010-10-22 Reza R. Farashahi , Igor E. Shparlinski

Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic…

Number Theory · Mathematics 2007-06-19 T. D. Browning , D. R. Heath-Brown

Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $\deg f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $\nu_p(|Z(f)|)\ge m(\lceil…

Number Theory · Mathematics 2015-12-17 Xiang-dong Hou

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Number Theory · Mathematics 2012-03-02 Jean Bourgain , Moubariz Garaev , Sergei Konyagin , Igor Shparlinski

We consider a two polynomials analogue of the polynomial interpolation problem. Namely, we consider the Mixing Modular Operations (MMO) problem of recovering two polynomials $f\in \Z_p[x]$ and $g\in \Z_q[x]$ of known degree, where $p$ and…

Rings and Algebras · Mathematics 2014-01-30 Oscar Garcia-Morchon , Ronald Rietman , Ludo Tolhuizen , Domingo Gomez , Jaime Gutierrez

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

Symbolic Computation · Computer Science 2023-09-04 Christoph Koutschan , Ali K. Uncu , Elaine Wong

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

Number Theory · Mathematics 2019-02-25 Victor J. W. Guo , Michael J. Schlosser

Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of…

Combinatorics · Mathematics 2019-08-20 Adel Hamdi