Search arXivSearch

arXiv · 2407.03170

On a classification of planar functions in characteristic three

Abstract

Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two relevant equivalence relations for planar functions, that are isotopic equivalence and CCZ-equivalence. Classification of planar functions is performed via CCZ-equivalence which arises from cryptographic applications. In the case of quadratic planar functions, isotopic equivalence, coming from connections to commutative semifields, is more general than CCZ-equivalence and isotopic transformations can be considered as a construction method providing up to two CCZ-inequivalent mappings. In this paper, we first survey known infinite classes and sporadic cases of planar functions up to CCZ-equivalence, aiming to exclude equivalent cases and to identify those with the potential to provide additional functions via isotopic equivalence. In particular, for fields of order $3^n$ with $n\le 11$, we completely resolve if and when isotopic equivalence provides different CCZ-classes for all currently known planar functions. Further, we perform an extensive computational investigation on some of these fields and find seven new sporadic planar functions over $\mathbb{F}_{3^6}$ and two over $\mathbb{F}_{3^9}$. Finally, we give new simple quadrinomial representatives for the Dickson family of planar functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuele Andreoli, Lilya Budaghyan, Robert Coulter, Alise Haukenes, Nikolay Kaleyski, Enrico Piccione. 2024-07-03. On a classification of planar functions in characteristic three. https://arxiv.org/abs/2407.03170

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

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO