I'm writing an assignment on permutation polynomials (PP). I've already explored quite a few generalizations and characterization of PPs over $\mathbb{Z}_p$ for $p$ prime (and finite fields in general) and $\mathbb{Z}$. I'm looking for another numbering system to analyze, ideally one where it is easy to derive a general form for any PP. This was was easily accomplishable for $\mathbb{Z}$ using basic properties of the evaluation map and for $\mathbb{Z}_p$ using Lagrange interpolation + related techniques. I would like this numbering system to be a non-finite field or any commutative ring with unity. If anyone has any suggestions, it would be much appreciated.
2026-05-05 16:43:15.1777999395
What are some examples of numbering systems for which it is easy to generalize permutation polynomials?
54 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in POLYNOMIALS
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Integral Domain and Degree of Polynomials in $R[X]$
- Can $P^3 - Q^2$ have degree 1?
- System of equations with different exponents
- Can we find integers $x$ and $y$ such that $f,g,h$ are strictely positive integers
- Dividing a polynomial
- polynomial remainder theorem proof, is it legit?
- Polyomial function over ring GF(3)
- If $P$ is a prime ideal of $R[x;\delta]$ such as $P\cap R=\{0\}$, is $P(Q[x;\delta])$ also prime?
- $x^{2}(x−1)^{2}(x^2+1)+y^2$ is irreducible over $\mathbb{C}[x,y].$
Related Questions in RING-THEORY
- Jacobson radical = nilradical iff every open set of $\text{Spec}A$ contains a closed point.
- A commutative ring is prime if and only if it is a domain.
- Find gcd and invertible elements of a ring.
- Prove that $R[x]$ is an integral domain if and only if $R$ is an integral domain.
- Prove that $Z[i]/(5)$ is not a field. Check proof?
- If $P$ is a prime ideal of $R[x;\delta]$ such as $P\cap R=\{0\}$, is $P(Q[x;\delta])$ also prime?
- Let $R$ be a simple ring having a minimal left ideal $L$. Then every simple $R$-module is isomorphic to $L$.
- A quotient of a polynomial ring
- Does a ring isomorphism between two $F$-algebras must be a $F$-linear transformation
- Prove that a ring of fractions is a local ring
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Related Questions in FINITE-FIELDS
- Covering vector space over finite field by subspaces
- Reciprocal divisibility of equally valued polynomials over a field
- Solving overdetermined linear systems in GF(2)
- Proof of normal basis theorem for finite fields
- Field $\mathbb{Q}(\alpha)$ with $\alpha=\sqrt[3]7+2i$
- Subfield of a finite field with prime characteristic
- Rank of a Polynomial function over Finite Fields
- Finite fields of order 8 and isomorphism
- Finding bases to GF($2^m$) over GF($2$)
- How to arrange $p-1$ non-zero elements into $A$ groups of $B$ where $p$ is a prime number
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The following springs to mind.
Quadratic permutation polynomials on $\Bbb{Z}_m$.
Let $m>1$ be any integer. Consider the quadratic polynomial function $$ f:\Bbb{Z}_m\to\Bbb{Z}_m, x\mapsto ax+bx^2. $$ Prove the following (it's relatively easy, ask if you need a hint).
Lemma. If $\gcd(a,m)=1$ and $b$ is divisible by every prime factor of $m$, then $f$ is a permutation.
The reason I recommend this is that such permutation polynomials are used heavily in the LTE standard as turbo code interleavers (the version of the standard that was finalized in 2009, updates pending, and eventually this part is likely to become obsolete). In other words, unless my information is "dated", chances are your cell phone is calculating such permutations a few million times per second. The version of LTE I recall specified a range of values for $m$, each divisible by a relatively high power of two, and an optimized $(a,b)$ pair for each such $m$. The reasons for selecting such permutations are a bit technical, but I think this application is too cool to pass.
The idea was introduced in
J. Sun and O. Y. Takeshita, “Interleavers for turbo codes using permutation polynomials over integer rings,” IEEE Trans. Inf. Theory, vol.51, no. 1, pp. 101–119, Jan. 2005.
This is behind IEEE paywall, but hopefully your institute has access. Probably any reference to 3GPP minutes and/or specs I used back in the day are outdated. When I worked for at the time largish cellular player, I studied the inverse permutations a bit more intensely :-)