English
Related papers

Related papers: The exceptional set in a generalized Goldbach`s pr…

200 papers

We show that for every fixed $A>0$ and $\theta>0$ there is a $\vartheta=\vartheta(A,\theta)>0$ with the following property. Let $n$ be odd and sufficiently large, and let $Q_{1}=Q_{2}:=n^{\h}(\log n)^{-\vartheta}$ and $Q_{3}:=(\log…

Number Theory · Mathematics 2008-03-07 Karin Halupczok

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

Given integers $k_1, k_2$ with $0\le k_1<k_2$, the determinations of all positive integers $q$ for which there exists a perfect Splitter $B[-k_1, k_2](q)$ set is a wide open question in general. In this paper, we obtain new necessary and…

Information Theory · Computer Science 2019-03-04 Pingzhi Yuan , Kevin Zhao

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

Number Theory · Mathematics 2007-05-23 T. D. Browning

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Commutative Algebra · Mathematics 2019-12-13 John Abbott , Anna Maria Bigatti , Lorenzo Robbiano

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

Commutative Algebra · Mathematics 2014-02-26 Arnaud Bodin , Guillaume Chéze , Pierre Débes

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

Information Theory · Computer Science 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

We show that there exists a saturated graded ideal in a standard graded polynomial ring which has the largest total Betti numbers among all saturated graded ideals for a fixed Hilbert polynomial.

Commutative Algebra · Mathematics 2016-01-20 Giulio Caviglia , Satoshi Murai

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

Number Theory · Mathematics 2025-06-18 Jori Merikoski

We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of…

Number Theory · Mathematics 2014-01-31 David P. Roberts

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Number Theory · Mathematics 2024-09-25 Kaimin Cheng , Shuhong Gao

We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polynomial g is fixed. Considering all the elements f of fixed…

Combinatorics · Mathematics 2020-01-13 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…

Group Theory · Mathematics 2014-08-08 John R. Britnell , Neil Saunders , Tony Skyner

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…

Number Theory · Mathematics 2025-11-04 Boyuan Xiong

We study a generalization of the \emph{Frobenius problem}: given $k$ positive relatively prime integers, what is the largest integer $g_0$ that cannot be represented as a nonnegative integral linear combination of these parameters? More…

Number Theory · Mathematics 2013-10-07 Matthias Beck , Curtis Kifer

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…

Number Theory · Mathematics 2017-08-11 François Legrand

Goldbach's comet is the plot of the Goldbach function g(n), in the interval [3, N], with a large positive integer N. The function g(n) counts the number of different ways in which 2n can be expressed as the sum of two odd primes. An…

General Mathematics · Mathematics 2012-03-07 Donato Saeli , Maurizio Spano

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer