English
Related papers

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

200 papers

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

Classical Analysis and ODEs · Mathematics 2007-05-25 Bálint Farkas , Viktor Harangi , Tamás Keleti , Szilárd Gy. Révész

We present a new result on the nonexistence of generalized bent functions (GBFs)from (Z/tZ)^n to Z/tZ (called type [n, t]) for a large class. Assume p is an odd prime number. By showing certain quadratic norm form equations having no…

Information Theory · Computer Science 2026-03-26 Chang Lv , Yuqing Zhu

In this paper, we describe a different approach to the proof of the nonexistence of homogeneous rotation symmetric bent functions. As a result, we obtain some new results which support the conjecture made in this journal, i.e., there are no…

Cryptography and Security · Computer Science 2013-03-12 Xiyong Zhang , Guangpu Gao

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

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

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

Probability · Mathematics 2019-06-11 Vilhelm Agdur

The first part I talk about the motivation for Lu Qi-Keng conjecture and the results about the presence or absence of zeroes of the Bergman kernel function of a bounded domain in ${\bf{C^n}}$. The second part I summarize the main results on…

Complex Variables · Mathematics 2007-05-23 Weiping Yin

Baker's conjecture states that a transcendental entire function of order less than $1/2$ has no unbounded Fatou components. It is known that, for such functions, there are no unbounded periodic Fatou components and so it remains to show…

Complex Variables · Mathematics 2015-02-10 D. A. Nicks , P. J. Rippon , G. M. Stallard

Given the growing quantity of proposals and works of basic hypergeometric functions in the scope of $q$-calculus, it is important to introduce a systematic classification of $q$-calculus. Our aim in this article is to investigate certain…

Classical Analysis and ODEs · Mathematics 2025-02-11 Ayman Shehata

Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high `complexity' according to various measures. In recent work of…

Computational Complexity · Computer Science 2010-01-14 Andrew Drucker

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

Information Theory · Computer Science 2014-05-23 Jacques Wolfmann

This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that the quantum and randomized communication complexity of the…

Computational Complexity · Computer Science 2025-10-14 Ziyi Guan , Yunqi Huang , Penghui Yao , Zekun Ye

We construct a total Boolean function $f$ satisfying $R(f)=\tilde{\Omega}(Q(f)^{5/2})$, refuting the long-standing conjecture that $R(f)=O(Q(f)^2)$ for all total Boolean functions. Assuming a conjecture of Aaronson and Ambainis about…

Computational Complexity · Computer Science 2015-06-29 Shalev Ben-David

We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n there exists an explicit bijection f from the n-dimensional Boolean cube to the Hamming ball of…

Combinatorics · Mathematics 2013-10-09 Itai Benjamini , Gil Cohen , Igor Shinkar

Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…

Cryptography and Security · Computer Science 2010-05-21 Xiyong Zhang , Hua Guo , Yifa Li

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein

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

We introduce a variant of the $K$-theoretic quantized Coulomb branch constructed by Braverman--Finkelberg--Nakajima, by application of a new virtual intersection theory. In the abelian case, we define Verma modules for such virtual Coulomb…

Algebraic Geometry · Mathematics 2023-02-16 Zijun Zhou

In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree functions. Here we provide an alternative proof for general low-degree functions, with no constraints on the influences.…

Probability · Mathematics 2019-01-29 Yuval Filmus , Elchanan Mossel

In this paper we present an addition to Askey's scheme of q-hypergeometric orthogonal polynomials involving classes of q-special functions which do not consist of polynomials only. The special functions are q-analogues of the Jacobi and…

Classical Analysis and ODEs · Mathematics 2007-05-23 Erik Koelink , Jasper V. Stokman
‹ Prev 1 4 5 6 7 8 10 Next ›