Related papers: MUBs from bent functions
Zhou 2013 introduced modified planar functions to describe $(2^n,2^n,2^n,1)$ relative difference sets $R$ as a graph of a function on the finite field $\F_{2^n}$, and pointed out that projections of $R$ are difference sets that can be…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
The concatenation of four Boolean bent functions $f=f_1||f_2||f_3||f_4$ is bent if and only if the dual bent condition $f_1^* + f_2^* + f_3^* + f_4^* =1$ is satisfied. However, to specify four bent functions satisfying this duality…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones
Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…
Mutually unbiased bases (MUBs), which are such that the inner product between two vectors in different orthogonal bases is a constant equal to 1/sqrt{d), with d the dimension of the finite Hilbert space, are becoming more and more studied…
A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
Analogous to the notion of mutually unbiased bases for Hilbert spaces, we consider mutually unbiased unitary bases (MUUB) for the space of operators, $M(d, \mathbb{C})$, acting on such Hilbert spaces. The notion of MUUB reflects the…
It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…
Starting from special near-bent functions in dimension 2t-1 we construct bent functions in dimension 2t having a specific derivative. We deduce new famillies of bent functions
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…
Systematic expansion schemes in functional approaches require the inclusion of higher order vertices. These vertices are expanded in independent tensor bases with a rapidly increasing number of basis elements. Amongst the related tasks are…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study…
Modular meta-learning is a new framework that generalizes to unseen datasets by combining a small set of neural modules in different ways. In this work we propose abstract graph networks: using graphs as abstractions of a system's subparts…
The aim of this paper is twofold. Firstly, we give easy-to-handle criteria to determine whether a given family of subsets of a vector space is a neighbourhood basis of the origin for a complete vector topology. Then, we apply these criteria…