相关论文: On the Orbits of Computably Enumerable Sets

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, $\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: the…

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

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…

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}$)…

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…

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…

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…

Soare proved that the maximal sets form an orbit in $\mathcal{E}$. We consider here $\mathcal{D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer. Some orbits of $\mathcal{D}$-maximal sets are well…

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…

We show that every point $x_0\in [0,1]$ carries a representation of a $C^*$-algebra that encodes the orbit structure of the linear mod 1 interval map $f_{\beta,\alpha}(x)=\beta x +\alpha$. Such $C^*$-algebra is generated by partial…

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…

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

In this paper, we study the configuration space of orbits, a generalization of the configuration space of points but for algebraic varieties that are acted by an algebraic reductive group. The main objective of this work is to study the…

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…

We obtain a computable structure of Scott rank omega_1^{CK} (call this ock), and give a general coding procedure that transforms any hyperarithmetical structure A into a computable structure A' such that the rank of A is ock, ock+1, or <…

Let N \subseteq M be von Neumann algebras and E:M\to N a faithful normal conditional expectation. In this work it is shown that the similarity orbit S(E) of E by the natural action of the invertible group of G_M of M has a natural complex…

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

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$.