English
Related papers

Related papers: FKN theorem for the multislice, with applications

200 papers

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Number Theory · Mathematics 2024-07-03 Cheuk Fung Lau

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

Complex Variables · Mathematics 2015-01-05 Arthur A. Danielyan

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Classical Analysis and ODEs · Mathematics 2022-01-19 Peter D. Dragnev , Alan R. Legg , Ramon Orive

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Computational Complexity · Computer Science 2015-03-13 Ilias Diakonikolas , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

The capacity of quantum computation exceeds that of classical computers. A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states; therefore,…

Quantum Physics · Physics 2025-07-29 BingZe-Lu , Matthew M. Lin , YuChen-Shu

Quantum systems with constraints are often considered in modern theoretical physcics. All realistic field models based on the idea of gauge symmetry are of this type. A partial case of constraints being linear in coordinate and momenta…

Mathematical Physics · Physics 2007-05-23 O. Yu. Shvedov

Given an alphabet size $m\in\mathbb{N}$ thought of as a constant, and $\vec{k} = (k_1,\ldots,k_m)$ whose entries sum of up $n$, the $\vec{k}$-multi-slice is the set of vectors $x\in [m]^n$ in which each symbol $i\in [m]$ appears precisely…

Computational Complexity · Computer Science 2025-07-28 Mark Braverman , Subhash Khot , Noam Lifshitz , Dor Minzer

The K-theory of a functor may be viewed as a relative version of the K-theory of a ring. In the case of a Galois extension of a number field F/L with rings of integers A/B respectively, this K-theory of the "norm functor" is an extension of…

K-Theory and Homology · Mathematics 2009-09-29 Max Karoubi , Thierry Lambre

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Combinatorics · Mathematics 2018-12-05 David Kazhdan , Tamar Ziegler

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Quantum Physics · Physics 2019-08-20 Mark Bun , Robin Kothari , Justin Thaler

There are many families of functions on partitions, such as the shifted symmetric functions, for which the corresponding q-brackets are quasimodular forms. We extend these families so that the corresponding q-brackets are quasimodular for a…

Number Theory · Mathematics 2022-12-16 Jan-Willem M. van Ittersum

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion.…

Number Theory · Mathematics 2022-05-16 V. Bergelson , J. Kułaga-Przymus , M. Lemańczyk , F. K. Richter

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

Probability · Mathematics 2021-07-01 Alexander Barvinok , Nicholas Barvinok

Let $f$ be a holomorphic function on the unit disc, and $(S_{n_{k}})$ be a subsequence of its Taylor polynomials about $0$. It is shown that the nontangential limit of $f$ and lim$_{k\rightarrow \infty }S_{n_{k}}$ agree at almost all points…

Complex Variables · Mathematics 2014-12-10 Stephen J. Gardiner , Myrto Manolaki

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)…

Discrete Mathematics · Computer Science 2020-05-22 Anastasiya Gorodilova

The classical hypercontractive inequality for the noise operator on the discrete cube plays a crucial role in many of the fundamental results in the Analysis of Boolean functions, such as the KKL (Kahn-Kalai-Linial) theorem, Friedgut's…

Combinatorics · Mathematics 2019-06-14 Peter Keevash , Noam Lifshitz , Eoin Long , Dor Minzer

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

Commutative Algebra · Mathematics 2024-10-02 Claude Carlet , Serge Feukoua , Ana Sălăgean

In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…

Numerical Analysis · Mathematics 2020-04-14 David Levin
‹ Prev 1 4 5 6 7 8 10 Next ›