Search arXiv⌕ Search

arXiv · 2501.11775

Permutation polynomials, projective polynomials, and bijections between $μ_{\frac{q^n-1}{q-1}}$ and $PG(n-1,q)$

Abstract

Using arbitrary bases for the finite field $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$, we obtain the generalized Möbius transformations (GMTs), which are a class of bijections between the projective geometry $PG(n-1,q)$ and the set of roots of unity $μ_{\frac{q^n-1}{q-1}}\subseteq\mathbb{F}_{q^n}$, where $n\geq 2$ is any integer. We also introduce a class of projective polynomials, using the properties of which we determine the inverses of the GMTs. Moreover, we study the roots of those projective polynomials, which lead to a three-way correspondence between partitions of $\mathbb{F}_{q^n}^\ast,μ_{\frac{q^n-1}{q-1}}$ and $PG(n-1,q)$. Through this correspondence and the GMTs, we construct permutation polynomials of index $\frac{q^n-1}{q-1}$ over $\mathbb{F}_{q^n}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tong Lin, Qiang Wang. 2025-05-30. Permutation polynomials, projective polynomials, and bijections between $μ_{\frac{q^n-1}{q-1}}$ and $PG(n-1,q)$. https://arxiv.org/abs/2501.11775

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗