Related papers: Sensitivity Conjecture and Log-rank Conjecture for…
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…
In functional analysis it is well known that every linear functional defined on the dual of a locally convex vector space which is continuous for the weak topology is the evaluation at a uniquely determined point of the given vector space.…
The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…
We provide a sharp monotonicity theorem about the distribution of subharmonic functions on manifolds, which can be regarded as a new, measure theoretic form of the uncertainty principle. As an illustration of the scope of this result, we…
We solve two continuous extremal problems on the classes of monotone functions: in the first problem we find extremal values for a line integral of a coordinate-wise monotone function of two variables from a rearrange\-ment-invariant class…
The Bounded Negativity Conjecture predicts that for every complex projective surface $X$ there exists a number $b(X)$ such that $C^2\geq -b(X)$ holds for all reduced curves $C\subset X$. For birational surfaces $f:Y\to X$ there have been…
We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
The comonotonic maxitivity property of functionals frequently appears in the characterization of fuzzy integrals based on the maximum operation. In some special cases, comonotonic maxitivity implies monotonicity of functionals. The question…
Reasoning with LLMs increasingly unfolds inside a broader verification loop. Internally, systems use cheap checks, such as self-consistency or proxy rewards, which we call weak verification. Externally, users inspect outputs and steer the…
A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…
In the work, we focus on a conjecture due to Z.X. Chen and H.X. Yi[1] which is concerning the uniqueness problem of meromorphic functions share three distinct values with their difference operators. We prove that the conjecture is right for…
We study the dynamics of the periodically-forced May-Leonard system. We extend previous results on the field and we identify different dynamical regimes depending on the strength of attraction $\delta$ of the network and the frequency…
We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…
We give a proof of the openness conjecture of Demailly and Koll\'ar for positively curved singular metrics on ample line bundles over projective varieties. As a corollary it follows that the openness conjecture for plurisubharmonic…
A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…
Associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=f^{(-1)}(T^*(f(x),f(y)))$ where $T^*:[0,1]^2\rightarrow[0,1]$ is an associative function with neutral element in $[0,1]$, $f: [0,1]\rightarrow [0,1]$ is…
This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…
In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…
Selective information transfer in spin ring networks by energy landscape shaping control has the property that the error 1-prob, where prob is the transfer success probability, and the sensitivity of the error to spin coupling uncertainties…