English
Related papers

Related papers: On unbalanced Boolean functions with best correlat…

200 papers

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T}$ exhibits Poissonian pair correlation if for all $s\geq0$, \begin{equation*} \lim_{N\to\infty} \frac{1}{N}\#\left\{1\leq m\neq n \leq N : |x_m-x_n| \leq \frac{s}{N}\right\} = 2s.…

Number Theory · Mathematics 2020-12-15 Alex Cohen

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied…

Computational Complexity · Computer Science 2014-12-19 Xi Chen , Rocco A. Servedio , Li-Yang Tan

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

Combinatorics · Mathematics 2018-03-14 Julia Q. D. Du , Edward Y. S. Liu , Jack C. D. Zhao

We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation…

Computational Complexity · Computer Science 2017-11-17 Shalev Ben-David , Pooya Hatami , Avishay Tal

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…

Cryptography and Security · Computer Science 2017-09-12 Jian Liu , Sihem Mesnager

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

Combinatorics · Mathematics 2014-03-07 Nikos Frantzikinakis , Bernard Host

Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…

Number Theory · Mathematics 2016-03-31 Nipen Saikia , Chayanika Boruah

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

Combinatorics · Mathematics 2025-02-03 Michael J. Schlosser , Nian Hong Zhou

The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we…

Combinatorics · Mathematics 2022-10-26 Cristina Ballantine , Mircea Merca

Quantum theory allows for correlations between the outcomes of distant measurements that are inconsistent with any locally causal theory, as demonstrated by the violation of a Bell inequality. Typical demonstrations of these correlations…

Quantum Physics · Physics 2012-02-08 Joel J. Wallman , Stephen D. Bartlett

Let $ E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}$, $E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},$ and…

Combinatorics · Mathematics 2018-11-27 Anwar Irmatov

We completely determine the free infinite divisibility for the Boolean stable law which is parametrized by a stability index $\alpha$ and an asymmetry coefficient $\rho$. We prove that the Boolean stable law is freely infinitely divisible…

Probability · Mathematics 2014-03-07 Octavio Arizmendi , Takahiro Hasebe

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…

Discrete Mathematics · Computer Science 2015-11-12 Xi Chen , Jinyu Xie

A well known result in the theory of uniform distribution modulo one (which goes back to Fej\'er and Csillag) states that the fractional parts $\{n^\alpha\}$ of the sequence $(n^\alpha)_{n\ge1}$ are uniformly distributed in the unit…

Number Theory · Mathematics 2020-07-01 Niclas Technau , Nadav Yesha

We show that the correlation functions of any single-field cosmological model with constant growing-modes are constrained by an infinite number of novel consistency relations, which relate (N+1)-point correlation functions with a…

High Energy Physics - Theory · Physics 2014-01-29 Kurt Hinterbichler , Lam Hui , Justin Khoury

We show that correlations inconsistent with any locally causal description can be a generic feature of measurements on entangled quantum states. Specifically, spatially-separated parties who perform local measurements on a…

Quantum Physics · Physics 2016-09-08 Yeong-Cherng Liang , Nicholas Harrigan , Stephen D. Bartlett , Terry Rudolph

Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high `complexity' according to various measures. In recent work of…

Computational Complexity · Computer Science 2010-01-14 Andrew Drucker

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

Combinatorics · Mathematics 2024-06-04 Cristina Ballantine , Amanda Welch
‹ Prev 1 4 5 6 7 8 10 Next ›