English
Related papers

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

200 papers

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

We show that we can approximate every function $f\in C^{k}(\bar{B_1})$ with a $s$-harmonic function in $B_1$ that vanishes outside a compact set. That is, $s$-harmonic functions are dense in $C^{k}_{\rm{loc}}$. This result is clearly in…

Analysis of PDEs · Mathematics 2015-03-17 Serena Dipierro , Ovidiu Savin , Enrico Valdinoci

Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean formulae in conjunctive normal form. In this variant, each clause contains exactly three literals---either all or none of them are positive, i.e., no clause contains…

Computational Complexity · Computer Science 2016-03-28 Andreas Darmann , Janosch Döcker

Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…

Quantum Physics · Physics 2022-06-01 Máté Matolcsi , Mihály Weiner

We develop a test to determine whether a function lying in a fixed $L_2$-Sobolev-type ball of smoothness $t$, and generating a noisy signal, is in fact of a given smoothness $s\geq t$ or not. While it is impossible to construct a uniformly…

Statistics Theory · Mathematics 2015-04-14 Alexandra Carpentier

Let $f:\mathbb{R}^k\to \mathbb{R}$ be a measurable function, and let $\{U_i\}_{i\in\mathbb{N}}$ be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},...,U_{i+k-1})$. We show that for all $\ell$, there is a…

Probability · Mathematics 2016-08-10 Noga Alon , Ohad N. Feldheim

We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…

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

In 2008, Cusick {\it et al.} conjectured that certain elementary symmetric Boolean functions of the form $\sigma_{2^{t+1}l-1, 2^t}$ are the only nonlinear balanced ones, where $t$, $l$ are any positive integers, and…

Information Theory · Computer Science 2015-03-20 Wei Su , Xiaohu Tang , Alexander Pott

We investigate monotone operator functions of several variables under a trace or a trace-like functional. In particular, we prove the inequality \tau(x_1... x_n)\le\tau(y_1... y_n) for a trace \tau on a C^*-algebra and abelian n-tuples…

Operator Algebras · Mathematics 2007-05-23 Frank Hansen

Since the early 2000s physicists have developed an ingenious but non-rigorous formalism called the cavity method to put forward precise conjectures on phase transitions in random problems [Mezard, Parisi, Zecchina: Science 2002]. The cavity…

Combinatorics · Mathematics 2018-11-02 Amin Coja-Oghlan , Konstantinos Panagiotou

Let $ f:(0,\infty)\rightarrow \Bbb{R} $ be a completely monotonic function. In this paper, we present some properties of this functions and several new classes of completely monotonic functions. We also give some special functions such that…

Classical Analysis and ODEs · Mathematics 2025-05-30 Mostafa Najafi , Ali Morassaei

We prove that every completely monotone function defined on a right-unbounded open interval admits a Newton series expansion at every point of that interval. This result can be viewed as an analog of Bernstein's little theorem for…

Classical Analysis and ODEs · Mathematics 2025-10-14 Thomas Lamby , Jean-Luc Marichal , Naïm Zenaïdi

A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in…

Computational Complexity · Computer Science 2018-06-05 Elena Grigorescu , Akash Kumar , Karl Wimmer

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-01-31 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

We study the problem of testing if a function depends on a small number of linear directions of its input data. We call a function $f$ a linear $k$-junta if it is completely determined by some $k$-dimensional subspace of the input space. In…

Computational Complexity · Computer Science 2018-11-05 Anindya De , Elchanan Mossel , Joe Neeman

Motivated by Euler-Goldbach and Shallit-Zikan theorems, we introduce zeta-one functions with infinite sums of $n^{s}\pm1$ as an analogy of the Riemann zeta function. Then we compute values of these functions at positive even integers by the…

Number Theory · Mathematics 2022-03-10 Masato Kobayashi , Shunji Sasaki

A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y) < c d(x,z) for all x<y<z in X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It…

Classical Analysis and ODEs · Mathematics 2012-10-09 Ondřej Zindulka , Michael Hrušák , Tamás Mátrai , Aleš Nekvinda , Václav Vlasák

We prove generalizations of L\"owner's results on matrix monotone functions to several variables. We give a characterization of when a function of $d$ variables is locally monotone on $d$-tuples of commuting self-adjoint $n$-by-$n$…

Functional Analysis · Mathematics 2013-12-20 Jim Agler , John E. McCarthy , Nicholas J. Young

We give the first agnostic, efficient, proper learning algorithm for monotone Boolean functions. Given $2^{\tilde{O}(\sqrt{n}/\varepsilon)}$ uniformly random examples of an unknown function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$, our…

Data Structures and Algorithms · Computer Science 2023-05-25 Jane Lange , Arsen Vasilyan

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O(n \log(n)/\varepsilon)$-query tester for unateness of Boolean functions $f:\{0,1\}^n \to \{0,1\}$. In this note we describe a simple non-adaptive, $O(n…

Data Structures and Algorithms · Computer Science 2016-09-06 Deeparnab Chakrabarty , C. Seshadhri
‹ Prev 1 3 4 5 6 7 10 Next ›