Related papers: Borel-amenable Reducibilities for Sets of Reals

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Green and Schroll give an easy criterion for a monomial algebra $A$ to be quasi-hereditary with respect to some partial order $\leq_A$. A natural follow-up question is under which conditions a monomial quasi-hereditary algebra $(A, \leq_A)$…

We describe algebraic certificates of positivity for functions belonging to a finitely generated algebra of Borel measurable functions, with particular emphasis to algebras generated by semi-algebraic functions. In which case the standard…

Let $F$ be a free non-abelian group. We show that for any group word $w$ the set $w[F]$ of all values of $w$ in $F$ is rational in $F$ if and only if $w[F] = 1$ or $w[F] = F.$ We generalize this to a wide class of free products of groups.

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

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,…

Let $G$ be a connected reductive algebraic group over an algebraically closed field $k$, and assume that the characteristic of $k$ is zero or a pretty good prime for $G$. Let $P$ be a parabolic subgroup of $G$ and let $\mathfrak p$ be the…

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Let SB be the standard coding for separable Banach spaces as subspaces of $C(\Delta)$. In these notes, we show that if $\mathbb{B} \subset \text{SB}$ is a Borel subset of spaces with separable dual, then the assignment $X \mapsto X^*$ can…

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…

Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each $F_\sigma$ set under it is…

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…

We prove that in a locally finite dimensional Lie algebra L, any maximal, locally solvable subalgebra (Borel subalgebra) is the stabilizer of a maximal, generalized flag in an integrable, faithful module over L.

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…