Related papers: Testing Coverage Functions

Embedding Calculus, as described by Weiss, is a calculus of functors, suitable for studying contravariant functors from the poset of open subsets of a smooth manifold M, denoted O(M), to a category of topological spaces (of which the…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Standard decision theory seeks conditions under which a preference relation can be compressed into a single real-valued function. However, when preferences are incomplete or intransitive, a single function fails to capture the agent's…

Let $\Omega\subset \mathbb C^n$ be a bounded domain, and let $f$ be a real-valued function defined on the whole topological boundary $\partial \Omega$. The aim of this paper is to find a characterization of the functions $f$ which can be…

Whittaker functions are special functions that arise in $p$-adic number theory and representation theory. They may be defined on representations of reductive groups as well as their metaplectic covering groups: fascinatingly, many of their…

This paper addresses the natural question: ``How should frames be compared?'' We answer this question by quantifying the overcompleteness of all frames with the same index set. We introduce the concept of a frame measure function: a…

Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

We introduce a framework for benchmarking optimizers according to multiple criteria over various test functions. Based on a recently introduced union-free generic depth function for partial orders/rankings, it fully exploits the ordinal…

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

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…

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…

We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…

A filter oracle for a clutter consists of a finite set $V$ along with an oracle which, given any set $X\subseteq V$, decides in unit time whether or not $X$ contains a member of the clutter. Let $\mathfrak{A}_{2n}$ be an algorithm that,…

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…

We show that the theta representations on certain covers of general linear groups support certain types of unique functionals. The proof involves two types of Fourier coefficients. The first are semi-Whittaker coefficients, which generalize…

Let $\succsim$ be a binary relation on the set of simple lotteries over a countable outcome set $Z$. We provide necessary and sufficient conditions on $\succsim$ to guarantee the existence of a set $U$ of von Neumann--Morgenstern utility…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…