Search arXivSearch

arXiv · 2603.28485

On Generalizations of Maiorana-McFarland and $\mathcal{PS}_{ap}$ Functions

Abstract

We study generalizations of two classical primary constructions of Boolean bent functions, namely the Maiorana-McFarland ($MM$) class and the (Desarguesian) partial spread ($\mathcal{PS}_{ap}$) class. The construction of bent functions lying outside the completed $MM$ class has attracted considerable attention in recent years. In this direction, we construct families of generalized Maiorana--McFarland bent functions that are not equivalent to any function in the classical $MM$ or $\mathcal{PS}_{ap}$ classes, and hence lie outside their completed classes. As a second contribution, we investigate the decomposition of generalized $\mathcal{PS}_{ap}$ functions. We prove that when the degree is sufficiently small relative to the size of the underlying finite field, such functions do not, in general, admit a decomposition into bent or semibent functions. Consequently, they cannot be obtained from known secondary constructions based on concatenation. Finally, we present a secondary construction of Boolean bent functions arising from the concatenation of components of vectorial generalized $\mathcal{PS}_{ap}$ functions. Our constructions and proofs rely on classical results concerning second-order derivatives of bent functions and their duals. In addition, we employ methods from the theory of algebraic curves and their function fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sezel Alkan, Nurdagül Anbar, Athina Avrantini, Erroxe Etxabarri-Alberdi, Tekgül Kalaycı, Beatrice Toesca. 2026-03-30. On Generalizations of Maiorana-McFarland and $\mathcal{PS}_{ap}$ Functions. https://arxiv.org/abs/2603.28485

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