English
Related papers

Related papers: Hypercontractive Inequality for Pseudo-Boolean Fun…

200 papers

We give a general strategy to construct superoscillating/growing functions using an orthogonal polynomial expansion of a bandlimited function. The degree of superoscillation/growth is controlled by an anomalous expectation value of a…

Mathematical Physics · Physics 2023-11-08 Tathagata Karmakar , Andrew N. Jordan

The degree excess function $\epsilon(I;n)$ is the difference between the maximal generating degree $d(I^n)$ of a homogeneous ideal $I$ of a polynomial ring and $p(I)n$, where $p(I)$ is the leading coefficient of the asymptotically linear…

Commutative Algebra · Mathematics 2021-08-20 Le Tuan Hoa

We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…

Discrete Mathematics · Computer Science 2018-04-13 Andrei Bulatov , Leslie Ann Goldberg , Mark Jerrum , David Richerby , Stanislav Živný

This dissertation studies the Fourier restriction, which is to find the range of the constants p, q such that the L^q norm on a chosen subset of the Fourier domain is bounded above by the L^p norm in a spacial domain, up to some constant…

History and Overview · Mathematics 2025-12-16 Sicheng Zhang

Subsequent to our recent work on Fourier spectrum characterization of Hardy spaces $H^p(\mathbb{R})$ for the index range $1\leq p\leq \infty,$ in this paper we prove further results on rational Approximation, integral representation and…

Complex Variables · Mathematics 2015-03-31 Guantie Deng , Tao Qian

In [7], Kwapie\'{n} announced that every mean zero function $f\in L_\infty[0,1]$ can be written as a coboundary $f = g\circ T -g$ for some $g\in L_\infty[0,1]$ and some measure preserving transformation $T$ of $[0,1]$. Whereas the original…

Dynamical Systems · Mathematics 2019-12-02 Aleksei F. Ber , Matthijs J. Borst , Fedor A. Sukochev

We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation…

Information Theory · Computer Science 2007-07-16 Lars Eirik Danielsen , Matthew G. Parker

Let $f$ be an arbitrary transcendental entire or meromorphic function in the class $\mathcal S$ (i.e. with finitely many singularities). We show that the topological pressure $P(f,t)$ for $t > 0$ can be defined as the common value of the…

Dynamical Systems · Mathematics 2012-07-13 Krzysztof Barański , Bogusława Karpińska , Anna Zdunik

As a new technique it is shown how general pseudo-differential operators can be estimated at arbitrary points in Euclidean space when acting on functions $u$ with compact spectra. The estimate is a factorisation inequality, in which one…

Analysis of PDEs · Mathematics 2016-09-26 Jon Johnsen

One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the $\mathbf{P}$ versus $\mathbf{NC^1}$ problem. The current best depth lower bound is $(3-o(1))\cdot…

Computational Complexity · Computer Science 2024-04-25 Hao Wu

This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…

Computational Complexity · Computer Science 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

The notion of a shift-compact set in an abelian topological group $X$ plays a significant role in functional equations and inequalities, especially so since each Borel set that is not Haar-meagre, alternatively not Haar-null, is necessarily…

Classical Analysis and ODEs · Mathematics 2019-12-23 N. H. Bingham , Eliza Jablonska , Wojciech Jablonski , Adam J. Ostaszewski

The level-$k$ $\ell_1$-Fourier weight of a Boolean function refers to the sum of absolute values of its level-$k$ Fourier coefficients. Fourier growth refers to the growth of these weights as $k$ grows. It has been extensively studied for…

Computational Complexity · Computer Science 2023-07-27 Uma Girish , Makrand Sinha , Avishay Tal , Kewen Wu

This paper studies first the differential inequalities that make it possible to build a global theory of pseudo-holomorphic functions in the case of one or several complex variables. In the case of one complex dimension, we prove that the…

Complex Variables · Mathematics 2016-06-28 Giampiero Esposito , Raju Roychowdhury

A convex function $f:[a,b]\to\mathbb{R}$ satisfies the so-called Hermite-Hadamard inequality $$ f\left(\frac{a+b}{2}\right)\leq \frac{1}{b-a}\int_a^{b}f(t)dt\leq \frac{f(a)+f(b)}{2}. $$ Motivated by the above estimates, in this paper we…

General Mathematics · Mathematics 2024-01-18 Angshuman R. Goswami , Ferenc Hartung

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

Computational Complexity · Computer Science 2019-06-04 Andrej Bogdanov , Nikhil S. Mande , Justin Thaler , Christopher Williamson

If $f$ is a nonzero Bohr almost periodic function on $\mathbb R$ with a bounded spectrum we prove there exist $C_f > 0$ and integer $n > 0$ such that for every $u > 0$ the mean measure of the set $\{\, x \, : \, |f(x)| < u \, \}$ is less…

Functional Analysis · Mathematics 2019-04-23 Wayne Lawton

An arithmetic function $f$ is called a $sieve$ $function$ of $range$ $Q$ if its Eratosthenes transform $g=f\ast\mu$ has support in $[1,Q]$, where $g(q)\ll_{\varepsilon} q^{\varepsilon}$ ($\forall\varepsilon>0$). We continue our study of the…

Number Theory · Mathematics 2019-01-15 Giovanni Coppola , Maurizio Laporta

The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been…

Computational Complexity · Computer Science 2019-03-29 Sourav Chakraborty , Sushrut Karmalkar , Srijita Kundu , Satyanarayana V. Lokam , Nitin Saurabh

In this paper we prove an analogue of the discrete spherical maximal theorem of Magyar, Stein, and Wainger, an analogue which concerns maximal functions associated to homogenous algebraic surfaces. Let $\mathfrak{p}$ be a homogenous…

Number Theory · Mathematics 2017-12-06 Brian Cook