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

This paper introduces the notion of orbit coherence in a permutation group. Let $G$ be a group of permutations of a set $\Omega$. Let $\pi(G)$ be the set of partitions of $\Omega$ which arise as the orbit partition of an element of $G$. The…

For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…

We conjecture that satellite operations are either constant or have infinite rank in the concordance group. We reduce this to the difficult case of winding number zero satellites, and use $SO(3)$ gauge theory to provide a general criterion…

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…

The P-matrix approach for the determination of the orbit spaces of compact linear groups enabled to determine all orbit spaces of compact coregular linear groups with up to 4 basic polynomial invariants and, more recently, all orbit spaces…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

In this paper, we strengthen a result of Seager regarding the number of orbits of a solvable primitive linear group.

We give examples of groups G such that G^00 is different from G^000. We also prove that for groups G definable in an o-minimal structure, G has a "bounded orbit" iff G is definably amenable. These results answer questions of Gismatullin,…

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

Let $G$ be a connected reductive linear algebraic group over $\C$ with an involution $\theta$. Denote by $K$ the subgroup of fixed points. In certain cases, the $K$-orbits in the flag variety $G/B$ are indexed by the twisted identities…

We study a simple analytic solution to Einstein's field equations describing a thin spherical shell consisting of collisionless particles in circular orbit. We then apply two independent criteria for the identification of circular orbits,…

The finite orbits of the braid group action on Stokes matrices are studied and are shown to be the orbits on ordered sets of reflections, generating finite groups. All invariants of a reflection arrangement are determined. Determination of…

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…

This study first defines a new metric with normal structure on C(H,K) and then a new technique to prove fixed point theorems for families of non-expansive maps on this metric space. Indeed, it shows that the presence of a bounded orbit…

Functions which are covariant or invariant under the transformations of a compact linear group $G$ acting in a euclidean space $\real^n$, can be profitably studied as functions defined in the orbit space of the group. The orbit space is the…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.