English
Related papers

Related papers: Rotation Symmetric Bent Boolean Functions for n = …

200 papers

In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…

Combinatorics · Mathematics 2022-07-13 José Andrés Armario , Ronan Egan , Dane Flannery

We consider two natural gradings on the space of symmetric functions: by degree and by length. We introduce a differential operator $T$ that leaves the components of this double grading invariant and exhibit a basis of bihomogeneous…

Combinatorics · Mathematics 2021-07-01 Yuly Billig

We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…

Combinatorics · Mathematics 2025-11-25 Robert S. Coulter , Steven Senger

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

All beta-type functions, which are p-homogeneous, are determined. Applying this result, we show that a beta-type function is a homogeneous mean iff it is the harmonic one. A reformulation of a result due to Heuvers in terms of a Cauchy…

Classical Analysis and ODEs · Mathematics 2016-03-08 Martin Himmel , Janusz Matkowski

A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…

Classical Analysis and ODEs · Mathematics 2023-02-02 Shaul Zemel

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Combinatorics · Mathematics 2007-05-23 Constanza Riera , Lars Eirik Danielsen , Matthew G. Parker

Bent functions from a vector space $V_n$ over $\mathbb F_2$ of even dimension $n=2m$ into the cyclic group $\mathbb Z_{2^k}$, or equivalently, relative difference sets in $V_n\times\mathbb Z_{2^k}$ with forbidden subgroup $\mathbb Z_{2^k}$,…

Number Theory · Mathematics 2020-09-24 Wilfried Meidl , Isabel Pirsic

In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

Information Theory · Computer Science 2014-04-14 L. Yu , H. Liu , D. Zheng

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…

Combinatorics · Mathematics 2022-08-22 Tron Omland , Pantelimon Stanica

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…

Combinatorics · Mathematics 2018-04-17 Francis N. Castro , Robin Chapman , Luis A. Medina , L. Brehsner Sepúlveda

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

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions

Combinatorics · Mathematics 2014-08-29 Vladimir Blinovsky

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary…

Rings and Algebras · Mathematics 2021-02-04 Erkko Lehtonen

On a complete $p$-nonparabolic $3$-dimensional manifold with non-negative scalar curvature and vanishing second homology, we establish a sharp monotonicity formula for the proper $p$-Green function along its level sets for $1<p<3$. This can…

Analysis of PDEs · Mathematics 2022-03-01 Pak-Yeung Chan , Jianchun Chu , Man-Chun Lee , Tin-Yau Tsang

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Computational Complexity · Computer Science 2021-02-24 Guoliang Xu , Daowen Qiu