English
Related papers

Related papers: Triangular polynomial maps in characteristic $p$

200 papers

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 goal of this note is to bring attention to an interesting family of rings: the rings of $\mathbb Z$-valued functions on $\mathbb Z$ and, more generally, infinite subsets of $\mathbb Z$ whose restrictions to all finite sets are given by…

Number Theory · Mathematics 2024-12-10 Alexander Borisov

Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…

Rings and Algebras · Mathematics 2020-07-09 Dimas J. Gonçalves , Dalton C. Silva

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

Number Theory · Mathematics 2019-01-01 Neranga Fernando , Mohammad Rashid

In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…

Number Theory · Mathematics 2019-11-12 Megha M. Kolhekar , Harish K. Pillai

We study the rationality of the Artin-Mazur zeta function of a dynamical system defined by a polynomial self-map of A^1(k), where k is the algebraic closure of the finite field F_p. The zeta functions of the maps f(x)=x^m for (p,m)=1 and…

Number Theory · Mathematics 2012-05-15 Andrew Bridy

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

Number Theory · Mathematics 2025-10-13 Suman Mondal

Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has…

Combinatorics · Mathematics 2026-05-26 Jonah Berggren

We study the iterative behavior of the family of 3-step linear fractional recurrences and the family of birational maps they define. We determine all the possible periodicities within this family or, equivalently, the birational maps of…

Dynamical Systems · Mathematics 2012-06-12 Eric Bedford , Kyounghee Kim

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

Number Theory · Mathematics 2025-11-12 Przemysław Koprowski

This paper is a direct continuation of the paper arXiv:2401.00053. By this reason neither introductory part of the paper nor the list of references are not duplicated. However for the reader convenience, the formulas from the first paper…

Classical Analysis and ODEs · Mathematics 2025-07-15 V. Vasyunin

We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph $G$ together with a framing $F$. This new family is combinatorially rich and contains as special…

Combinatorics · Mathematics 2025-12-04 Rafael S. González D'León , Christopher R. H. Hanusa , Martha Yip

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

Combinatorics · Mathematics 2008-02-06 Stefan Maubach

In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…

Numerical Analysis · Mathematics 2026-05-11 Peter Cowal , Nicholas F. Marshall , Sara Pollock

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let $N_n(F)$ denote the ring of strictly upper triangular matrices with entries in a field $F$ of characteristic zero and center $Z(N_n(F))$. We characterize the $2$-power commuting maps over $N_n(F)$, maps satisfying the identity…

Rings and Algebras · Mathematics 2025-11-21 Jordan Bounds

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

Number Theory · Mathematics 2016-12-19 Qiang Wang

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

Information Theory · Computer Science 2014-02-25 Cunsheng Ding , Longjiang Qu , Qiang Wang , Jin Yuan , Pingzhi Yuan

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Symbolic Computation · Computer Science 2023-09-26 Mihai Prunescu

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
‹ Prev 1 2 3 10 Next ›