English
Related papers

Related papers: Hypercontractive Inequality for Pseudo-Boolean Fun…

200 papers

Convolution with an appropriate surface measure on a paraboloid is known to define a bounded operator T from L^p(R^d) to L^q(R^d) for certain exponents p,q. By a quasiextremal for the associated inequality, we mean a function f for which…

Classical Analysis and ODEs · Mathematics 2011-06-06 Michael Christ

Let $\|\cdot\|_{\mathbf A}$ be a norm on $\mathbb C^m$ given by the formula $\|(z_1,\ldots,z_m)\|_{\mathbf A}=\|z_1A_1+\cdots+z_mA_m\|_{\rm op}$ for some choice of an $m$-tuple of $n\times n$ linearly independent matrices $\mathbf A=(A_1,…

Functional Analysis · Mathematics 2014-08-12 Avijit Pal

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

Computational Complexity · Computer Science 2016-04-27 Parikshit Gopalan , Rocco Servedio , Avishay Tal , Avi Wigderson

Strong algebraic proof systems such as IPS (Ideal Proof System; Grochow-Pitassi [GP18]) offer a general model for deriving polynomials in an ideal and refuting unsatisfiable propositional formulas, subsuming most standard propositional…

Computational Complexity · Computer Science 2024-12-31 Tuomas Hakoniemi , Nutan Limaye , Iddo Tzameret

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alexander Borichev , Fedor Nazarov , Mikhail Sodin

The \emph{Chow parameters} of a Boolean function $f: \{-1,1\}^n \to \{-1,1\}$ are its $n+1$ degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenbaum) that the (exact values of the) Chow parameters of any…

Computational Complexity · Computer Science 2012-06-06 Anindya De , Ilias Diakonikolas , Vitaly Feldman , Rocco A. Servedio

We consider general (not necessarily Hamiltonian) first-order symmetric system $J y'-B(t)y=\D(t) f(t)$ on an interval $\cI=[a,b) $ with the regular endpoint $a$. A distribution matrix-valued function $\Si(s), \; s\in\bR,$ is called a…

Functional Analysis · Mathematics 2014-07-22 Vadim Mogilevskii

In this paper, we will consider subfractals of hyperbolic iterated function systems which satisfy the open set condition. The subfractals will consist of points associated with infinite strings from a subshift of finite type or sofic…

Dynamical Systems · Mathematics 2016-01-20 Elizabeth Sattler

We introduce a \emph{spectral Dehn function} \[ \Lambda_{\mathcal{P}}(n):=\inf \lambda_1(\Delta), \] where $\lambda_1(\Delta)$ is the first Dirichlet eigenvalue of the random-walk Laplacian on a van Kampen diagram $\Delta$, and the infimum…

Group Theory · Mathematics 2026-04-13 Mayukh Mukherjee

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

Classical Analysis and ODEs · Mathematics 2020-07-15 Angshuman R. Goswami , Zsolt Páles

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…

Quantum Physics · Physics 2008-01-09 Lars Eirik Danielsen

We ask whether most Boolean functions are determined by their low frequencies. We show a partial result: for almost every function $f: \{-1,1\}^p \to \{-1,1\}$ there exists a function $f': \{-1,1\}^p \to (-1,1)$ that has the same…

Combinatorics · Mathematics 2024-12-24 Roman Vershynin

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

Combinatorics · Mathematics 2008-05-14 Leonid Gurvits

Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…

Metric Geometry · Mathematics 2020-02-25 Mikhail Nevskii

Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$…

Information Theory · Computer Science 2019-11-13 Alex Samorodnitsky

Let $f$ be a weight $k$ holomorphic cusp form of level one, and let $S_f(n)$ denote the sum of the first $n$ Fourier coefficients of $f$. In analogy with Dirichlet's divisor problem, it is conjectured that $S_f(X) \ll X^{\frac{k-1}{2} +…

Number Theory · Mathematics 2017-05-04 Thomas A. Hulse , Chan Ieong Kuan , David Lowry-Duda , Alexander Walker

The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…

Computational Complexity · Computer Science 2025-09-03 Xi Chen , Anindya De , Yizhi Huang , Yuhao Li , Shivam Nadimpalli , Rocco A. Servedio , Tianqi Yang

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

Probability · Mathematics 2007-12-23 Iosif Pinelis

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…

Computational Complexity · Computer Science 2016-05-16 Michael A. Forbes , Mrinal Kumar , Ramprasad Saptharishi

The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…

Computational Complexity · Computer Science 2025-10-01 Sourav Chakraborty , Chandrima Kayal , Manaswi Paraashar