Related papers: Countable real analysis
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…
For a regular, compact, polynomially convex circled set K in C^2, we construct a sequence of pairs {P_n,Q_n} of homogeneous polynomials in two variables with deg P_n = deg Q_n = n such that the sets K_n: = {(z,w) \in C^2 : |P_n(z,w)| \leq…
In this paper, we study the exceptional sets $S_f$ of $p$-adic transcendental analytic functions $f$ with rational and algebraic coefficients. We establish a necessary condition for a subset $S \subseteq \overline{\mathbb{Q}} \cap B(0,…
The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
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…
Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…
Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
We prove that every continuous function $f:E\to Y$ depends on countably many coordinates, if $E$ is an $(\aleph_1,\aleph_0)$-invariant pseudo-$\aleph_1$-compact subspace of a product of topological spaces and $Y$ is a space with a regular…
We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…
This article examines Hilbert spaces constructed from sets whose existence is incompatible with the Countable Axiom of Choice (CC). Our point of view is twofold: (1) We examine what can and cannot be said about Hilbert spaces and operators…
Analyzing the covariance structure of data is a fundamental task of statistics. While this task is simple for low-dimensional observations, it becomes challenging for more intricate objects, such as multivariate functions. Here, the…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and constrained-random verification. In constrained counting,…
We prove that certain quotients of entire functions are characteristic functions. Under some conditions, the probability measure corresponding to a characteristic function of that type has a density which can be expressed as a generalized…
For a function $f\colon [0,1]\to\mathbb R$, we consider the set $E(f)$ of points at which $f$ cuts the real axis. Given $f\colon [0,1]\to\mathbb R$ and a Cantor set $D\subset [0,1]$ with $\{0,1\}\subset D$, we obtain conditions equivalent…
Hamiltonian Monte Carlo has emerged as a standard tool for posterior computation. In this article, we present an extension that can efficiently explore target distributions with discontinuous densities. Our extension in particular enables…
Given a hereditary class $\mathcal{F}$ of finite relational structures, the rank function $\mathsf{rk}:\sigma\mathcal{F}\to\omega_1\cup\{\infty\}$, introduced by Kubi\'{s} and Shelah, measures how far a countable structure is from being…