English
Related papers

Related papers: Hypercontractive Inequality for Pseudo-Boolean Fun…

200 papers

The main object of the paper is a symmetric system $J y'-B(t)y=\l\D(t) y$ defined on an interval $\cI=[a,b) $ with the regular endpoint $a$. Let $\f(\cd,\l)$ be a matrix solution of this system of an arbitrary dimension and let…

Functional Analysis · Mathematics 2016-11-11 Vadim Mogilevskii

This work is dedicated to the development of the theory of Fourier hyperfunctions in one variable with values in a complex non-necessarily metrisable locally convex Hausdorff space $E$. Moreover, necessary and sufficient conditions are…

Functional Analysis · Mathematics 2026-04-20 Karsten Kruse

The pseudospherical functions on one-sheet, two-dimensional hyperboloid are discussed. The simplest method of construction of these functions is introduced using the Fock space structure of the representation space of the su(1,1) algebra.…

Mathematical Physics · Physics 2015-05-27 K. Kowalski , J. Rembielinski , A. Szczesniak

The Fourier Entropy-Influence (FEI) Conjecture of Friedgut and Kalai states that ${\bf H}[f] \leq C \cdot {\bf I}[f]$ holds for every Boolean function $f$, where ${\bf H}[f]$ denotes the spectral entropy of $f$, ${\bf I}[f]$ is its total…

Computational Complexity · Computer Science 2019-01-25 Guy Shalev

In this paper, a new two-dimensional Hardy type inequality is given in terms of pseudo-analysis dealing with set-valued functions. The first one is given for a pseudo-integral of set-valued function where pseudo-addition and…

Functional Analysis · Mathematics 2022-06-29 Bayaz Daraby , Mortaza Tahmourasi , Asghar Rahimi

It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…

Number Theory · Mathematics 2007-05-23 F. Auil

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Number Theory · Mathematics 2011-03-25 Hamed Hatami , Shachar Lovett

We introduce a maximal inequality for a local empirical process under strongly mixing data. Local empirical processes are defined as the (local) averages $\frac{1}{nh}\sum_{i=1}^n \mathbf{1}\{x - h \leq X_i \leq x+h\}f(Z_i)$, where $f$…

Econometrics · Economics 2023-07-06 Luis Alvarez , Cristine Pinto

Consider averages along the prime integers $ \mathbb P $ given by \begin{equation*} \mathcal{A}_N f (x) = N ^{-1} \sum_{ p \in \mathbb P \;:\; p\leq N} (\log p) f (x-p). \end{equation*} These averages satisfy a uniform scale-free $ \ell…

Classical Analysis and ODEs · Mathematics 2020-06-23 Rui Han , Ben Krause , Michael Lacey , Fan Yang

We introduce a non-linear criterion which allows us to determine when a function can be written as a sum of functions belonging to homogeneous fractional spaces: for $\ell \in \mathbb{N}^*$, $s_i\in (0, 1)$ and $p_i \in [1, +\infty)$, $u :…

Analysis of PDEs · Mathematics 2021-04-21 Rémy Rodiac , Jean Van Schaftingen

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…

Number Theory · Mathematics 2026-04-10 Moni Kumari , Prabhat Kumar Mishra , Jyotirmoy Sengupta

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

Classical Analysis and ODEs · Mathematics 2016-10-27 Joel Laity , Barak Shani

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Classical Analysis and ODEs · Mathematics 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

An arithmetic function $f$ is called a sieve function of range $Q$, if it is the convolution product of the constantly $1$ function and $g$ such that $g(q)\ll_{\varepsilon} q^{\varepsilon}$, $\forall\varepsilon>0$, for $q\leq Q$, and…

Number Theory · Mathematics 2016-09-02 Giovanni Coppola , Maurizio Laporta

Let $ E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}$, $E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},$ and…

Combinatorics · Mathematics 2018-11-27 Anwar Irmatov

The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…

Classical Analysis and ODEs · Mathematics 2026-01-26 Erik Talvila

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

The Bohnenblust--Hille inequality says that the $\ell^{\frac{2m}{m+1}}$-norm of the coefficients of an $m$-homogeneous polynomial $P$ on $\C^n$ is bounded by $\| P\|_\infty$ times a constant independent of $n$, where $\|\cdot \|_\infty$…

Complex Variables · Mathematics 2011-10-06 Andreas Defant , Leonhard Frerick , Joaquim Ortega-Cerdà , Myriam Ounaïes , Kristian Seip

The approximate degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that approximates $f$ pointwise: $|f(x)-p(x)|\leq1/3$ for all $x\in\{0,1\}^n.$ For every $\delta>0,$ we construct CNF…

Computational Complexity · Computer Science 2022-09-07 Alexander A. Sherstov

We describe a new construction of Boolean functions. A specific instance of our construction provides a 30-variable Boolean function having min-entropy/influence ratio to be $128/45 \approx 2.8444$ which is presently the highest known value…

Computational Complexity · Computer Science 2024-01-19 Aniruddha Biswas , Palash Sarkar
‹ Prev 1 4 5 6 7 8 10 Next ›