English
Related papers

Related papers: Iterating additive polynomials over finite fields

200 papers

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

Algebraic Geometry · Mathematics 2015-10-21 Mutsuo Oka

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…

Combinatorics · Mathematics 2022-08-23 Michael DiPasquale , Bryan R. Gillespie , Chris Peterson

In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V_n of vectors in R^n…

Number Theory · Mathematics 2007-05-23 Stephen A. DiPippo , Everett W. Howe

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Computational Complexity · Computer Science 2014-07-15 David Harvey , Joris van der Hoeven , Grégoire Lecerf

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

Data Structures and Algorithms · Computer Science 2011-10-20 Javad Doliskani , Eric Schost

We prove that if $f:X \rightarrow A$ is a morphism from a smooth projective variety $X$ to an abelian variety $A$ over a number field $K$, and $G$ is a subgroup of automorphisms of $X$ satisfying certain properties, and if a prime $p$…

Number Theory · Mathematics 2024-12-18 Seokhyun Choi , Bo-Hae Im

Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…

Combinatorics · Mathematics 2022-09-09 Gilyoung Cheong , Jungin Lee , Hayan Nam , Myungjun Yu

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

We prove a necessary condition for some polynomials of Kasami degree to be APN over F_{q^n} for large n.

Information Theory · Computer Science 2011-02-01 François Rodier

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

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Combinatorics · Mathematics 2026-02-25 Thomas Karam

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

Number Theory · Mathematics 2012-01-26 William Worden

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

Number Theory · Mathematics 2018-09-05 Marley Young

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

In this paper we obtain the formal asymptotic expansion of the logarithms $\ln p_s(\alpha)$ of $p_s(\alpha)$, which are canonical continuations of polynomials of binomial type $p_n(\alpha)$. Our approach is based on linear methods which do…

Number Theory · Mathematics 2026-03-03 Danil Krotkov

We consider a region in the complex plane enclosed by a deltoid curve inscribed in the unit circle, and define a family of polynomials $P_n$ that satisfy the same recurrence relation as the Faber polynomials for this region. We use this…

Numerical Analysis · Mathematics 2026-02-06 Peter Cowal , Nicholas F. Marshall , Sara Pollock

Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…

Number Theory · Mathematics 2021-07-16 Paolo Santonastaso , Ferdinando Zullo

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

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

Combinatorics · Mathematics 2024-03-07 Nuno Arala , Sam Chow
‹ Prev 1 4 5 6 7 8 10 Next ›