中文
相关论文

相关论文: Junta threshold for low degree Boolean functions o…

200 篇论文

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…

组合数学 · 数学 2011-11-15 Hamed Hatami

We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…

组合数学 · 数学 2021-12-13 Yuval Filmus

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

组合数学 · 数学 2013-11-14 Piotr Nayar

In this paper we research a model of multilayer circuits with a single logical layer. We consider $\lambda$-separable graphs as a support for circuits. We establish the Shannon function lower bound $\max \bigl(\frac{2^n}{n}, \frac{2^n (1 -…

计算复杂性 · 计算机科学 2021-03-16 T. R. Sitdikov , G. V. Kalachev

We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.

数论 · 数学 2021-06-15 Paul Voutier

We show that the Hausdorff dimension of any slice of the graph of the Takagi function is bounded above by the Assouad dimension of the graph minus one, and that the bound is sharp. The result is deduced from a statement on more general…

经典分析与常微分方程 · 数学 2024-11-20 Roope Anttila , Balázs Bárány , Antti Käenmäki

We give an algorithm for learning symmetric k-juntas (boolean functions of $n$ boolean variables which depend only on an unknown set of $k$ of these variables) in the PAC model under the uniform distribution, which runs in time n^{O(k/\log…

组合数学 · 数学 2007-05-23 Mihail N. Kolountzakis , Evangelos Markakis , Aranyak Mehta

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

数据结构与算法 · 计算机科学 2026-02-11 Nick Fischer , Melvin Kallmayer , Leo Wennmann

We prove the curse of dimensionality in the worst case setting for numerical integration for a number of classes of smooth $d$-variate functions. Roughly speaking, we consider different bounds for the derivatives of $f \in C^k(D_d)$ and ask…

数值分析 · 数学 2014-04-23 Aicke Hinrichs , Erich Novak , Mario Ullrich , Henryk Wozniakowski

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…

计算复杂性 · 计算机科学 2023-05-23 Mark Bun , Nadezhda Voronova

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

计算复杂性 · 计算机科学 2017-03-20 Mark Bun , Justin Thaler

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

计算复杂性 · 计算机科学 2020-05-04 Xiaoming Sun , Yuan Sun , Jiaheng Wang , Kewen Wu , Zhiyu Xia , Yufan Zheng

Brjuno and R\"ussmann proved that every irrationally indifferent fixed point of an analytic function with a Brjuno rotation number is linearizable, and Yoccoz proved that this is sharp for quadratic polynomials. Douady conjectured that this…

动力系统 · 数学 2019-11-04 Lukas Geyer

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

代数几何 · 数学 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

We establish sharp lower bounds for the $2k$-th moment in the range $k \geq 1/2$ of the family of quadratic twists of modular $L$-functions at the central point.

数论 · 数学 2024-12-19 Peng Gao , Liangyi Zhao

In this article, we ask whether the Igusa zeta function of a restricted power series over $\mathbb{Q}_p$ can be determined solely from the terms of degree at most $D$. That is, we ask whether the truncated polynomial $f_D$, consisting of…

数论 · 数学 2025-04-25 Leonie Dausy

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

信息论 · 计算机科学 2019-07-09 Mohsen Heidari , S. Sandeep Pradhan , Ramji Venkataramanan

We study the double slice genus of a knot, a natural generalization of slice genus. We define a notion called band number, a natural generalization of band unknotting number, and prove it is an upper bound on double slice genus. Our bound…

几何拓扑 · 数学 2019-01-24 Clayton McDonald

Let $(S,\mathcal L)$ be a smooth, irreducible, projective, complex surface, polarized by a very ample line bundle $\mathcal L$ of degree $d > 35$. In this paper we prove that $K^2_S\geq -d(d-6)$. The bound is sharp, and $K^2_S=-d(d-6)$ if…

代数几何 · 数学 2016-01-26 Vincenzo Di Gennaro , Davide Franco

We investigate the max min of the algebraic degree and the nonlinearity of a Boolean function in $n$ variables when restricted to a $k$-dimensional affine subspace of $\mathbb{F}_2^n$. Previous authors have focused on the cases when the max…

组合数学 · 数学 2025-03-03 Jan Kristian Haugland