English
Related papers

Related papers: Wadge Hardness in Scott Spaces and Its Effectiviza…

200 papers

Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…

Physics and Society · Physics 2020-12-08 Matteo Bruno , Fabio Saracco , Diego Garlaschelli , Claudio J. Tessone , Guido Caldarelli

We prove that any group acting essentially without a fixed point at infinity on an irreducible finite-dimensional CAT(0) cube complex contains a rank one isometry. This implies that the Rank Rigidity Conjecture holds for CAT(0) cube…

Group Theory · Mathematics 2013-04-19 Pierre-Emmanuel Caprace , Michah Sageev

Given a Dedekind incomplete ordered field, a pair of convergent nets of gaps which are respectively increasing or decreasing to the same point is used to obtain a further equivalent criterion for Dedekind completeness of ordered fields:…

General Topology · Mathematics 2007-05-23 Mojtaba Moniri , Jafar S. Eivazloo

In this paper we study the topology of a set naturally arising from the study of $\beta$-expansions. After proving several elementary results for this set we study the case when our base is Pisot. In this case we give necessary and…

Dynamical Systems · Mathematics 2014-01-31 Simon Baker

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

General Topology · Mathematics 2025-07-29 Anton Lipin

In 1972, Dana Scott proved a fundamental result on the connection between order and topology which says that injective $T_0$ spaces are precisely continuous lattices endowed with Scott topology. This paper investigates whether this is true…

General Topology · Mathematics 2021-10-14 Junche Yu , Dexue Zhang

We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…

Logic in Computer Science · Computer Science 2021-02-16 Victor Selivanov

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

Logic · Mathematics 2023-06-22 Oleg Kudinov , Victor Selivanov

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

Logic · Mathematics 2008-03-25 Wesley Calvert , Sergey S. Goncharov , Julia F. Knight

The aim of this paper is twofold. On the one hand, we manage to identify Banach-valued Hardy spaces of analytic functions over the disc $\mathbb{D}$ with other classes of Hardy spaces, thus complementing the existing literature on the…

Functional Analysis · Mathematics 2024-09-10 Fernando Albiac , Jose L. Ansorena

We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…

Algebraic Geometry · Mathematics 2026-05-06 Benjamin Bakker , Thomas W. Grimm , Christian Schnell , Jacob Tsimerman

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

Number Theory · Mathematics 2025-01-30 Felipe García-Ramos , Gerardo González Robert , Mumtaz Hussain

We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…

Logic · Mathematics 2018-12-24 Mayra Montalvo-Ballesteros John Truss

We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…

Logic · Mathematics 2007-10-02 Dominique Lecomte

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Logic · Mathematics 2019-08-29 Fedor Pakhomov

Motivated by the problem of dealing with incomplete or imprecise acquisition of data in computer vision and computer graphics, we extend results concerning the stability of persistent homology with respect to function perturbations to…

Algebraic Topology · Mathematics 2010-05-11 Patrizio Frosini , Claudia Landi

Let $P$ be the image of a period map. We discuss progress towards a conjectural Hodge theoretic completion $\overline{P}$, an analogue of the Satake-Baily-Borel compactification in the classical case. The set $\overline{P}$ is defined and…

Algebraic Geometry · Mathematics 2023-08-16 Mark Green , Phillip Griffiths , Radu Laza , Colleen Robles

We identify a class of symmetric algebras over a complete discrete valuation ring $\mathcal O$ of characteristic zero to which the characterisation of Kn\"orr lattices in terms of stable endomorphism rings in the case of finite group…

Representation Theory · Mathematics 2018-03-16 Florian Eisele , Michael Geline , Radha Kessar , Markus Linckelmann

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

A net $(x_\alpha)$ in a vector lattice $X$ is said to be {unbounded order convergent} (or uo-convergent, for short) to $x\in X$ if the net $(\abs{x_\alpha-x}\wedge y)$ converges to 0 in order for all $y\in X_+$. In this paper, we study…

Functional Analysis · Mathematics 2017-04-24 Niushan Gao