English
Related papers

Related papers: When are sequences of Boolean functions tame?

200 papers

We consider a sequence of random variables $(R_n)$ defined by the recurrence $R_n=Q_n+M_nR_{n-1}$, $n\ge1$, where $R_0$ is arbitrary and $(Q_n,M_n)$, $n\ge1$, are i.i.d. copies of a two-dimensional random vector $(Q,M)$, and $(Q_n,M_n)$ is…

Statistics Theory · Mathematics 2011-07-15 Paweł Hitczenko , Jacek Wesołowski

A Boolean function $f:\{0,1\}^d \mapsto \{0,1\}$ is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make…

Computational Complexity · Computer Science 2017-06-02 Roksana Baleshzar , Deeparnab Chakrabarty , Ramesh Krishnan S. Pallavoor , Sofya Raskhodnikova , C. Seshadhri

We confirm the Jamneshan-Tao conjecture for finite abelian groups of rank at most a fixed integer $R$ (i.e. finite abelian groups generated by at most $R$ elements), by proving an inverse theorem for 1-bounded functions of non-trivial…

Group Theory · Mathematics 2026-05-15 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

Let $\mathcal{I} \subset \mathbb{N}$ be an infinite subset, and let $\{a_i\}_{i \in \mathcal{I}}$ be a sequence of nonzero real numbers indexed by $\mathcal{I}$ such that there exist positive constants $m, C_1$ for which $|a_i| \leq C_1…

Number Theory · Mathematics 2023-10-03 Evan Chen , Peter S. Park , Ashvin Swaminathan

Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…

Neural and Evolutionary Computing · Computer Science 2026-04-21 Claude Carlet , Marko Čupić , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Let $a_{i1}x_1+\cdots+a_{ik}x_k=0$, $i\in[m]$ be a balanced homogeneous system of linear equations with coefficients $a_{ij}$ from a finite field $\mathbb{F}_q$. We say that a solution $x=(x_1,\ldots, x_k)$ with $x_1,\ldots, x_k\in…

Combinatorics · Mathematics 2023-12-19 Dion Gijswijt

We obtain tight bounds on Poisson tails which are easy to handle. A short proof based on the median of the gamma distribution is given. Numerical comparisons with other known estimates are made. As an application, we consider the rates of…

Probability · Mathematics 2025-09-25 José A. Adell , Daniel Cárdenas-Morales

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

Number Theory · Mathematics 2025-10-15 Andrew Pendleton

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

General Mathematics · Mathematics 2023-06-07 Angshuman R. Goswami

Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.

Combinatorics · Mathematics 2009-10-01 Demetres Christofides

Let $X_1, X_2,\dots$ be a short-memory linear process of random variables. For $1\leq q<2$, let $\cF$ be a bounded set of real-valued functions on $[0,1]$ with finite $q$-variation. It is proved that…

Probability · Mathematics 2019-09-26 Rimas Norvaiša , Alfredas Račkauskas

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

Computational Complexity · Computer Science 2016-04-27 Parikshit Gopalan , Rocco Servedio , Avishay Tal , Avi Wigderson

Linear functions of many independent random variables lead to classical noises (white, Poisson, and their combinations) in the scaling limit. Some singular stochastic flows and some models of oriented percolation involve very nonlinear…

Probability · Mathematics 2007-05-23 Boris Tsirelson

A univariate continuous function can always be decomposed as the sum of a non-increasing function and a non-decreasing one. Based on this property, we propose a non-parametric regression method that combines two spline-fitted monotone…

Methodology · Statistics 2024-04-11 Lijun Wang , Xiaodan Fan , Hongyu Zhao , Jun S. Liu

Let $a_1 = 1$ and, for $n > 1$, $a_n = a_{n-1} + a_{\left \lfloor \frac{n}{2} \right \rfloor}$. In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if $x \in \{1, 2, 3, 5, 6, 7…

Number Theory · Mathematics 2024-06-17 Wouter van Doorn

The Ramanujan sequence $ \{\theta_{n}\}_{n \geq 0}$, defined as $$ \theta_{0}= \frac{1}{2} \ , \ \ \ \theta_{n} = \left(\ \ \frac{e^{n}}{2} - \sum_{k=0}^{n-1} \frac{n^{k}}{k !} \ \ \right) \cdot \frac{n !}{n^{n}} \ , \ \ n \geq 1 \ ,$$ has…

Classical Analysis and ODEs · Mathematics 2016-11-22 Andrew Bakan , Stephan Ruscheweyh , Luis Salinas

We consider the problem of random sampling for band-limited functions. When can a band-limited function $f$ be recovered from randomly chosen samples $f(x_j), j\in \mathbb{N}$? We estimate the probability that a sampling inequality of the…

Probability · Mathematics 2011-04-27 Karlheinz Gröchenig , Richard F. Bass

Let X_1,X_2, . . . be a sequence of i.i.d. mean zero random variables and let S_n the sum of the first n random variables. We show that whenever lim sup_n |S_n|/c_n is finite with probability one and the normalizing sequence {c_n} is…

Probability · Mathematics 2007-05-23 Uwe Einmahl

In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…

Classical Analysis and ODEs · Mathematics 2011-11-14 J. M. Almira
‹ Prev 1 8 9 10 Next ›