Search arXivSearch

arXiv · 1301.6999

Planar functions over fields of characteristic two

Abstract

Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we also call planar functions. They again give rise to finite projective planes, as recently shown by the second author. We give a characterisation of planar functions in characteristic two in terms of codes over $\mathbb{Z}_4$. We then specialise to planar monomial functions $f(x)=cx^t$ and present constructions and partial results towards their classification. In particular, we show that $t=1$ is the only odd exponent for which $f(x)=cx^t$ is planar (for some nonzero $c$) over infinitely many fields. The proof techniques involve methods from algebraic geometry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kai-Uwe Schmidt, Yue Zhou. 2014-01-10. Planar functions over fields of characteristic two. https://arxiv.org/abs/1301.6999

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO