English
Related papers

Related papers: A Note on Computable Embeddings for Ordinals and T…

200 papers

We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…

Economics · Quantitative Finance 2021-01-21 Lawrence Carr

We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…

Algebraic Topology · Mathematics 2012-04-20 Carl-Friedrich Bödigheimer , Ulrike Tillmann

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Logic · Mathematics 2022-05-03 Nikolay Bazhenov , Dariusz Kalociński

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…

Group Theory · Mathematics 2022-02-23 Gang Chen , Qing Ren

We reconsider non-degenerate second order superintegrable systems in dimension two as geometric structures on conformal surfaces. This extends a formalism developed by the authors, initially introduced for (pseudo-)Riemannian manifolds of…

Differential Geometry · Mathematics 2024-03-15 Jonathan Kress , Konrad Schöbel , Andreas Vollmer

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

Logic in Computer Science · Computer Science 2017-03-16 Marcelo A. Aguilar , Rodolfo Conde

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

Combinatorics · Mathematics 2010-01-19 Jin Ho Kwak , Young Soo Kwon

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In an effort to provide a negative solution to the KEP and motivated by the recent refutation of the Connes…

Logic · Mathematics 2023-03-07 Alec Fox , Isaac Goldbring , Bradd Hart

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable \emph{trivial} measures, where a measure $\mu$ on…

Logic · Mathematics 2015-03-24 Christopher P. Porter

We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…

Operator Algebras · Mathematics 2007-05-23 Alan Hopenwasser , Stephen C. Power

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…

Logic · Mathematics 2025-11-07 Matthew Harrison-Trainor

We compute symmetry algebras of a system of two equations y^(k)=z^(l)=0, where 2<=k<l. It appears that there are many ways to convert such system of ODEs to an exterior differential system. They lead to different series of…

Differential Geometry · Mathematics 2013-07-08 Boris Doubrov , Igor Zelenko

We define and study embeddings of cycles in finite affine and projective planes. We show that for all $k$, $3\le k\le q^2$, a $k$-cycle can be embedded in any affine plane of order $q$. We also prove a similar result for finite projective…

Combinatorics · Mathematics 2013-05-14 Felix Lazebnik , Keith E. Mellinger , Oscar Vega

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

Logic · Mathematics 2016-08-04 Francis Adams , Douglas Cenzer

Rationally convex topological embeddings of compact surfaces (closed or with boundary) into $\mathbb{C}^2$ are constructed.

Complex Variables · Mathematics 2018-11-08 Luke Broemeling , Rasul Shafikov