English
Related papers

Related papers: On the normality of Boolean quartics

200 papers

I describe recent work with V. Cirigliano and E. Golowich on the effect of dimension eight operators on weak nonleptonic amplitudes. The basic message is that there is an inconsistency in the way that many calculations are traditionally…

High Energy Physics - Phenomenology · Physics 2009-10-31 John F. Donoghue

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

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

Computational Complexity · Computer Science 2016-10-25 Chris Jones

It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…

Information Theory · Computer Science 2017-08-31 T. W. Cusick , E. M. Sanger

This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a…

Computational Complexity · Computer Science 2007-05-23 S. N. Coppersmith

We prove an inversion theorem for the Fourier transform defined for normal functions, in the case when such functions are of moderate decrease, and in dimensions 2 and 3. This improves on Carleson's general almost everywhere convergence…

Mathematical Physics · Physics 2024-04-01 Tristram de Piro

In this article, we provide the first systematic analysis of bent functions $f$ on $\mathbb{F}_2^{n}$ in the Maiorana-McFarland class $\mathcal{MM}$ regarding the origin and cardinality of their $\mathcal{M}$-subspaces, i.e., vector…

Information Theory · Computer Science 2023-04-27 Enes Pasalic , Alexandr Polujan , Sadmir Kudin , Fengrong Zhang

In this article, the authors establish a new characterization of the Musielak--Orlicz--Sobolev space on $\mathbb{R}^n$, which includes the classical Orlicz--Sobolev space, the weighted Sobolev space and the variable exponent Sobolev space…

Classical Analysis and ODEs · Mathematics 2018-10-08 Sibei Yang , Dachun Yang , Wen Yuan

We study the asymptotic behavior of three classes of nonlocal functionals in complete metric spaces equipped with a doubling measure and supporting a Poincar\'e inequality. We show that the limits of these nonlocal functionals are…

Functional Analysis · Mathematics 2023-10-16 Panu Lahti , Andrea Pinamonti , Xiaodan Zhou

The most general version of a renormalizable $d=4$ theory corresponding to a dimensionless higher-derivative scalar field model in curved spacetime is explored. The classical action of the theory contains $12$ independent functions, which…

High Energy Physics - Theory · Physics 2010-04-06 E. Elizalde , A. G. Jacksenaev , S. D. Odintsov , I. L. Shapiro

We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…

Quantum Physics · Physics 2007-05-23 Harry Buhrman , Ilan Newman , Hein Roehrig , Ronald de Wolf

Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…

Discrete Mathematics · Computer Science 2015-04-29 Qijun He , Matthew Macauley

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

Algebraic Geometry · Mathematics 2008-05-02 François Rodier

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

This paper studies the strong quasiconvexity of norm and distance functions in finite-dimensional normed spaces. Although the Euclidean norm is known to be strongly quasiconvex on bounded convex sets, a complete characterization of this…

Optimization and Control · Mathematics 2026-05-26 V. S. T. Long , N. M. Nam

Poincar\'{e}-Sobolev-type inequalities involving rearrangement-invariant norms on the entire $\mathbb{R}^n$ are provided. Namely, inequalities of the type $\|u-P\|_{Y(\mathbb{R}^n)}\leq C\|\nabla^m u\|_{X(\mathbb{R}^n)}$, where $X$ and $Y$…

Functional Analysis · Mathematics 2021-07-07 Zdeněk Mihula

Evolving Boolean functions with specific properties is an interesting optimization problem since, depending on the combination of properties and Boolean function size, the problem can range from very simple to (almost) impossible to solve.…

Neural and Evolutionary Computing · Computer Science 2024-11-20 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

In difference to many recent articles that deal with generalized bent (gbent) functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$ for certain small valued $q\in \{4,8,16 \}$, we give a complete description of these functions for both $n$…

Information Theory · Computer Science 2016-05-19 Samir Hodžić , Wilfried Meidl , Enes Pasalic

Let $Z$ be a Boolean model based on a stationary Poisson process $\eta$ of compact, convex particles in Euclidean space ${\mathbb{R}}^d$. Let $W$ denote a compact, convex observation window. For a large class of functionals $\psi$, formulas…

Probability · Mathematics 2016-02-11 Daniel Hug , Günter Last , Matthias Schulte

In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.

Information Theory · Computer Science 2011-08-24 Jiyou Li