中文
相关论文

相关论文: The Number of Locally $p$-stable Functions on $Q_n…

200 篇论文

We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a constant fraction of neighbors colored by $1$, and locally stable…

组合数学 · 数学 2019-03-06 Renan Gross , Uri Grupel

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

交换代数 · 数学 2024-10-02 Claude Carlet , Serge Feukoua , Ana Sălăgean

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

逻辑 · 数学 2024-06-18 Gabriel Conant , Anand Pillay

A family of heterogeneous mean-field systems with jumps is analyzed. These systems are constructed as a Gibbs measure on block graphs. When the total number of particles goes to infinity, a law of large numbers is shown to hold in a…

概率论 · 数学 2021-11-10 D. A. Dawson , A. Sid-Ali , Y. Q. Zhao

A Boolean function f of n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma(x)=f_sigma(x_1, ..., x_n) = f(x_sigma(1), ..., x_sigma(n)) of f, we can compute…

计算复杂性 · 计算机科学 2012-10-23 Noga Alon , Amit Weinstein

We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…

环与代数 · 数学 2024-07-01 Miguel Couceiro , Erkko Lehtonen

We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…

离散数学 · 计算机科学 2012-05-17 Miguel Couceiro , Jean-Luc Marichal , Tamás Waldhauser

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

组合数学 · 数学 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

We prove a version of both Jacobi's and Montel's Theorems for the case of continuous functions defined over the field $\mathbb{Q}_p$ of $p$-adic numbers. In particular, we prove that, if \[ \Delta_{h_0}^{m+1}f(x)=0 \ \ \text{for all}…

经典分析与常微分方程 · 数学 2013-02-19 J. M. Almira , Kh. F. Abu-Helaiel

In this article we study local constancy of the mod $p$ reduction of certain $2$-dimensional crystalline representations of $\mathrm{Gal}\left(\bar{\mathbb{Q}}_p/\mathbb{Q}_p\right)$ using the mod $p$ local Langlands correspondence. We…

数论 · 数学 2022-08-09 Abhik Ganguli , Suneel Kumar

Given a function $f$ on the vertex set of some graph $G$, a scenery, let a simple random walk run over the graph and produce a sequence of values. Is it possible to, with high probability, reconstruct the scenery $f$ from this random…

组合数学 · 数学 2020-09-04 Peter van Hintum

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

概率论 · 数学 2026-04-16 Yiming Chen

We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…

复变函数 · 数学 2025-07-15 Kelly Bickel , Greg Knese , James Eldred Pascoe , Alan Sola

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

数据结构与算法 · 计算机科学 2015-04-08 Ishay Haviv , Oded Regev

We study Boolean functions on the $p$-biased hypercube $(\{0,1\}^n,\mu_p^n)$ through the lens of Fourier (spectral) entropy, i.e. the Shannon entropy of the squared $p$-biased Fourier coefficients. Motivated by recent restriction-based…

组合数学 · 数学 2026-03-13 Fan Chang

Benjamini, Kalai and Schramm showed that a monotone function $f : \{-1,1\}^n \to \{-1,1\}$ is noise stable if and only if it is correlated with a half-space (a set of the form $\{x: \langle x, a\rangle \le b\}$). We study noise stability in…

概率论 · 数学 2016-03-08 Elchanan Mossel , Joe Neeman

A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using…

计算复杂性 · 计算机科学 2011-12-30 Noga Alon , Amit Weinstein

We study stability issues for the so-called Borell-Brascamp-Lieb inequalities, proving that when near equality is realized, the involved functions must be $L^1$-close to be $p$-concave and to coincide up to homotheties of their graphs.

泛函分析 · 数学 2017-02-01 Andrea Rossi , Paolo Salani

This work investigates the Sobolev regularity of solutions to perturbed fractional 1-Laplace equations. Under the assumption that weak solutions are locally bounded, we establish that the regularity properties are analogous to those…

偏微分方程分析 · 数学 2025-10-17 Dingding Li , Chao Zhang

We prove a local limit theorem the number of $r$-cliques in $G(n,p)$ for $p\in(0,1)$ and $r\ge 3$ fixed constants. Our bounds hold in both the $\ell^\infty$ and $\ell^1$ metric. The main work of the paper is an estimate for the…

组合数学 · 数学 2018-11-09 Ross Berkowitz
‹ 上一页 1 2 3 10 下一页 ›