中文
相关论文

相关论文: The parity problem for reducible cubic forms

200 篇论文

We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.

数论 · 数学 2015-10-06 D. R. Heath-Brown , Xiannan Li

Let $k$ be a field of odd characteristic $p$. Fix an even number $d<p+1$ and a power $q\geq d+3$ of $p$. For most choices of degree $d$ standard graded hypersurfaces $R=k[x,y,z]/(f)$ with homogeneous maximal ideal $\mathfrak{m}$, we can…

交换代数 · 数学 2025-02-18 Heath Camphire

In this paper, we consider complex polynomials of degree three with distinct zeros and their polarization ((z1,z2,z3) with three complex variables. We show, through elementary means, that the variety P(z1,z2,z3)=0 is birationally equivalent…

复变函数 · 数学 2019-09-13 Chayne Planiden , Hristo Sendov

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

数论 · 数学 2024-03-05 Alexandre Bailleul , Lucile Devin , Daniel Keliher , Wanlin Li

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

计算复杂性 · 计算机科学 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

综合数学 · 数学 2020-03-23 Yu-Lin Chou

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

数论 · 数学 2018-09-07 Lucas Reis

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

代数几何 · 数学 2008-05-06 Gennadiy Averkov

Let G be the absolute Galois group of a global field. Let r1 and r2 be two p-adic, finite dimensional representations of G. Then there exists a finite number of primes q such that if the characteristic polynomials of r1(Frob_q) and…

数论 · 数学 2019-05-28 Loic Grenie

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

数论 · 数学 2017-02-17 S. I. Dimitrov

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…

数论 · 数学 2016-03-29 Andreas O. Bender , Olivier Wittenberg

This paper is a contribution to the description of some congruences on the odd prime factors of the class number of the number fields. An example of results obtained is: Let L/Q be a finite Galois solvable extension with [L:Q]=N, where N >…

数论 · 数学 2007-05-23 Roland Queme

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

数论 · 数学 2012-04-18 Ruslan Sharipov

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

数论 · 数学 2024-12-17 Claire Burrin , Matthew Issac

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

数论 · 数学 2025-10-06 Ken Ono

Given a pair of regular quadratic forms over $\mathbb{Q}$ which are in the same genus and a finite set of primes $P$, we show that there is an effective way to determine a rational equivalence between these two quadratic forms which are…

数论 · 数学 2020-08-04 Wai Kiu Chan , Haochen Gao , Han Li

Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…

历史与综述 · 数学 2015-11-16 Danil Akhtyamov , Ilya Bogdanov

Let $n$ be an even positive integer with at most three distinct prime factors and let $\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \in \Q[x]$ having at least…

数论 · 数学 2011-11-16 A. Satyanarayana Reddy