Related papers: Strong jump traceability and Demuth randomness

We examine the extent to which random samplings from the values of a random set, determine the distribution of the random set itself. We also comment on how, given the statistics of the sampling, to detect the distribution. Several methods…

In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

An open question of Gruenhage asks if all strategically selectively separable spaces are Markov selectively separable, a game-theoretic statement known to hold for countable spaces. As a corollary of a result by Berner and Juh$\acute{a}$sz,…

The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a…

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

A piecewise constant local martingale $M$ with boundedly many jumps is a uniformly integrable martingale if and only if $M_\infty^-$ is integrable.

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…

To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…

The notion of shuffle-compatible permutation statistics was implicit in Stanley's work on P-partitions and was first explicitly studied by Gessel and Zhuang. The aim of this paper is to prove that the triple ${\rm (udr, pk, des)}$ is…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set $\cal T$ consisting of Tuple Generating Dependencies (a.k.a. Datalog$^\exists$ program), whether the $\cal…

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…

A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…

We study the quantization problem for certain types of jump processes. The probabilities for the number of jumps are assumed to be bounded by Poisson weights. Otherwise, jump positions and increments can be rather generally distributed and…

We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical…

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…