Related papers: On the $q$-Bentness of Boolean Functions

We explore a number of functional properties of the $q$-gamma function and a class of its quotients; including the $q$-beta function. We obtain formulas for all higher logarithmic derivatives of these quotients and give precise conditions…

We investigate some connectedness properties of the set of points K(f) where the iterates of an entire function f are bounded. In particular, we describe a class of transcendental entire functions for which an analogue of the…

Let $q=2^e$ with $e$ even, and let $\mathbb{F}_{q^2}$ be the finite field of order $q^2$. Put $d=(q^2+q+1)/3$, and consider the permutation polynomial $$\sigma(X)=X+X^d+X^{dq}\in\mathbb{F}_{q^2}[X].$$ For $\alpha\in\mathbb{F}_q^*$, define…

In Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in Anbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial negabent and vectorial bent-negabent concepts are introduced, which leads to seemingly…

For a finite group $G$ and a sufficiently large (but fixed) prime power $q$ coprime to $G$ we obtain asymptotics for the number of regular Galois extensions $L/ \mathbb{F}_q(t)$, with $\mathrm{Gal}(L/\mathbb{F}_q(t)) \cong G$, ramified at a…

Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…

We present a quantum algorithm for approximating the linear structures of a Boolean function $f$. Different from previous algorithms (such as Simon's and Shor's algorithms) which rely on restrictions on the Boolean function, our algorithm…

The error function occurs widely in multiple areas of mathematics, mathematical physics and natural sciences. There has been no work in this area for the past four decades. In this article, we estimate the coefficient bounds with…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

We introduce a new concept, the APN-defect, which can be thought of as measuring the distance of a given function $G:\mathbb{F}_{2^n} \rightarrow \mathbb{F}_{2^n}$ to the set of almost perfect nonlinear (APN) functions. This concept is…

Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise…

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

We ask whether most Boolean functions are determined by their low frequencies. We show a partial result: for almost every function $f: \{-1,1\}^p \to \{-1,1\}$ there exists a function $f': \{-1,1\}^p \to (-1,1)$ that has the same…

We obtain new nonexistence results of generalized bent functions from $\{Z^n}_q$ to $\Z_q$ (called type $[n,q]$) in the case that there exist cyclotomic integers in $ \Z[\zeta_{q}]$ with absolute value $q^{\frac{n}{2}}$. This result…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable…

On a polarized compact symplectic manifold endowed with an action of a compact Lie group, in analogy with geometric invariant theory, one can define the space of invariant functions of degree k. A central statement in symplectic geometry,…

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a…

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…