English
Related papers

Related papers: The Complexity of Orbits of Computably Enumerable …

200 papers

The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, $\mathcal{E}$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries:…

Logic · Mathematics 2007-11-21 Peter Cholak , Rod Downey , Leo Harrington

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

Logic · Mathematics 2007-05-23 Peter Cholak , Leo Harrington

We give effective versions of some results on Scott sentences. We show that if $\mathcal{A}$ has a computable $\Pi_\alpha$ Scott sentence, then the orbits of all tuples are defined by formulas that are computable $\Sigma_\beta$ for some…

Logic · Mathematics 2018-07-10 Rachael Alvir , Charles McCoy , Julia Knight

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…

Logic · Mathematics 2015-10-28 Matthew Harrison-Trainor

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

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

Logic · Mathematics 2020-11-10 Matthew Harrison-Trainor

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…

Let $K$ be a number field and $S$ a finite set of places of $K$ that contains all of the archimedean places. Let $\varphi: \mathbb{P}^1 \to \mathbb{P}^1$ be a rational map of degree $d \geq 2$ defined over $K$. Given $\alpha \in…

Number Theory · Mathematics 2026-01-30 Jit Wu Yap

Motivated by relating the representation theory of the split real and $p$-adic forms of a connected reductive algebraic group $G$, we describe a subset of $2^r$ orbits on the complex flag variety for a certain symmetric subgroup. (Here $r$…

Representation Theory · Mathematics 2024-02-29 Leticia Barchini , Peter E. Trapa

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

Logic · Mathematics 2024-11-05 Diego Bejarano

We develop an algorithm for computing the closure of a given nilpotent $G_0$-orbit in $\g_1$, where $\g_1$ and $G_0$ are coming from a $\Z$ or a $\Z/m\Z$-grading $\g= \bigoplus \g_i$ of a simple complex Lie algebra $\g$.

Algebraic Geometry · Mathematics 2015-03-19 W. A. de Graaf , E. B. Vinberg , O. S. Yakimova

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…

Logic · Mathematics 2025-11-07 Rachael Alvir , Barbara Csima , Matthew Harrison-Trainor

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

Building on the classification of modules for algebraic groups with finitely many orbits on subspaces, we determine all faithful irreducible modules for simple and maximal-semisimple connected algebraic groups that are orthogonal and have…

Group Theory · Mathematics 2019-07-17 Aluna Rizzoli

Let $\Aa_t$ be the directed quiver of type $\Aa$ with $t$ vertices. For each dimension vector $d$ there is a dense orbit in the corresponding representation space. The principal aim of this note is to use just rank conditions to define the…

Representation Theory · Mathematics 2015-03-17 Karin Baur , Lutz Hille

Given a countable scattered linear order $L$ of Hausdorff rank $\alpha < \omega_1$ we show that it has a $d\text{-}\Sigma_{2\alpha+1}$ Scott sentence. Ash calculated the back and forth relations for all countable well-orders. From this…

Logic · Mathematics 2021-07-01 Rachael Alvir , Dino Rossegger

We consider aspects of the relationship between nilpotent orbits in a semisimple real Lie algebra $\mathfrak{g}$ and those in its complexification $\mathfrak{g}_{\mathbb{C}}$. In particular, we prove that two distinct real nilpotent orbits…

Algebraic Geometry · Mathematics 2015-05-29 Peter Crooks

Orbits in galaxy bars are generally complex, but simple closed loop orbits play an important role in our conceptual understanding of bars. Such orbits are found in some well-studied potentials, provide a simple model of the bar in…

Astrophysics of Galaxies · Physics 2018-03-14 Curtis Struck

We prove that for a weakly exact magnetic system on a closed connected Riemannian manifold, almost all energy levels contain a closed orbit. More precisely, we prove the following stronger statements. Let $(M,g)$ denote a closed connected…

Dynamical Systems · Mathematics 2016-01-20 Will J. Merry
‹ Prev 1 2 3 10 Next ›