中文
相关论文

相关论文: A Low-Depth Monotone Function that is not an Appro…

200 篇论文

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…

环与代数 · 数学 2024-12-02 Erkko Lehtonen

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

组合数学 · 数学 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…

量子物理 · 物理学 2016-11-15 Avraham Ben-Aroya , Oded Regev , Ronald de Wolf

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

计算复杂性 · 计算机科学 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…

组合数学 · 数学 2018-06-06 Nathan Keller , Noam Lifshitz

Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of…

计算复杂性 · 计算机科学 2022-09-19 Rahul Chugh , Supartha Podder , Swagato Sanyal

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…

密码学与安全 · 计算机科学 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…

组合数学 · 数学 2018-11-20 John Chiarelli , Pooya Hatami , Michael Saks

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

计算复杂性 · 计算机科学 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

In this paper, we derive a new monotonicity formula for the plurisuhbarmonic functions on complete K\"ahler manifolds with nonnegative bisectional curvature. As applications we derive the sharp estimates for the dimension of the spaces of…

微分几何 · 数学 2007-05-23 Lei Ni

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

计算复杂性 · 计算机科学 2016-03-09 Troy Lee , Anupam Prakash , Ronald de Wolf , Henry Yuen

We show that for the problem of minimizing (or maximizing) the ratio of two supermodular functions, no bounded approximation ratio can be achieved via polynomial number of queries, if the two supermodular functions are both monotone…

机器学习 · 计算机科学 2020-12-18 Wenxin Li

An almost periodic function in finite-dimensional space extends to a holomorphic bounded function in a tube domain with a cone in the base if and only if the spectrum belongs to the conjugate cone. Also, an almost periodic function in…

复变函数 · 数学 2007-05-23 S. Favorov , O. Udodova

In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…

经典分析与常微分方程 · 数学 2026-05-07 Heinz H. Bauschke , Honglin Luo , Xianfu Wang

We extend three related results from the analysis of influences of Boolean functions to the quantum setting, namely the KKL Theorem, Friedgut's Junta Theorem and Talagrand's variance inequality for geometric influences. Our results are…

泛函分析 · 数学 2024-04-05 Cambyse Rouzé , Melchior Wirth , Haonan Zhang

We consider the problem of exact identification for read-once functions over arbitrary Boolean bases. We introduce a new type of queries (subcube identity ones), discuss its connection to previously known ones, and study the complexity of…

计算复杂性 · 计算机科学 2010-07-08 Dmitry V. Chistikov , Andrey A. Voronenko

The LULU operators, well known in the nonlinear multiresolution analysis of sequences, are extended to functions defined on continuous domain, namely, a real interval $\Omega\subseteq\mathbb{R}$. Similar to their discrete counterparts, for…

经典分析与常微分方程 · 数学 2007-05-23 Roumen Anguelov

We describe a Lorentzian manifold that is globally hyperbolic and geodesically complete, but such that the (minimally coupled) Klein-Gordon operator with the standard domain is not essentially self-adjoint.

数学物理 · 物理学 2021-09-07 Wojciech Kamiński

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.…

数论 · 数学 2007-05-23 Eric Férard , François Rodier

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…

组合数学 · 数学 2007-05-23 Alex Samorodnitsky