Search arXivSearch

arXiv · 2510.09086

An algebraic approach to Latin squares of prime power order by local permutation polynomials

Abstract

Every Latin square of prime power order $q$ is uniquely described by a local permutation polynomial (LPP) in the polynomial ring $\mathbb{F}_q[x,y]$. Despite this equivalence, one may find in the literature only some preliminary results on the relationship among Latin squares and LPPs. This paper delves into this topic by showing how the coefficients of any LPP are identified with the zeros of an algebraic set over $\mathbb{F}_q$. This allows for an algebraic description of all Latin squares of order $q$ by means of a unique polynomial in $\mathbb{F}_q[x,y]$, whose coefficients satisfy the constraints defined by the algebraic set under consideration. In order to make much easier the construction of this polynomial, we also deal with the natural translation to LPPs of both notions of reduced and isotopic Latin squares. Our algebraic approach is readily adapted to identify both types of Latin squares. All of the above is constructively illustrated for $q\in\{4,5\}$. We finish our study with the natural translation to LPPs of both notions of complete mappings and orthomorphisms of quasigroups, showing their relationship with transversals and isotopisms of Latin squares.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raúl M. Falcón, Jaime Gutiérrez, Jorge Jiménez Urroz. 2025-10-10. An algebraic approach to Latin squares of prime power order by local permutation polynomials. https://arxiv.org/abs/2510.09086

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO