English
Related papers

Related papers: On the normality of Boolean quartics

200 papers

Weak-type quasi-norms are defined using the mean oscillation or the mean of a function on dyadic cubes, providing discrete analogues and variants of the corresponding quasi-norms on the upper half-space previously considered in the…

Functional Analysis · Mathematics 2025-06-27 Galia Dafni , Shahaboddin Shaabani

This paper consists of two independent, but related parts. In the first part we show how to use symbolic computation to derive explicit expressions for the first few moments of the number of implicants that a random Boolean function has, or…

Combinatorics · Mathematics 2023-02-20 Svante Janson , Blair Seidler , Doron Zeilberger

In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel.…

Cryptography and Security · Computer Science 2008-08-06 Selcuk Kavut , Melek Diker Yucel

In this paper we introduce generalized hyperbent functions from $F_{2^n}$ to $Z_{2^k}$, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions from $F_{2^n}$ to $Z_{2^k}$ consist…

Information Theory · Computer Science 2016-04-12 Thor Martinsen , Wilfried Meidl , Sihem Mesnager , Pantelimon Stanica

Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…

Information Theory · Computer Science 2024-07-03 Peng Han , Keli Pu

The canalizing properties of biological functions have been mainly studied in the context of Boolean modelling of gene regulatory networks. An important mathematical consequence of canalization is a low average sensitivity, which ensures in…

Combinatorics · Mathematics 2023-07-04 Élisabeth Remy , Paul Ruet

We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…

Discrete Mathematics · Computer Science 2019-10-31 Nike Dattani , Hou Tin Chau

Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being…

Dynamical Systems · Mathematics 2024-07-09 Yuan Li , John O. Adeyeye , David Murrugarra , Boris Aguilar , Reinhard Laubenbacher

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

Discrete Mathematics · Computer Science 2024-11-26 Ziran Tu , Sihem Mesnager , Xiangyong Zeng , Nian Li , Yupeng Jiang , Yanan Deng

The only known example of an almost perfect nonlinear (APN) permutation in even dimension was obtained by applying CCZ-equivalence to a specific quadratic APN function. Motivated by this result, there have been numerous recent attempts to…

The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to that of affine functions. In this note we…

Cryptography and Security · Computer Science 2019-06-04 Igor Semaev

Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functions that are simultaneously bent and negabent…

Neural and Evolutionary Computing · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Ermes Franch , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

This paper studies the singularities of Cullen-regular functions of one quaternionic variable. The quaternionic Laurent series prove to be Cullen-regular. The singularities of Cullen-regular functions are thus classified as removable,…

Complex Variables · Mathematics 2010-04-14 Caterina Stoppato

A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to…

Computational Complexity · Computer Science 2017-01-11 Guangmo Tong , Weili Wu , Ding-Zhu Du

The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures.…

Computational Complexity · Computer Science 2016-12-08 Karthik C. S. , Sébastien Tavenas

We define the weak-normalization and the seminormalization of a real algebraic variety relative to its central locus. The study is related to the properties of the rings of continuous rational functions and hereditarily rational functions…

Algebraic Geometry · Mathematics 2019-09-06 Goulwen Fichou , Jean-Philippe Monnier , Ronan Quarez

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

Many researchers have studied symmetry properties of various Boolean functions. A class of Boolean functions, called nested canalyzing functions (NCFs), has been used to model certain biological phenomena. We identify some interesting…

Discrete Mathematics · Computer Science 2023-06-22 Daniel J. Rosenkrantz , Madhav V. Marathe , S. S. Ravi , Richard E. Stearns

In this paper we prove that generalized bent (gbent) functions defined on $\mathbb{Z}_2^n$ with values in $\mathbb{Z}_{2^k}$ are regular, and find connections between the (generalized) Walsh spectrum of these functions and their components.…

Information Theory · Computer Science 2015-11-05 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Data Structures and Algorithms · Computer Science 2014-02-11 Ferdinando Cicalese , Travis Gagie , Eduardo Laber , Martin Milanic