English
Related papers

Related papers: Boolean functions on $S_n$ which are nearly linear

200 papers

Let $\{H_{n,m}\}_{n,m\in \mathbb{N}}$ be the two dimensional Haar system and $S_{n,m}f$ be the rectangular partial sums of its Fourier series with respect to some $f\in L^1([0,1)^2)$. Let $\mathcal{N}, \mathcal{M}\subset \mathbb{N}$ be two…

Classical Analysis and ODEs · Mathematics 2022-03-22 Michihiro Hirayama , Davit Karagulyan

Let S(D) be the surface produced by applying Seifert's algorithm to the oriented link diagram D. I prove that if D has no negative crossings then S(D) is a quasipositive Seifert surface, that is, S(D) embeds incompressibly on a fiber…

Geometric Topology · Mathematics 2007-05-23 Lee Rudolph

We establish three families of Sobolev trace inequalities of orders two and four in the unit ball under higher order moments constraint, and are able to construct \emph{smooth} test functions to show all such inequalities are \emph{almost…

Differential Geometry · Mathematics 2022-01-26 Xuezhang Chen , Wei Wei , Nan Wu

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

We examine correlations of the M\"obius function over $\mathbb{F}_q[t]$ with linear or quadratic phases, that is, averages of the form \begin{equation} \label{eq:average} \frac{1}{q^n}\sum_{\text{deg }f<n} \mu(f)\chi(Q(f)) \end{equation}…

Number Theory · Mathematics 2018-10-01 Pierre-Yves Bienvenu , Thái Hoàng Lê

We investigate an almost sure limit theorem (ASCLT) for sequences of random variables having the form of a ratio of two terms such that the numerator satisfies the ASCLT and the denominator is a positive term which converges almost surely…

Probability · Mathematics 2012-09-04 Peggy Cénac , Khalifa Es-Sebaiy

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

The paper is about methods of discrete Fourier analysis in the context of Weyl group symmetry. Three families of class functions are defined on the maximal torus of each compact simply connected semisimple Lie group $G$. Such functions can…

Mathematical Physics · Physics 2008-04-24 Robert V. Moody , Jiri Patera

In the recent paper [2], it was proved that the closure of the planar diffeomorphisms in the Sobolev norm consists of the functions which are non-crossing (NC), i.e., the functions which can be uniformly approximated by continuous…

Functional Analysis · Mathematics 2020-04-20 Daniel Campbell , Aldo Pratelli , Emanuela Radici

Using the sunflower method, we show that if $\theta \in (0,1) \cap \mathbb{Q}$ and $\mathcal{F}$ is a $O(n^{1/3})$-bounded $\theta$-intersecting family over $[n]$, then $\lvert \mathcal{F} \rvert = O(n)$, and that if $\mathcal{F}$ is…

Combinatorics · Mathematics 2025-09-17 Niranjan Balachandran , Shagnik Das , Brahadeesh Sankarnarayanan

Given a piecewise linear (PL) function $p$ defined on an open subset of $\R^n$, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle $\R^n\times \R^{n*}$ representing the graph of the…

Differential Geometry · Mathematics 2013-06-20 Joseph H. G. Fu , Ryan C. Scott

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…

Computational Complexity · Computer Science 2010-04-12 Hartmut Klauck

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Logic · Mathematics 2021-02-09 Howard Becker , Randall Dougherty

We prove effective results on when a function can be approximated by a Dirichlet polynomial with bounded coefficients. Assuming that \Phi(n) is an increasing function we prove that the set of polynomials {\sum_{n=2}^N a_n n^{it-1}: N \geq…

Number Theory · Mathematics 2012-07-20 Johan Andersson

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

Number Theory · Mathematics 2017-11-08 Stefan Steinerberger

Let $({\mathbf X},\|\cdot\|_{\mathbf X}), ({\mathbf Y},\|\cdot\|_{\mathbf Y})$ be normed spaces with ${\mathrm{dim}}({\mathbf X})=n$. Bourgain's almost extension theorem asserts that for any ${\varepsilon}>0$, if ${\mathcal{N}}$ is an…

Functional Analysis · Mathematics 2020-09-29 Assaf Naor

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Probability · Mathematics 2026-05-20 Saba Lepsveridze , Allen Lin

Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…

Combinatorics · Mathematics 2007-05-23 Roy Meshulam

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer
‹ Prev 1 4 5 6 7 8 10 Next ›