Related papers: Testing Coverage Functions
We study the functorial and growth properties of closed orbits for maps. By viewing an arbitrary sequence as the orbit-counting function for a map, iterates and Cartesian products of maps define new transformations between integer…
A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
Motivated by applications for set containment problems, we consider the following fundamental problem: can we design set-to-vector functions so that the natural partial order on sets is preserved, namely $S\subseteq T \text{ if and only if…
Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…
Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…
By universal formulas we understand parameterized analytic expressions that have a fixed complexity, but nevertheless can approximate any continuous function on a compact set. There exist various examples of such formulas, including some in…
Verifying uniform conditions over continuous spaces through random sampling is fundamental in machine learning and control theory, yet classical coverage analyses often yield conservative bounds, particularly at small failure probabilities.…
We investigate {\em multidimensional covering mechanism-design} problems, wherein there are $m$ items that need to be covered and $n$ agents who provide covering objects, with each agent $i$ having a private cost for the covering objects he…
The line coverage problem involves finding efficient routes for the coverage of linear features by one or more resource-constrained robots. Linear features model environments like road networks, power lines, and oil and gas pipelines. Two…
Let M be a smooth manifold, and let O(M) be the poset of open subsets of M. Manifold calculus, due to Goodwillie and Weiss, is a calculus of functors suitable for studying contravariant functors (cofunctors) F: O(M)--> Top from O(M) to the…
Volumetric objectives for exploration and perception tasks seek to capture a sense of value (or reward) for hypothetical observations at one or more camera views for robots operating in unknown environments. For example, a volumetric…
We show that for any free probability measure-preserving action of $\mathbb{C}^{d}$ on a standard probability space, there exists a Borel entire function $F$ such that the factor map $x \mapsto F_{x}$, where $F_{x}(z) = F(z \cdot x)$, is…
If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…
For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…
Let $M$ be a closed orientable manifold. We introduce two numerical invariants, called filling volumes, on the mapping class group $\mathrm{MCG}(M)$ of $M$, which are defined in terms of filling norms on the space of singular boundaries on…
We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
Covering relations are a topological tool for detecting periodic orbits, symbolic dynamics and chaotic behavior for autonomous ODE. We extend the method of the covering relations onto systems with a time dependent perturbation. As an…