English
Related papers

Related papers: Sufficient conditions for a problem of Polya

200 papers

For a field K, rational function phi in K(z) of degree at least two, and alpha in P^1(K), we study the polynomials in K[z] whose roots are given by the solutions to phi^n(z) = alpha, where phi^n denotes the nth iterate of phi. When the…

Number Theory · Mathematics 2021-11-24 Rafe Jones , Alon Levy

Suppose K is a field of characteristic 0, $K_a$ is its algebraic closure, p is an odd prime. Suppose, $f(x) \in K[x]$ is a polynomial of degree $n \ge 5$ without multiple roots. Let us consider a curve $C: y^p=f(x)$ and its jacobian J(C).…

Algebraic Geometry · Mathematics 2007-05-23 Yuri G. Zarhin

A theorem of J. Silverman states that a forward orbit of a rational map $\phi(z)$ on $\mathbb P^1(K)$ contains finitely many $S$-integers in the number field $K$ when $(\phi\circ\phi)(z)$ is not a polynomial. We state an analogous…

Number Theory · Mathematics 2010-07-01 Vijay A. Sookdeo

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

History and Overview · Mathematics 2011-08-24 Leonid Lerner

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

Commutative Algebra · Mathematics 2015-07-15 Elisângela Silva Dias , Diane Castonguay

In this note we use a result of Kantor to prove a conjecture of Degos. Specifically we prove the following: let $\mathbb{F}$ be a finite field of order $q$ and let $f, g\in\mathbb{F}[X]$ be distinct polynomials of degree $n$ such that $f$…

Group Theory · Mathematics 2015-10-21 Nick Gill

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

Classical Analysis and ODEs · Mathematics 2022-03-04 Askold Khovanskii , Sushil Singla , Aaron Tronsgard

The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…

Commutative Algebra · Mathematics 2020-09-08 Dilip P. Patil , Jugal Verma

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

We characterize finite Galois extensions $K$ of the field of rational numbers in terms of the rings ${\rm Int}_{\mathbb{Q}}(\mathcal O_K)$, recently introduced by Loper and Werner, consisting of those polynomials which have coefficients in…

Number Theory · Mathematics 2018-09-26 Bahar Heidaryan , Matteo Longo , Giulio Peruginelli

Given an abelian algebraic group $A$ over a global field $F$, $\alpha \in A(F)$, and a prime $\ell$, the set of all preimages of $\alpha$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion…

Number Theory · Mathematics 2012-01-27 Rafe Jones , Jeremy Rouse

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

Number Theory · Mathematics 2024-12-31 Lior Bary-Soroker , Noam Goldgraber

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

Number Theory · Mathematics 2018-07-27 Hua Huang , Shanmeng Han , Wei Cao

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2024-06-03 Lenny Jones

Systems of equations and their solution sets are studied in polyadic groups. We prove that a polyadic group $(G, f)=\mathrm{der}_{\theta, b}(G, \cdot)$ is equational noetherian, if and only if the ordinary group $(G, \cdot)$ is equational…

Group Theory · Mathematics 2015-09-01 H. Khodabandeh , M. Shahryari

Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q_p for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible…

Number Theory · Mathematics 2011-04-19 Daniel Rabayev , Jack Sonn

Let F:K be a Galois extension of number fields and Q a prime ideal of O_F lying over the prime P of O_K. By analyzing the Q-adic closure of O_K in O_F we characterize those rings of integers O_K for which every residue class ring of…

Number Theory · Mathematics 2024-12-24 Sophie Frisch , Franz Halter-Koch

An abelian monogenic polynomial $f(x)\in {\mathbb Z}[x]$ is a monic polynomial of degree $N$ that is irreducible over ${\mathbb Q}$, such that the Galois group of $f(x)$ over ${\mathbb Q}$ is abelian, and…

Number Theory · Mathematics 2026-05-26 Lenny Jones

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…

Computational Complexity · Computer Science 2020-03-12 Shir Peleg , Amir Shpilka