English
Related papers

Related papers: FKN theorem for the multislice, with applications

200 papers

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

Combinatorics · Mathematics 2025-10-30 Christof Beierle , Tim Beyne

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…

Cryptography and Security · Computer Science 2017-11-09 Zhixiong Chen , Ting Gu , Andrew Klapper

We present a comprehensive investigation of quantum oscillations (QOs) in the strongly-correlated Falicov-Kimball model (FKM). The FKM is a particularly suitable platform for probing the non-Fermi liquid state devoid of quasiparticles,…

Strongly Correlated Electrons · Physics 2023-09-06 Wei-Wei Yang , Hong-Gang Luo , Yin Zhong

The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures.…

Computational Complexity · Computer Science 2016-12-08 Karthik C. S. , Sébastien Tavenas

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…

Combinatorics · Mathematics 2019-02-05 Raphael Yuster

Let $f$ be a holomorphic, or even meromorphic, function on the unit disc. Plessner's theorem then says that, for almost every boundary point $\zeta $, either (i) $f$ has a finite nontangential limit at $\zeta $, or (ii) the image $f(S)$ of…

Complex Variables · Mathematics 2020-11-12 Stephen J. Gardiner , Myrto Manolaki

We consider the monomer-dimer partition function on arbitrary finite planar graphs and arbitrary monomer and dimer weights, with the restriction that the only non-zero monomer weights are those on the boundary. We prove a Pfaffian formula…

Mathematical Physics · Physics 2016-08-24 Alessandro Giuliani , Ian Jauslin , Elliott H. Lieb

A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…

Classical Analysis and ODEs · Mathematics 2019-02-20 Jonathan Hickman

We prove the following stability version of the edge isoperimetric inequality for the cube: any subset of the cube with average boundary degree within $K$ of the minimum possible is $\varepsilon $-close to a union of $L$ disjoint cubes,…

Combinatorics · Mathematics 2017-03-30 Peter Keevash , Eoin Long

In their 2015 paper, Mertens and Rolen prove that for a certain level 6 "almost holomorphic" modular function $P$, the degree of $P(\tau)$ over $\mathbb{Q}$ for quadratic $\tau$ is as large as expected, settling a conjecture of Bruinier and…

Number Theory · Mathematics 2017-10-25 Haden Spence

We establish the following result: if the graph of a (nonsmooth) real-extended-valued function $f:\mathbb{R}^{n}\to \mathbb{R}\cup\{+\infty\}$ is closed and admits a Whitney stratification, then the norm of the gradient of $f$ at…

Optimization and Control · Mathematics 2007-05-23 J. Bolte , A. Daniilidis , A. S. Lewis , M. Shiota

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

An abstract convergence theorem for a class of generalized descent methods that explicitly models relative errors is proved. The convergence theorem generalizes and unifies several recent abstract convergence theorems. It is applicable to…

Optimization and Control · Mathematics 2017-11-22 Peter Ochs

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

Computational Complexity · Computer Science 2020-06-09 Nader H. Bshouty

For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…

Complex Variables · Mathematics 2021-02-04 Liudmyla Kryvonos

The 1971 Fortuin-Kasteleyn-Ginibre (FKG) inequality for two monotone functions on a distributive lattice is well known and has seen many applications in statistical mechanics and other fields of mathematics. In 2008 one of us (Sahi)…

Probability · Mathematics 2022-04-20 Elliott H Lieb , Siddhartha Sahi

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

The approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM…

Computational Complexity · Computer Science 2015-03-27 Mark Bun , Justin Thaler