Search arXivSearch

arXiv · 1308.3355

$\mathcal{P}\mathcal{S}$ bent functions constructed from finite pre-quasifield spreads

Abstract

Bent functions are of great importance in both mathematics and information science. The $\mathcal{P}\mathcal{S}$ class of bent functions was introduced by Dillon in 1974, but functions belonging to this class that can be explicitly represented are only the $\mathcal{P}\mathcal{S}_{\text{ap}}$ functions, which were also constructed by Dillon after his introduction of the $\mathcal{P}\mathcal{S}$ class. In this paper, a technique of using finite pre-quasifield spread from finite geometry to construct $\mathcal{P}\mathcal{S}$ bent functions is proposed. The constructed functions are in similar styles with the $\mathcal{P}\mathcal{S}_{\text{ap}}$ functions. To explicitly represent them in bivariate forms, the main task is to compute compositional inverses of certain parametric permutation polynomials over finite fields of characteristic 2. Concentrated on the Dempwolff-Müller pre-quasifield, the Knuth pre-semifield and the Kantor pre-semifield, three new subclasses of the $\mathcal{P}\mathcal{S}$ class are obtained. They are the only sub-classes that can be explicitly constructed more than 30 years after the $\mathcal{P}\mathcal{S}_{\text{ap}}$ subclass was introduced.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Baofeng Wu. 2013-08-15. $\mathcal{P}\mathcal{S}$ bent functions constructed from finite pre-quasifield spreads. https://arxiv.org/abs/1308.3355

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO