Related papers: Computing K-Trivial Sets by Incomplete Random Sets

Let K be a number field and let A be its ring of integers. Let G be a connected, noncommutative, absolutely almost simple algebraic K-group. If the K-rank of G equals 2, then G(A[t]) is not finitely presented.

The main object of investigation in this paper is a very general regression model in optional setting - when an observed process is an optional semimartingale depending on an unknown parameter. It is well-known that statistical data may…

On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane…

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…

Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

We point out a simple criterion for convergence of polynomials to a concrete entire function in the Laguerre-P\'{o}lya ($\mathcal{LP}$) class (of all functions arising as uniform limits of polynomials with only real roots). We then use this…

The lefthanded Lov\'asz local lemma (LLLL) is a generalization of the Lov\'asz local lemma (LLL), a powerful technique from the probabilistic method. We prove a computable version of the LLLL and use it to effectivize a collection of…

Clustering is an unsupervised learning task that aims to partition data into a set of clusters. In many applications, these clusters correspond to real-world constructs (e.g. electoral districts) whose benefit can only be attained by groups…

We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…

Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…

One partially ordered set, $Q$, is a Tukey quotient of another, $P$, denoted $P \geq_T Q$, if there is a map $\phi : P \to Q$ carrying cofinal sets of $P$ to cofinal sets of $Q$. Let $X$ be a space and denote by $\mathcal{K}(X)$ the set of…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L\"of random left-computably enumerable reals has a Friedberg numbering, as does the family of…

Let G be an infinite group and let h and g be elements. We say that h is a root of g if some integer power of h is equal to g. We define K(G) to be the subgroup of all elements of G for which the number of elements which are not roots is of…

In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…