Related papers: The Average Sensitivity of Bounded-Depth Formulas

Machine learning models with inputs in a Euclidean space $\mathbb{R}^d$, when implemented on digital computers, generalize, and their generalization gap converges to $0$ at a rate of $c/N^{1/2}$ concerning the sample size $N$. However, the…

We consider Laplacian eigenfunctions on a domain $\Omega \subset \mathbb{R}^d$. Under Neumann boundary conditions, the first eigenfunction is constant and the others have mean value 0. The situation is different for Dirichlet boundary…

We establish a lower bound for the principal $p-$frequency $\lambda_{1,p}(\Omega)$ on a bounded domain $\Omega$ in a non-compact Riemannian manifold of dimension $n.$ Under the assumption that the Ricci curvature satisfies…

We study the average shifted convolution sum $$ B(H,N):= \frac{1}{H} \sum_{h \sim H} \sum_{n \sim N} A_{\pi_1}(n)\, A_{\pi_2}(n+h), $$ where $A_{\pi_i}(n)$ denotes the Fourier coefficients of a Hecke--Maass cusp form $\pi_i$ for…

In this paper we compute the spherical Fourier expansions coefficients for the restriction of the generalised Wendland functions from $d-$dimensional Euclidean space to the (d-1)-dimensional unit sphere. The development required to derive…

It is shown that the minimal depth of an optimal prefix circuit (i.e., a zero-deficiency circuit) on $N$ inputs with fanout bounded by $k$ is ${\log_{\alpha_k} N \pm O(1)}$, where $\alpha_k$ is the unique positive root of the polynomial…

This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…

We apply the discrepancy method and a chaining approach to give improved bounds on the coreset complexity of a wide class of kernel functions. Our results give randomized polynomial time algorithms to produce coresets of size…

Using the Euclidean path integral approach with functional methods, we discuss the $(g_{0} \phi^{p})_{d}$ self-interacting scalar field theory, in the strong-coupling regime. We assume the presence of macroscopic boundaries confining the…

We investigate Bose-Einstein condensation for ultracold bosonic atoms in two-dimensional systems. The functional renormalization group for the average action allows us to follow the effective interactions from molecular scales…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We investigate Bose-Einstein condensation for interacting bosons at zero and nonzero temperature. Functional renormalization provides us with a consistent method to compute the effect of fluctuations beyond the Bogoliubov approximation. For…

We study collective behavior of Fermi gases trapped in various external potentials, including optical lattices (OLs), in the framework of the mean-field (hydrodynamic) description. Using the variational method, we derive effective dynamical…

In this work, we mainly study the one-loop effective action for real scalar theories in non-homogeneous backgrounds in odd dimensions. It is shown that through the method studied in Ref. [1], it is possible to obtain a unified result for…

We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

In this paper, we investigate single and double layer potentials mapping boundary data to interior functions of a domain at high frequency $\lambda^2\to\infty$. For single layer potentials, we find that the…

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected…