English
Related papers

Related papers: Polynomials assuming only local prime powers

200 papers

In this paper the author considers a particular type of polynomials with integer coefficients, consisting of a perfect power and two norm forms of abelian number fields with coprime discriminants. It is shown that such a polynomial…

Number Theory · Mathematics 2015-11-30 Jeongho Park

We study a question on characterizing polynomials among rational functions of degree $>1$ on the projective line over an algebraically closed field that is complete with respect to a non-trivial and non-archimedean absolute value, from the…

Number Theory · Mathematics 2020-01-14 Yûsuke Okuyama , Małgorzata Stawiska

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Commutative Algebra · Mathematics 2010-05-11 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives…

Logic in Computer Science · Computer Science 2007-05-23 Robert Givan , David McAllester

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

Group Theory · Mathematics 2020-08-12 David Kyed , Henrik Densing Petersen

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

Number Theory · Mathematics 2024-06-24 Rodrigo Angelo , Max Wenqiang Xu

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

Let $p$ be a prime. For $p=2$, the fields of values of the complex irreducible characters of finite groups whose degrees are not divisible by $p$ have been classified; for odd primes $p$, a conjectural classification has been proposed. In…

Representation Theory · Mathematics 2026-01-26 Nguyen N. Hung , Gabriel Navarro , Pham Huu Tiep

For $p$ prime and $\ell = \frac{p-1}{2}$, we show that the shapes of pure prime degree number fields lie on one of two $\ell$-dimensional subspaces of the space of shapes, and which of the two subspaces is dictated by whether or not $p$…

Number Theory · Mathematics 2022-09-23 Erik Holmes

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

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…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

Symbolic Computation · Computer Science 2015-02-16 Ashwin Guha , Ambedkar Dukkipati