中文
相关论文

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

200 篇论文

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan

If a reduced bivariate polynomial is quasi-homogeneous, then its discriminant is a monomial. Over fields of characteristic $0$, we show that if one adds another simple condition, this becomes an equivalence. We also give a third equivalent…

交换代数 · 数学 2025-06-04 David Bradley-Williams , Pablo Cubides Kovacsics , Immanuel Halupczok

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

数论 · 数学 2021-11-11 Xiannan Li

Let $k \geq 1$ be a natural number and $f \in \mathbb{F}_q[t]$ be a monic polynomial. Let $\omega_k(f)$ denote the number of distinct monic irreducible factors of $f$ with multiplicity $k$. We obtain asymptotic estimates for the first and…

数论 · 数学 2024-09-16 Sourabhashis Das , Ertan Elma , Wentang Kuo , Yu-Ru Liu

The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…

数论 · 数学 2007-05-23 Yong-Gao Chen , Gabor Kun , Gabor Pete , Imre Z. Ruzsa , Adam Timar

A polynomial f(x) has emergent reducibility at depth n if f^{\circ k}(x) is irreducible for 0\leq k\leq n-1 but f^{\circ n}(x) is reducible. In this paper we prove that there are infinitely many irreducible cubics f \in \mathbb{Z}[x] with…

数论 · 数学 2015-01-08 Jason I. Preszler

Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ is an irreducible polynomial of degree $d\ge 2$ then, $\log \operatorname{lcm} \{f(n)\mid n<x\} \sim (d-1)x\log x.$ In this article, we investigate the analogue of prime arguments, namely,…

数论 · 数学 2022-02-01 Ayan Nath , Abhishek Jha

We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors…

数论 · 数学 2019-09-10 Soumya Bhattacharya

Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…

群论 · 数学 2024-11-14 Mark L. Lewis , Brandon Martin

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

数论 · 数学 2024-10-15 Ofir Gorodetsky , Will Sawin

Let $F_1,\ldots,F_R$ be homogeneous polynomials with integer coefficients in $n$ variables with differing degrees. Write $\boldsymbol{F}=(F_1,\ldots,F_R)$ with $D$ being the maximal degree. Suppose that $\boldsymbol{F}$ is a nonsingular…

数论 · 数学 2024-05-13 Jianya Liu , Sizhe Xie

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

Consider a trigonometric polynomial f of degree N, and associate to it the polynomial F in which each coefficient of f is replaced by its absolute value. F is called the majorant of f. We show that the L^3 norm of f can be larger than that…

经典分析与常微分方程 · 数学 2009-11-10 Ben Green , Imre Ruzsa

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

数论 · 数学 2021-09-23 Lucile Devin , Xianchang Meng

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

数论 · 数学 2017-06-12 Dimitris Koukoulopoulos

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

数论 · 数学 2019-11-13 Lior Bary-Soroker , Jakob Stix

Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…

数论 · 数学 2018-03-29 Bryce Kerr , Ali Mohammadi

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

数论 · 数学 2017-05-23 Zhivko Petrov

We consider harmonic polynomials of real variables $x,y,z$ that are eigenfunctions of the rotations about the axis $z$. They have the form $(x\pm yi)^{n}p(x,y,z)$, where $p$ is a rotation invariant polynomial. Let ${\mathfrak R}_{m}$ be the…

经典分析与常微分方程 · 数学 2019-10-29 Victor Gichev