English
Related papers

Related papers: Representation of powers by polynomials over funct…

200 papers

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Combinatorics · Mathematics 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

Rings and Algebras · Mathematics 2012-06-29 P. D'Aquino , G. Terzo

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

Number Theory · Mathematics 2015-08-13 Samuel H. Dalalyan

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

Let G be a finite group of complex n by n unitary matrices generated by reflections acting on C^n. Let R be the ring of invariant polynomials, and \chi be a multiplicative character of G. Let \Omega^\chi be the R-module of \chi-invariant…

Rings and Algebras · Mathematics 2007-05-23 Anne V. Shepler

In the 1920's, Ritt studied the operation of functional composition g o h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple `prime factorizations' with…

Number Theory · Mathematics 2007-10-11 Michael E. Zieve

We develop a theory of multiplicities of roots for polynomials over hyperfields and use this to provide a unified and conceptual proof of both Descartes' rule of signs and Newton's "polygon rule".

Number Theory · Mathematics 2022-07-01 Matthew Baker , Oliver Lorscheid

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

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Number Theory · Mathematics 2017-10-16 Andrei K. Svinin , Svetlana V. Svinina

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

Number Theory · Mathematics 2021-04-08 Jozsef Solymosi , Ethan P. White , Chi Hoi Yip

For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…

Number Theory · Mathematics 2023-09-27 Zhiguo Ding , Michael E. Zieve

We consider the equation $$ ab + cd = \lambda, \qquad a\in A, b \in B, c\in C, d \in D, $$ over a finite field $F_q$ of $q$ elements, with variables from arbitrary sets $ A, B, C, D \subseteq F_q$. The question of solvability of such and…

Number Theory · Mathematics 2007-09-16 Igor E. Shparlinski

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Johan Rosenkilde , Eric Schost

In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…

Complex Variables · Mathematics 2015-06-26 Dan Coman , Evgeny A. Poletsky

A general proposition is proved relating multiplicities (of restriction of a representation of a group to a subgroup) under basechange, and used to calculate some multiplicities for cuspidal representations which become principal series…

Representation Theory · Mathematics 2020-03-24 Dipendra Prasad

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Algebraic Geometry · Mathematics 2009-10-16 Arnaud Bodin

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

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 generalize Bernoulli-Goss polynomials, and give a criterion on the divisibility of zeta functions of cyclotomic function fields. As an application of our criterion, for a given polynomial $f(u)$, we prove that there are…

Number Theory · Mathematics 2018-08-22 Daisuke Shiomi