English
Related papers

Related papers: Long Borel Hierarchies

200 papers

The Favard length of a Borel set $E\subset\mathbb{R}^2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This…

Classical Analysis and ODEs · Mathematics 2024-08-08 Damian Dąbrowski

This note presents a general theorem about the cohomology of finite dimensional Lie algebras of arbitrary characteristic. As an application we compute the cohomology of the Borel subalgebra of sl(N).

Representation Theory · Mathematics 2012-08-03 Murray Gerstenhaber

Under $\mathrm{ZF}$, we show that the statement that every subset of every $\mathbb{R}$-vector space has a maximal convex subset is equivalent to the Axiom of Choice. We also study the strength of the same statement restricted to some…

Logic · Mathematics 2026-03-18 Yasuo Yoshinobu

We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove…

Logic · Mathematics 2009-08-04 Olivier Finkel , Dominique Lecomte

We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…

Logic · Mathematics 2022-09-16 Michael C. Laskowski , Danielle S. Ulrich

Following \cite{citeSavelyevVirtualMorsetheoryon$Omega$Ham$(Momega)$.}, we develop here a connection between Morse theory for the (positive) Hofer length functional $L: \Omega \text {Ham}(M, \omega) \to \mathbb{R}$, with Gromov-Witten/Floer…

Symplectic Geometry · Mathematics 2014-04-22 Yasha Savelyev

We show that if $E$ is a countable Borel equivalence relation on $\mathbb{R}^n$, then there is a closed subset $A \subset [0,1]^n$ of Hausdorff dimension $n$ so that $E \restriction A$ is smooth. More generally, if $\leq_Q$ is a locally…

Logic · Mathematics 2024-10-30 Andrew Marks , Dino Rossegger , Theodore Slaman

A lot of good properties of etale cohomology only hold for torsion coefficients. We use "enlargement of categories" as developed in http://arxiv.org/abs/math.CT/0408177 to define a cohomology theory that inherits the important properties of…

Algebraic Geometry · Mathematics 2007-05-23 Lars Brünjes , Christian Serpé

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

Logic · Mathematics 2022-01-13 J. P. Aguilera , F. Pakhomov , A. Weiermann

Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to show that O_G can never be countably infinite. This paper retrieves correct parts of the…

Group Theory · Mathematics 2014-02-26 Peter A. Linnell

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

Logic · Mathematics 2013-03-12 Toshiyasu Arai

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

Combinatorics · Mathematics 2025-12-25 Ryan Alweiss

We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…

Logic · Mathematics 2023-11-09 Nikolay Bazhenov , Vittorio Cipriani , Luca San Mauro

In 2020, Calderoni, Marker, Motto Ros and Shani asked what the Borel complexity of the isomorphism relation of Archimedean orders on $\mathbb{Q}^n$ is. We answer this question by proving that the isomorphism relation of Archimedean orders…

Logic · Mathematics 2024-03-19 Antoine Poulin

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

Combinatorics · Mathematics 2020-02-24 Laurent Lyaudet

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

Logic · Mathematics 2014-12-31 John D. Clemens , Dominique Lecomte , Benjamin D. Miller

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

Logic · Mathematics 2015-06-10 Barbara Csima , Matthew Harrison-Trainor

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

We prove that, for $1 \le p<q<\infty$, the partially ordered set $P(\omega)/{\rm Fin}$ can be embedded into Borel equivalence relations between $\mathbb{R}^\omega/\ell_p$ and $\mathbb{R}^\omega/\ell_q$. Since there is an antichain of size…

Logic · Mathematics 2013-10-21 Zhi Yin

Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells…

Logic · Mathematics 2023-06-22 Merlin Carl , Benjamin Rin , Philipp Schlicht
‹ Prev 1 8 9 10 Next ›