Related papers: Asymptotic density and the coarse computability bo…

We prove that an IRS of a group with a geometrically dense action on a CAT(0) space also acts geometrically densely; assuming the space is either of finite telescopic dimension or locally compact with finite dimensional Tits boundary. This…

For a locally compact Abelian group $G$ and a continuous weight function $\omega$ on $G$ we show that the Beurling algebra $L^1(G, \omega)$ is weakly amenable if and only if there is no nontrivial continuous group homomorphism $\phi$: $G\to…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

When working with asymptotically hyperbolic initial data sets for general relativity it is convenient to assume certain simplifying properties. We prove that the subset of initial data sets with such properties is dense in the set of…

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical…

A topological space $X$ is cometrizable if it admits a weaker metrizable topology such that each point $x\in X$ has a (not necessarily open) neighborhood base consisting of metrically closed sets. We study the relation of cometrizable…

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…

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

We prove that for every positive integer $r$ and for every graph class $\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\mathcal G$. Moreover, when $\mathcal G$ is only assumed to be…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

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 further develop the relationship between $\beta$-numbers and discrete curvatures to provide a new proof that under weak density assumptions, finiteness of the pointwise discrete curvature $\operatorname{curv}^{\alpha}_{\mu;2}(x,r)$ at…

Grosu [On the algebraic and topological structure of the set of Tur\'{a}n densities. \emph{J. Combin. Theory Ser. B} \textbf{118} (2016) 137--185] asked if there exist an integer $r\ge 3$ and a finite family of $r$-graphs whose Tur\'{a}n…

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto \lambda x)_{\lambda \in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in…

We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…

In this paper, we first show that the collection of all subsets of \( \mathbb{R} \) having lower dimension \( \gamma \in [0,1] \) is dense in \( \Pi(\mathbb{R}) \), the space of compact subsets of \( \mathbb{R} \). Furthermore, we show that…