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

Let $b_{t,i}(n)$ denote the total number of the $i$ hooks in the $t$-regular partitions of $n$. Singh and Barman (J. Number Theory { 264} (2024), 41--58) raised two conjectures on $b_{t,i}(n)$. The first conjecture is on the positivity of…

It is noticed that a certain transform of the Mittag-Leffler function Ea is completely monotone for a in [1,2]. Using the explicit expressions of its Bernstein density, an identity in law between suprema of completely asymmetric Levy…

For an operator monotone function $f(t)$ on the positive real line, we show the operator monotonicity of the type of the functions $(t-a)(t-b)/(f(t)-f(a))(f^\sharp(t)-f^\sharp(b))$.

Recently, Nitzan and Olsen showed that Balian-Low theorems (BLTs) hold for discrete Gabor systems defined on $\mathbb{Z}_d$. Here we extend these results to a multivariable setting. Additionally, we show a variety of applications of the…

We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…

In this paper we initiate the study of real operator monotonicity for functions of tuples of operators, which are multivariate structured maps with a functional calculus called free functions that preserve the order between real parts (or…

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The…

It is proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then $$ H(X_1+\cdots+X_{n+1}) \geq…

A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to…

We prove the following result: if a $\mathbb{Q}$-Fano variety is uniformly K-stable, then it admits a K\"{a}hler-Einstein metric. We achieve this by modifying Berman-Boucksom-Jonsson's strategy with appropriate perturbative arguments and…

We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of $k$-of-$n$ functions: There are independent Boolean random variables $x_1,\dots,x_n$ where each variable $i$ has a known probability $p_i$ of…

The satisfiability problem is known to be $\mathbf{NP}$-complete in general and for many restricted cases. One way to restrict instances of $k$-SAT is to limit the number of times a variable can be occurred. It was shown that for an…

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric…

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

For the partial sums $(S_n)$ of independent random variables we define a stochastic process $s_n(t):=(1/d_n)\sum_{k \le [nt]} ({S_k}/{k}-\mu)$ and prove that $$(1/{\log N})\sum_{n\le N}(1/n)\mathbf {I}\left\{s_n(t)\le x\right\} \to…

We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $\alpha=\lim_{n\to\infty}m/n$ for $k=2,3$. It is known that if $\alpha$ is small enough, then the random $k$-SAT problem admits a solution with…

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

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…