Related papers: A simple algorithm for orbit classification
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresponding points are connected via crossing-free leaders. We…
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 classify generic coadjoint orbits for symplectomorphism groups of compact symplectic surfaces with or without boundary. We also classify simple Morse functions on such surfaces up to a symplectomorphism.
We give a method to determine relative periodic orbits in point vortex systems: it consists mainly into perform a symplectic reduction on a fixed point submanifold in order to obtain a two-dimensional reduced phase space. The method is…
We define the notion of the orbit group of a quandle via its connectivity and compute the orbit groups for some basic quandles. We also show that the orbit group counts the number of orbits of certain quandles.
A simple procedure is developed to determine orbital elements of an object orbiting in a central force field which contribute more than three independent celestial positions. By manipulation of formal three point Gauss method of orbit…
The Circular Restricted Three-Body Problem (CR3BP) models the motion of a massless body under the gravitational influence of two primaries. We present a method for approximating a given family of periodic orbits by low-degree implicit…
In the projective space $\mathrm{PG}(3,q)$, we consider orbits of lines under the stabilizer group of the twisted cubic. In the literature, lines of $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits.…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…
The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…
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 describe an analytical method for computing the orbital parameters of a planet from the periodogram of a radial velocity signal. The method is very efficient and provides a good approximation of the orbital parameters. The accuracy is…
You have a satellite spacecraft or asteroid that moves under the gravitational influence of a massive central body and follows a Keplerian orbit around it ellipse parabola or hyperbola Given measurements of two positions in its orbit what…
Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure…
This article introduces an adaptive sorting algorithm that can relocate elements accurately by substituting their values into a function which we name it the guessing function. We focus on building this function which is the mapping…
In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…