Related papers: The Complexity of Orbits of Computably Enumerable …

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…

We give a probabilistic proof of the orbit-counting lemma.

We compute the weighted enumeration of plane partitions contained in a given box with complementation symmetry where adding one half of an orbit of cubes and removing the other half of the orbit changes the weight by -1 as proposed by…

We consider the unitary group $\U$ of complex, separable, infinite-dimensional Hilbert space as a discrete group. It is proved that, whenever $\U$ acts by isometries on a metric space, every orbit is bounded. Equivalently, $\U$ is not the…

A useful crude approximation for Abelian functions is developed and applied to orbits. The bound orbits in the power-law potentials A*r^{-alpha} take the simple form (l/r)^k = 1 + e cos(m*phi), where k = 2 - alpha > 0 and 'l' and 'e' are…

Let $ E $ be a non-empty compact subset of the Riemann sphere and $T$ be a rational map of degree at least two. We study the associated \emph{orbital set}, that is, the backwards orbit of $E$ under $T$, and study the relationship between…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

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…

We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\NP$-hard for any fixed…

A relatively simple algebraic framework is given, in which all the compact symmetric spaces can be described and handled without distinguishing cases. We also give some applications and further results.

For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…

In this paper, we study multi-rotation orbits on the unit circle. We obtain a natural generalization of a classical result which says that orbits of irrational rotations on the unit circle are dense. It is possible to show that this result…

In this paper we investigate the orbit closures for the class of representations of simple algebraic groups associated to various gradings on a simple Lie algebras of type $E_6$, $F_4$ and $G_2$. The methods for classifying the orbits for…

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

In the mathematical framework of a restricted, slightly dissipative spin-orbit model, we prove the existence of periodic orbits for astronomical parameter values corresponding to all satellites of the Solar system observed in exact…

Let $S$ be a closed surface of genus $g\geq 1$, furnished with an area form $\omega$. We show that there exists an open and dense set ${\mathcal O_r}$ of the space of Hamiltonian diffeomorphisms of class $C^r$, $1\leq r\leq\infty$, endowed…

We prove that every unital stably finite simple amenable $C^*$-algebra $A$ with finite nuclear dimension and with UCT such that every trace is quasi-diagonal has the property that $A\otimes Q$ has generalized tracial rank at most one, where…

The article studies a generalization of the elliptic billiard to the complex domain. We show that the billiard orbits also have caustics, and that the number of such caustics is bigger than for the real case. For example, for a given…

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

We prove that every quasi-Hopfian finitely presented structure $A$ has a $d$-$\Sigma_2$ Scott sentence, and that if in addition $A$ is computable and $Aut(A)$ satisfies a natural computable condition, then $A$ has a computable…