English
Related papers

Related papers: On the weight and density bounds of polynomial thr…

200 papers

It is well-known that every quantified boolean formula (QBF) can be transformed into a prenex QBF whose only boolean operators are negation, conjunction, and disjunction. It is also well-known that the transformation is polynomial if the…

Computational Complexity · Computer Science 2025-06-17 Abdallah Saffidine , Andreas Herzig

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

Cryptography and Security · Computer Science 2024-06-17 Augustine Musukwa , Massimiliano Sala , Marco Zaninelli

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…

Discrete Mathematics · Computer Science 2022-03-03 Gal Beniamini

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

We investigate multivariate integration for a space of infinitely times differentiable functions $\mathcal{F}_{s, \boldsymbol{u}} := \{f \in C^\infty [0,1]^s \mid \| f \|_{\mathcal{F}_{s, \boldsymbol{u}}} < \infty \}$, where $\| f…

Numerical Analysis · Mathematics 2025-12-02 Kosuke Suzuki

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…

Computational Complexity · Computer Science 2018-02-23 Magnus Gausdal Find , Joan Boyar

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

Classical Analysis and ODEs · Mathematics 2014-11-14 Oleksandr Maizlish , Andriy Prymak

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

Discrete Mathematics · Computer Science 2025-07-29 Tor Helleseth , Alexander Kholosha , Niki Spithaki

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

Complex Variables · Mathematics 2019-07-02 Jorge Mozo Fernández

Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…

Discrete Mathematics · Computer Science 2025-05-01 Valérie Gillot , Philippe Langevin , Alexandr Polujan

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

We show that the probability that a multilinear polynomial $f$ of independent random variables exceeds its mean by $\lambda$ is at most $e^{-\lambda^2 / (R^q Var(f))}$ for sufficiently small $\lambda$, where $R$ is an absolute constant.…

Probability · Mathematics 2012-06-11 Warren Schudy , Maxim Sviridenko

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…

Information Theory · Computer Science 2025-06-25 Qiancheng Zhang , Kangquan Li , Longjiang Qu

This paper describes a purely functional library for computing level-$p$-complexity of Boolean functions, and applies it to two-level iterated majority. Boolean functions are simply functions from $n$ bits to one bit, and they can describe…

Programming Languages · Computer Science 2023-12-13 Julia Jansson , Patrik Jansson

We improve bounds on the degree and sparsity of Boolean functions representing the Legendre symbol as well as on the $N$th linear complexity of the Legendre sequence. We also prove similar results for both the Liouville function for…

Number Theory · Mathematics 2024-11-11 Johannes Grünberger , Arne Winterhof

Let $ E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}$, $E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},$ and…

Combinatorics · Mathematics 2018-11-27 Anwar Irmatov

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Classical Analysis and ODEs · Mathematics 2018-09-21 Tamás Erdélyi

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

This paper studies the properties of the probability density function $p_{\alpha,\nu, n}(\mathbf{x})$ of the $n$-variate generalized Linnik distribution whose characteristic function $\varphi_{\alpha,\nu,n}(\boldsymbol{t})$ is given by…

Probability · Mathematics 2010-11-05 S. C. Lim , L. P. Teo