Related papers: Operations with slicely countably determined sets
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…
The notion of a simplicial set originated in algebraic topology, and has also been utilized extensively in category theory, but until relatively recently was not used outside of those fields. However, with the increasing prominence of…
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…
After reviewing a universal characterization of the extended positive real numbers published by Denis Higgs in 1978, we define a category which provides an answer to the questions: \begin{itemize} \item what is a set with half an element?…
Let $f$ be a function from a metric space $Y$ to a separable metric space $X$. If $f$ has the Baire property, then it is continuous apart a 1st category set. In 1935, Kuratowski asked whether the separability requirement could be lifted. A…
A promising theory of quaternion-valued functions of one quaternionic variable, now called slice regular functions, has been introduced in 2006. The basic examples of slice regular functions are power series centered at 0 on their balls of…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…
Let S be an operator system -- a self-adjoint linear subspace of a unital C*-algebra A such that contains 1 and A=C*(S) is generated by S. A boundary representation for S is an irreducible representation \pi of C*(S) on a Hilbert space with…
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…
We introduce a nonlocal control condition and the notion of approximate controllability for fractional order quasilinear control inclusions. Approximate controllability of a fractional control nonlocal delay quasilinear functional…
In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
We introduce a nabla, a delta, and a symmetric fractional calculus on arbitrary nonempty closed subsets of the real numbers. These fractional calculi provide a study of differentiation and integration of noninteger order on discrete,…
We investigate the behavior of functional countability and exponential separability in products and subspaces of topological spaces. We solve a problem of Tkachuk by showing that the product of functionally countable pseudocompact spaces is…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…
Slice sampling is an efficient Markov Chain Monte Carlo algorithm to sample from an unnormalized density with acceptance ratio always $1$. However, when the variable to sample is unbounded, its "stepping-out" heuristic works only locally,…
Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…
We provide simplified solutions of Menger's and Hurewicz's problems and conjectures, concerning generalizations of sigma-compactness. The reader who is new to this field will find a self-contained treatment in Sections 1, 2, and 5. Sections…