English
Related papers

Related papers: Irreducible quadratic polynomials and Euler's func…

200 papers

We investigate non-unique factorization of polynomials in Z_{p^n}[x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Z_{p^n}[x] is atomic. We reduce the question of factoring arbitrary…

Number Theory · Mathematics 2011-03-21 Christopher Frei , Sophie Frisch

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…

Computational Physics · Physics 2010-02-18 Riccardo Borghi

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$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

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…

Number Theory · Mathematics 2007-05-23 Yong-Gao Chen , Gabor Kun , Gabor Pete , Imre Z. Ruzsa , Adam Timar

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

Number Theory · Mathematics 2026-03-09 Jake Chinis , Besfort Shala

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

General Mathematics · Mathematics 2025-10-14 Valery Asiryan

In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as…

Number Theory · Mathematics 2025-05-22 Xiumei Li , Min Sha

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Combinatorics · Mathematics 2025-07-23 Niels Lubbes , Mehdi Makhul , Josef Schicho , Audie Warren

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

Combinatorics · Mathematics 2016-04-15 Petter Brändén , Madeleine Leander

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…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

Number Theory · Mathematics 2016-10-13 David Krumm

Consider the following truncated Freud linear functional $\mathbf{u}_z$ depending on a parameter $z$, $$\langle\mathbf{u}_z,p\rangle=\int_0^\infty p(x)e^{-zx^4}dx,\quad z>0.$$ The aim of this work is to analyze the properties of the…

Classical Analysis and ODEs · Mathematics 2025-10-13 Juan Carlos García-Ardila , Francisco Marcellán , Misael E. Marriaga

The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…

Number Theory · Mathematics 2011-09-02 T. D. Browning , D. R. Heath-Brown

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

Number Theory · Mathematics 2025-03-19 Isaac Rajagopal

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

Number Theory · Mathematics 2023-11-28 Jitender Singh , Sanjeev Kumar

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

We prove that non-pretentious multiplicative functions are orthogonal to polynomials over $\mF_q[x]$ (up to characteristic conditions).

Number Theory · Mathematics 2025-09-17 Tal Meilin

If $P\subset \R^d$ is a rational polytope, then $i_P(n):=#(nP\cap \Z^d)$ is a quasi-polynomial in $n$, called the Ehrhart quasi-polynomial of $P$. The period of $i_P(n)$ must divide $\LL(P)= \min \{n \in \Z_{> 0} \colon nP \text{is an…

Combinatorics · Mathematics 2016-09-07 Tyrrell B. McAllister , Kevin M. Woods

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt