English
Related papers

Related papers: Irreducibility of $x^n-a$

200 papers

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

Commutative Algebra · Mathematics 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

Complex Variables · Mathematics 2016-05-19 Guillaume Rond , Bernd Schober

We show that Pinney's equation [2] with a constant coefficient can be reduced to its linear part by a simple change of variables. Also, Pinney's original solution is simplified slightly.

Analysis of PDEs · Mathematics 2019-02-08 Philip Korman

Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation.…

Quantum Physics · Physics 2015-05-13 V. I. Yukalov

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

Number Theory · Mathematics 2018-02-07 Ron Evans , Mark Van Veen

This paper deals with sufficiency conditions for irreducibility of certain induced modules. We also construct irreducible representations for a group $G$ over a field ${\mathbb K}$ where the group $G$ is a semidirect product of a normal…

Group Theory · Mathematics 2009-08-04 Geetha Venkataraman

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…

Number Theory · Mathematics 2015-01-08 Jason I. Preszler

We give a new sufficient criteria to prove the uniqueness of the incompressible Euler equation in dimension $N\geq2$. In their celebrated works by V. Scheffer [18], A. Shnirelman [19], C. De Lellis and L. Sz\'ekelyhidi Jr. [7] they have…

Analysis of PDEs · Mathematics 2019-06-13 Shyam Sundar Ghoshal , Animesh Jana

We generalise the exponential Ax-Schanuel theorem to arbitrary linear differential equations with constant coefficients. Using the analysis of the exponential differential equation by J. Kirby and C. Crampin we give a complete…

Logic · Mathematics 2018-01-19 Vahagn Aslanyan

It is a classical fact that the irrationality of a number $\xi\in\mathbb R$ follows from the existence of a sequence $p_n/q_n$ with integral $p_n$ and $q_n$ such that $q_n\xi-p_n\ne0$ for all $n$ and $q_n\xi-p_n\to0$ as $n\to\infty$. In…

Number Theory · Mathematics 2018-08-06 Wadim Zudilin

For certain elliptic curves $E$ over $\mathbb{Q}$ with multiplicative reduction at a prime $p\geq 5$, we prove the $p$-indivisibility of the derived Heegner classes defined with respect to an imaginary quadratic field $K$, as conjectured by…

Number Theory · Mathematics 2014-07-07 Christopher Skinner , Wei Zhang

The simplest version of Bertini's irreducibility theorem states that the generic fiber of a non-composite polynomial function is an irreducible hypersurface. The main result of this paper is its analog for a free algebra: if $f$ is a…

Rings and Algebras · Mathematics 2019-08-27 Jurij Volčič

In this short note we give an expression for some numbers $n$ such that the polynomial $x^{2p}-nx^p+1$ is reducible.

Number Theory · Mathematics 2013-11-06 Ralf Stephan

We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power…

Number Theory · Mathematics 2020-07-03 Olli Järviniemi

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

Number Theory · Mathematics 2023-01-03 Jitender Singh , Sanjeev Kumar

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

Number Theory · Mathematics 2019-07-09 Vefa Goksel

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

We provide an alternative proof that the finite rational linear combination of radicals, under certain constraint, are linearly independent over $\mathbb{Q}$.

Number Theory · Mathematics 2020-07-01 Sourav Koner , Dhiren Kumar Basnet

In this work, the q-analogue of Bernoulli inequality is proved. Some other related results are presented.

Classical Analysis and ODEs · Mathematics 2018-03-28 Mohammad W. Alomari

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

Number Theory · Mathematics 2024-09-17 Tori Day , Rebecca DeLand , Jamie Juul , Cigole Thomas , Bianca Thompson , Bella Tobin