English
Related papers

Related papers: On the normality of Boolean quartics

200 papers

Let $M$ be an $n$-dimensional complex manifold. A holomorphic function $f:M\to \mathbb C$ is said to be semi-Bloch if for every $\lambda\in \mathbb C$ the function $g_\lambda=\exp(\lambda f(z))$ is normal on $M$. We characterise Semi-Bloch…

Complex Variables · Mathematics 2013-12-23 Ulf Backlund , Linus Carlsson , Anders Fällström , Håkan Persson

In the present work we provide the bounds for Daubechies orthonormal wavelet coefficients for function spaces $\mathcal{A}_k^p:=\{f: \|(i \omega)^k\hat{f}(\omega)\|_p< \infty\}$, $k\in\mathbf{N}\cup\{0\}$, $p\in(1,\infty)$.

Functional Analysis · Mathematics 2020-04-17 Susanna Spektor

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu

The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…

Combinatorics · Mathematics 2016-02-01 S. Hodžić , E. Pasalic

We study the Besov regularity of wavelet series on $\mathbb{R}^d$ with randomly chosen coefficients. More precisely, each coefficient is a product of a random factor and a parameterized deterministic factor (decaying with the scale $j$ and…

Probability · Mathematics 2024-11-28 Andreas Horst , Thomas Jahn , Felix Voigtlaender

We expose a potential flaw in standard treatments of weak decay amplitudes, including that of epsilon'/epsilon. We show that (contrary to conventional wisdom) dimension-eight operators do contribute to weak amplitudes, at order G_F alpha_s…

High Energy Physics - Phenomenology · Physics 2014-11-17 Vincenzo Cirigliano , John F. Donoghue , Eugene Golowich

We study the beta functions for the dimensionless couplings in quadratic curvature gravity, and find that there is a simple argument to restrict the possible form of the beta functions as derived from the counterterms at an arbitrary loop.…

High Energy Physics - Theory · Physics 2024-07-12 Hikaru Kawai , Nobuyoshi Ohta

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

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

Data Structures and Algorithms · Computer Science 2012-08-21 Igor S. Sergeev

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

Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…

Information Theory · Computer Science 2018-11-20 Cunsheng Ding , Sihem Mesnager , Chunming Tang , Maosheng Xiong

We consider general renormalizable scalar field theory and derive six-loop beta functions for all parameters in d = 4 dimensions within the $\overline{MS}$-scheme. We do not explicitly compute relevant loop integrals but utilize…

High Energy Physics - Phenomenology · Physics 2021-04-28 Alexander Bednyakov , Andrey Pikelner

Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…

Computational Complexity · Computer Science 2014-10-31 Eric Blais , Clément L. Canonne , Igor C. Oliveira , Rocco A. Servedio , Li-Yang Tan

We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…

Rings and Algebras · Mathematics 2024-07-01 Miguel Couceiro , Erkko Lehtonen

The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…

Discrete Mathematics · Computer Science 2021-05-24 Ryan O'Donnell

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…

Information Theory · Computer Science 2019-05-31 Lilya Budaghyan , Nikolay S. Kaleyski , Soonhak Kwon , Constanza Riera , Pantelimon Stanica

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

In this paper we construct a cyclically invariant Boolean function whose sensitivity is $\Theta(n^{1/3})$. This result answers two previously published questions. Tur\'an (1984) asked if any Boolean function, invariant under some transitive…

Computational Complexity · Computer Science 2007-05-23 Sourav Chakraborty

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

Computational Complexity · Computer Science 2022-12-02 Edinah K. Gnang , Rongyu Xu