Related papers: Density, forcing, and the covering problem

We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods,…

We study the strong predictable representation property in filtrations initially enlarged with a random variable L. We prove that the strong predictable representation property can always be transferred to the enlarged filtration as long as…

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…

We give sufficient conditions for the asymptotic normality of linear combinations of order statistics (L-statistics) in the case of simple random samples without replacement. In the first case, restrictions are imposed on the weights of…

The notion of probability density for a random function is not as straightforward as in finite-dimensional cases. While a probability density function generally does not exist for functional data, we show that it is possible to develop the…

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

We improve a recent result by giving the optimal conclusion possible both to the frequent universality criterion and the frequent hypercyclicity criterion using the notion of A-densities, where A refers to some weighted densities sharper…

A random set is a generalisation of a random variable, i.e. a set-valued random variable. The random set theory allows a unification of other uncertainty descriptions such as interval variable, mass belief function in Dempster-Shafer theory…

We present a novel approach to Bayesian inference and general Bayesian computation that is defined through a sequential decision loop. Our method defines a recursive partitioning of the sample space. It neither relies on gradients nor…

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Let $\textbf{X} = (X_1,\ldots, X_p)$ be a stochastic vector having joint density function $f_{\textbf{X}}(x)$ with partitions $\textbf{X}_1 = (X_1,\ldots, X_k)$ and $\textbf{X}_2 = (X_{k+1},\ldots, X_p)$. A new method for estimating the…

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

Let $f(t_1,\ldots,t_n)$ be a nondegenerate integral quadratic form. We analyze the asymptotic behavior of the function $D_f(X)$, the number of integers of absolute value up to $X$ represented by $f$. When $f$ is isotropic or $n$ is at least…

This article is devoted to the interplay between forcing with fusion and combinatorial covering properties. We discuss known instances of this interplay as well as present a new one, namely that in the Laver model for the consistency of the…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…