English
Related papers

Related papers: Nearly all $k$-SAT functions are unate

200 papers

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

Operator monotone functions, introduced by Lowner in 1934, are an important class of real-valued functions. They arise naturally in matrix and operator theory and have various applications in other branches of mathematics and related…

Functional Analysis · Mathematics 2016-11-26 Pattrawut Chansangiam

As Cook-Levin theorem showed, every NP problem can be reduced to SAT in polynomial time. In this paper I show a simpler and more efficent method to reduce some factorization problems to the satisfability of a boolean formula.

Computational Complexity · Computer Science 2020-04-29 Davide Maran

We prove that the Fourier coefficients of a certain general eta product considered by K. Saito are nonnegative. The proof is elementary and depends on a multidimensional theta function identity. The z = 1 case is an identity for the…

Number Theory · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

A classical theorem of Fatou asserts that the Radon-Nikodym derivative of any finite positive Borel measure, $\mu$, with respect to Lebesgue measure on the complex unit circle, is recovered as the non-tangential limits of its Poisson…

Functional Analysis · Mathematics 2021-06-22 Michael T. Jury , Robert T. W. Martin

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Combinatorics · Mathematics 2025-01-09 Rupam Barman , Pankaj Jyoti Mahanta , Gurinder Singh

We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…

Logic in Computer Science · Computer Science 2015-02-10 Zoltán Ésik , Panos Rondogiannis

We consider a $G$-function $F(z)=\sum_{k=0}^{\infty} A_k z^k \in \mathbb{K}[[z]]$, where $\mathbb{K}$ is a number field, of radius of convergence $R$ and annihilated by the $G$-operator $L \in \mathbb{K}(z)[\mathrm{d}/\mathrm{d}z]$, and a…

Number Theory · Mathematics 2021-05-18 Gabriel Lepetit

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

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…

Probability · Mathematics 2016-03-08 Elchanan Mossel , Joe Neeman

The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra $B$) is also known in more general form in terms of expansion in a set $\Phi$ of orthonormal functions. However,…

Computational Complexity · Computer Science 2013-12-06 Virendra Sule

Given a sequence of Boolean functions $(f_n)_{n \geq 1}$, $f_n \colon \{ 0,1 \}^{n} \to \{ 0,1 \}$, and a sequence $(X^{(n)})_{n\geq 1} $ of continuous time $p_n $-biased random walks $ X^{(n)} = (X_t^{(n)})_{t \geq 0}$ on $ \{ 0,1 \}^{n}$,…

Probability · Mathematics 2021-01-05 Malin Palö Forsström

Let $n, m, k$ be positive integers with $k=n-m+1$. We establish an abstract Morse-Sard-type theorem which allows us to deduce, on the one hand, a previous result of De Pascale's for Sobolev $W^{k,p}_{\textrm{loc}}(\mathbb{R}^n,…

Classical Analysis and ODEs · Mathematics 2018-01-23 D. Azagra , J. Ferrera , J. Gómez-Gil

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

Probability · Mathematics 2023-09-22 Hui Liu , Yudan Xiong , Fangjun Xu

Let $f\colon \{0,1\}^n\to \{0,1\}$ be a monotone Boolean functions, let $\psi_k(f)$ denote the Shapley value of the $k$th variable and $b_k(f)$ denote the Banzhaf value (influence) of the $k$th variable. We prove that if we have $\psi_k(f)…

Combinatorics · Mathematics 2025-02-11 Gil Kalai , Noam Lifshitz

In this paper we give some conditions for a class of functions related to Bessel functions to be positive definite or strictly positive definite . We present some properties and relationships involving logarithmically completely monotonic…

Classical Analysis and ODEs · Mathematics 2012-05-08 Jamel El Kamel , Khaled Mehrez

We give some necessary and some sufficient conditions for the complete monotonicity on the negative half-line of a Mittag-Leffler function of Le Roy type. It is conjectured that the underlying positive random variable, when it exists, must…

Classical Analysis and ODEs · Mathematics 2021-03-26 Thomas Simon

In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…

Data Structures and Algorithms · Computer Science 2026-04-08 Nader H. Bshouty , George Haddad

A unitary family is a family of unitary operators $U(x)$ acting on a finite dimensional hermitian vector space, depending analytically on a real parameter $x$. It is monotone if $\frac1i U'(x)U(x)^{-1}$ is a positive operator for each $x$.…

Functional Analysis · Mathematics 2007-11-20 Daniel Grieser

In this paper, we present a novel algorithm to solve the Boolean Satisfiability (SAT) problem, using noise-based logic (NBL). Contrary to what the name may suggest, NBL is not a random/fuzzy logic system. In fact, it is a completely…

Computational Complexity · Computer Science 2011-10-05 Pey-Chang Kent Lin , Ayan Mandal , Sunil P Khatri