中文
相关论文

相关论文: Boolean functions with small spectral norm

200 篇论文

The total influence of a function is a central notion in analysis of Boolean functions, and characterizing functions that have small total influence is one of the most fundamental questions associated with it. The KKL theorem and the…

离散数学 · 计算机科学 2020-05-08 Esty Kelman , Guy Kindler , Noam Lifshitz , Dor Minzer , Muli Safra

The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…

组合数学 · 数学 2017-11-23 Kai-Uwe Schmidt

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

经典分析与常微分方程 · 数学 2022-09-30 Zhi-Hong Sun

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

组合数学 · 数学 2018-01-12 Francis N. Castro , Oscar E. González , Luis A. Medina

A Boolean function is called read-once over a basis B if it can be expressed by a formula over B where no variable appears more than once. A checking test for a read-once function f over B depending on all its variables is a set of input…

离散数学 · 计算机科学 2012-05-29 Dmitry V. Chistikov

We prove that any submodular function f: {0,1}^n -> {0,1,...,k} can be represented as a pseudo-Boolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in…

机器学习 · 计算机科学 2012-08-14 Sofya Raskhodnikova , Grigory Yaroslavtsev

The Fourier coefficients F(t) of a function f on a compact symmetric space U/K are given by integration of f against matrix coefficients of irreducible representations of U. The coefficients depend on a spectral parameter t, which…

表示论 · 数学 2010-01-24 Gestur Olafsson , Henrik Schlichtkrull

We show the pointwise convergence of the averages \[ \mathcal{A}_N f(x) = \frac{1}{\# \mathbf{B}_N} \sum_{n \in \mathbf{B}_N} f(x + n) \] for $f \in \ell^1(\mathbb{Z})$ where $\mathbf{B}_N = \mathbf{B} \cap [1, N]$, and $\mathbf{B}$ is a…

数论 · 数学 2020-12-21 Bartosz Trojan

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

计算复杂性 · 计算机科学 2022-12-02 Edinah K. Gnang , Rongyu Xu

Among functions majorized by indicator functions of sets with measure one, which functions have maximal Fourier transforms in the $L^q$ norm? We partially prove the existence of such functions using techniques from additive combinatorics to…

经典分析与常微分方程 · 数学 2019-08-28 Dominique Maldague

Using the Kaczmarz algorithm, we prove that for any singular Borel probability measure $\mu$ on $[0,1)$, every $f\in L^2(\mu)$ possesses a Fourier series of the form $f(x)=\sum_{n=0}^{\infty}c_ne^{2\pi inx}$. We show that the coefficients…

泛函分析 · 数学 2016-05-03 John E. Herr , Eric S. Weber

Given a function $f$ on $\mathbb{F}_2^n$, we study the following problem. What is the largest affine subspace $\mathcal{U}$ such that when restricted to $\mathcal{U}$, all the non-trivial Fourier coefficients of $f$ are very small? For the…

计算复杂性 · 计算机科学 2023-05-04 Siddharth Iyer , Michael Whitmeyer

We study the semi-classical behavior of the spectral function of the Schr\"{o}dinger operator with short range potential. We prove that the spectral function is a semi-classical Fourier integral operator quantizing the forward and backward…

偏微分方程分析 · 数学 2007-05-23 Ivana Alexandrova

We study the signs of the Fourier coefficients of a newform. Let $f$ be a normalized newform of weight $k$ for $\Gamma_0(N)$. Let $a_f(n)$ be the $n$th Fourier coefficient of $f$. For any fixed positive integer $m$, we study the…

数论 · 数学 2017-10-13 Jaban Meher , Karam Deo Shankhadhar , G. K. Viswanadham

Roughly speaking, the spectrum of multiplicative functions is the set of all possible mean values. In this paper, we are interested in the spectra of multiplicative functions supported over powerful numbers. We prove that its real…

数论 · 数学 2023-03-03 Tsz Ho Chan

We show that if $G$ is a finite Abelian group and $f$ is an integer-valued map on $G$ with algebra norm at most $M$ then there is some $L < \exp(M^{4+o(1)})$, cosets of (possibly different) subgroups $W_1,...,W_L$, and $s_1,...,s_L \in…

经典分析与常微分方程 · 数学 2020-08-18 Tom Sanders

It is a well known general principle that the Fourier transform of a random measure is small, except at the zero frequency, in various senses for appropriate notions of randomness. In this note we develop analogues of this principle for two…

经典分析与常微分方程 · 数学 2011-08-30 Michael Christ

Let $k,N \in \mathbb{N}$ with $N$ square-free and $k>1$. We prove an orthogonal relation and use this to compute the Fourier coefficients of the Eisenstein part of any $f(z) \in M_{2k}(\Gamma_0(N))$ in terms of sum of divisors function. In…

数论 · 数学 2018-08-06 Zafer Selcuk Aygin

Let A= (a_{ij}) be a symmetric non-negative integer 2k x 2k matrix. A is homogeneous if a_{ij} + a_{kl}=a_{il} + a_{kj} for any choice of the four indexes. Let A be a homogeneous matrix and let F be a general form in C[x_1, \dots x_n] with…

代数几何 · 数学 2015-03-17 Luca Chiantini

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

计算复杂性 · 计算机科学 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu