Related papers: The Complexity of Orbits of Computably Enumerable …
Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…
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…
Recently we derived the next-to-next-to-leading order post-Newtonian Hamiltonians at spin-orbit and spin(1)-spin(2) level for a binary system of compact objects. In this talk the derivation of them will be shortly outlined at an…
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…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
The aim of this paper is to numerically investigate the orbital dynamics of the circular planar restricted problem of five bodies. By numerically integrating several large sets of initial conditions of orbits we classify them into three…
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
We consider groups of orientation-preserving real analytic diffeomorphisms of the circle which have a finite image under the rotation number function. We show that if such a group is nondiscrete with respect to the $C^1$-topology then it…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
We are concerned with describing the structure of the set of points in the unit interval which, when subjected to rotation by irrational alpha modulo one, for all finite portions of the orbit contain at least as many points in the bottom…
Scott showed that for every countable structure $\mathcal{A}$, there is a sentence of the infinitary logic $\mathcal{L}_{\omega_1\omega}$, called a Scott sentence for $\mathcal{A}$, whose models are exactly the isomorphic copies of…
It is shown that every accessible group which is integrable orbit equivalent to a free group is virtually free. Moreover, we also show that any integrable orbit-equivalence between finitely generated groups extends to their end…
Let $\sigma$ be an involution of a complex semisimple Lie algebra $\mathfrak g$ and $\mathfrak g=\mathfrak g_0\oplus\mathfrak g_1$ the related $\mathbb Z_2$-grading. We study relations between nilpotent $G_0$-orbits in $\mathfrak g_0$ and…
In the study of discrete dynamical systems, we typically start with a function from a space into itself, and ask questions about the properties of sequences of iterates of the function. In this paper we reverse the direction of this study.…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
Let G be a connected reductive linear algebraic group defined over an algebraically closed field of characteristic p. Assume that p is good for G. In this note we classify all the spherical nilpotent G-orbits in the Lie algebra of G. The…
It is shown that the set of orbits of the action of the elementary symplectic transvection group on all unimodular elements of a symplectic module over a commutative ring of characteristic not 2 is identical with the set of orbits of the…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…