English
Related papers

Related papers: On $q$-nearly bent Boolean functions

200 papers

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…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…

Information Theory · Computer Science 2018-09-21 S. Hodžić , E. Pasalic , Y. Wei

In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…

Combinatorics · Mathematics 2026-03-12 Zeying Wang

We study a new method of constructing Boolean bent functions from cyclotomic mappings. Three generic constructions are obtained by considering different branch functions such as Dillon functions, Niho functions and Kasami functions over…

Number Theory · Mathematics 2023-10-03 Xi Xie , Nian Li , Qiang Wang , Xiangyong Zeng

Extending the method proposed in [arXiv:1109.5524], we derive QQ-relations (functional relations among Baxter Q-functions) and T-functions (eigenvalues of transfer matrices) for fusion vertex models associated with the twisted quantum…

Mathematical Physics · Physics 2024-07-15 Zengo Tsuboi

The near-unanimity-closed minions of Boolean functions, i.e., the clonoids whose target algebra contains a near-unanimity function, are completely described. The key concept towards this result is the minorant-minor partial order and its…

Rings and Algebras · Mathematics 2024-12-02 Erkko Lehtonen

This note mainly concerns the binomial power function, defined as $(1+x^q)^{r}$. We construct systems of polynomials related to non-local approximation, which allows us to establish the density results on $C[a,b]$, where $a,b\in\mathbb{R}$.…

Classical Analysis and ODEs · Mathematics 2021-08-18 Brock Erwin , Jeff Ledford , Kira Pierce

We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain…

Combinatorics · Mathematics 2023-10-04 Aniruddha Biswas , Palash Sarkar

Generalized bent (gbent) functions is a class of functions $f: \mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is a positive integer, that generalizes a concept of classical bent functions through their co-domain extension. A lot…

Information Theory · Computer Science 2016-11-22 S. Hodžić , E. Pasalic

We propose and investigate a new estimation method for the parameters of models consisting of smooth density functions on the positive half axis. The procedure is based on a recently introduced characterization result for the respective…

Statistics Theory · Mathematics 2021-06-16 Steffen Betsch , Bruno Ebner , Bernhard Klar

We establish a set of relations between several quite diverse types of weighted inequalities involving various integral operators and fairly general quasinorm-like functionals which we call sub-monotone. The main result enables one to solve…

Classical Analysis and ODEs · Mathematics 2025-03-13 Amiran Gogatishvili , Luboš Pick

Whenever the defining sequence of a Carleman ultraholomorphic class (in the sense of H. Komatsu) is strongly regular and associated with a proximate order, flat functions are constructed in the class on sectors of optimal opening. As…

Complex Variables · Mathematics 2014-02-12 Javier Sanz

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

First, we construct a class of functions with good local avalanche characteristics, but bad global avalanche characteristics. We also derive some bounds for the nonlinearity of such functions. It improves upon the results of Son et al., and…

Combinatorics · Mathematics 2007-05-23 Pantelimon Stanica

This article serves as an introduction to several recent developments in the study of quasisymmetric functions. The focus of this survey is on connections between quasisymmetric functions and the combinatorial Hopf algebra of noncommutative…

Combinatorics · Mathematics 2018-10-17 Sarah K. Mason

A basilar property and a useful tool in the theory of Sobolev spaces is the density of smooth compactly supported functions in the space $W^{k,p}(\R^n)$ (i.e. the functions with weak derivatives of orders $0$ to $k$ in $L^p$). On Riemannian…

Analysis of PDEs · Mathematics 2023-02-15 Giona Veronelli

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

Information Theory · Computer Science 2009-11-18 WeiGuo Zhang , GuoZhen Xiao

In 1982, Cameron and Liebler investigated certain "special sets of lines" in PG(3,q), and gave several equivalent characterizations. Due to their interesting geometric and algebraic properties, these "Cameron-Liebler line classes" got much…

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

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…

Data Structures and Algorithms · Computer Science 2015-01-21 Hong-Wei Li , Li Yang