Deep Particular Partitions in Finite Vector Spaces
- Deep particular partitions are structured partitions of finite vector spaces that produce bent functions with constant Walsh transform magnitude.
- They enable rigorous analysis of bent and vectorial bent functions by linking partition properties with Hadamard matrix criteria and balanced projections.
- Key constructions include vectorial dual-bent and twisted Maiorana-McFarland forms, motivating ongoing research into non-WBP bent partitions.
A deep particular partition, commonly termed a "bent partition," is a structured partition of the finite vector space (where is an even positive integer and is a prime) that underpins the construction of bent functions, vectorial bent functions, partial difference sets, and association schemes. Specifically, a partition of is called bent if every -ary function whose preimages match exactly blocks of is a bent function, characterized by Walsh transform values of constant magnitude for all 0 (Wang et al., 21 Sep 2025). Bent partitions systematically generalize classical bent and vectorial bent functions by allowing rigorous combinatorial and algebraic characterizations, including Hadamard matrix criteria in the binary case.
1. Definition and Fundamental Properties
Let 1 denote an 2-dimensional vector space over 3 with 4 even. A bent partition 5 of 6 consists of disjoint subsets 7 covering the space; the depth 8 refers to the cardinality of the partition. The requisite property is that any 9-coloring of 0 assigning each color exactly 1 times yields a bent 2-ary function 3; thus, partition properties and bentness of all induced functions are tightly coupled.
Equivalently, for an index map 4 (with 5 and 6 iff 7), 8 is bent if and only if 9 is vectorial bent and all balanced projections (i.e., any permutation or balanced linear combination of its components) remain bent [(Wang et al., 21 Sep 2025), Theorem 1].
The seminal open problem, originally formulated by Anbar–Meidl (2022), asks whether every bent partition's depth 0 must always be a power of 1. To date, all known constructions satisfy 2 for some integer 3.
2. Regularity, Weak Regularity, and the Depth Problem
A 4-ary bent function 5 is called weakly regular if its Walsh transform has the form 6 for each 7, with 8 and 9 the dual. If 0, 1 is regular; otherwise, it is only weakly regular. A bent partition is said to be in class "WBP" (Editor's term: Weakly/Regular Bent Partition) if all bent functions generated by it are either all regular or all weakly regular, but not a mixture (Wang et al., 21 Sep 2025).
The depth–power–of–2 theorem asserts that for any WBP-class partition 3 of 4, the depth 5 must be a power of 6 [(Wang et al., 21 Sep 2025), Theorem 3]. This result conclusively determines the depth for a large class of bent partitions, and in particular ensures that every Boolean (7) bent partition has depth a power of 8.
3. Structure Theorems and Proof Outline
The proof of the depth–power–of–9 result for WBP-class partitions relies on algebraic characterizations of weakly regular bent functions and the analysis of their duals. The dual 0 of a 1-ary bent function is constrained by the "c-form" functional identity:
2
This identity yields strong structural constraints on the algebraic form of 3 and character sums 4, where 5 are the blocks of the partition determined by 6 [(Wang et al., 21 Sep 2025), Theorem 2].
Specifically, for each 7,
8
where 9 and 0 are certain maps determined by 1 and its dual. Analyzing the range and integrality of these sums constrains 2 to divide 3, which, when true for all block unions, mandates 4 be a power of 5.
4. Constructions: Dual-Bent, Non-Dual-Bent, and Secondary Operations
Two principal construction paradigms for bent partitions are established: those arising from vectorial dual-bent functions and those not directly corresponding to dual-bent maps.
Vectorial Dual-Bent-Based Partitions
Suppose 6 is vectorial bent, with all scalar components 7 weakly regular and of the same duality sign 8. If one can find maps 9 and 0 such that for 1
2
then the preimage partition 3 is bent of class WBP [(Wang et al., 21 Sep 2025), Theorem 4].
This property is fully expressible in terms of generalized Hadamard matrices 4: all such matrices must be of weakly-regular type and the mixed products 5 must be equal for all 6.
Non-Dual-Bent Constructions and Twisted Maiorana-McFarland Forms
For certain vectorial bent 7, if all 8 are regular (or all weakly regular) and, for 9, the functions 0 are all equal to a nonzero 1, then the blocks 2(i) form a bent partition not arising from any dual-bent 3 [(Wang et al., 21 Sep 2025), Corollary 1].
Infinite families can be constructed using "twisted Maiorana-McFarland" forms:
4
with compatible homogeneity and further conditions, yielding partitions beyond the dual-bent scope [(Wang et al., 21 Sep 2025), Proposition 3]. Additional secondary constructions combine smaller building blocks 5 or pairs 6 to form larger vectorial bent functions 7 fulfilling the sufficient condition above.
Table: Construction Types and Core Properties
| Construction Type | Conditions | Key Property |
|---|---|---|
| Vectorial dual-bent (⋆ holds, 8) | 9 dual-bent, balanced 0 | WBP, 1, Hadamard structure |
| Non-dual-bent, "twisted" | 2 in (⋆), twisted forms | WBP (not dual-bent), 3 |
| Secondary constructions | Gluing 4, 5; balanced bilinear 6 | Combinatorial families, flexible depth |
5. New Families of Vectorial Dual-Bent Functions
Whenever 7 in the duality condition, 8 is a vectorial dual-bent function. New families can be synthesized by combining two dual-bent functions 9 and 00 using a balanced bilinear form 01 on their ranges:
02
By carefully ensuring that the 03 constants associated to 04 and 05 have opposite sign, their contributions to the dual vanish, guaranteeing the dual-bent structure of 06 [(Wang et al., 21 Sep 2025), Theorem 6]. This operation recovers known Boolean vectorial bent forms and yields new exemplars through targeted substitutions for the building blocks.
6. Binary Case and Hadamard Matrix Characterization
For 07, the bent partition criterion becomes purely combinatorial. Let 08. Then 09 is bent if and only if the 10 matrices
11
are real Hadamard matrices and the triple products 12 are identical for all 13 [(Wang et al., 21 Sep 2025), Theorem 5]. This implies 14 must be a power of 15, aligning with the existence constraint for Hadamard matrices.
7. Open Problems and Future Directions
The depth–power–of–16 theorem settles the possible values of 17 for WBP-class partitions, but the existence and classification of bent partitions outside WBP—those generating a mix of (non-)regular or non-weakly-regular bent functions—remains open. The sufficiency (and possible necessity) of the duality condition 18 and the Hadamard-matrix criteria provide a practical and conceptual framework for constructing further examples [(Wang et al., 21 Sep 2025), Remark 2].
Secondary construction techniques, such as gluing smaller vectorial bent functions or using complete permutations, suggest broad avenues for systematically generating new families and a potential classification up to isomorphism. The identification and analysis of non-WBP bent partitions represent an active line of research.