相关论文: Simuorb: a new method for generating and describin…

The intention of this article is to illustrate the use of methods from symplectic geometry for practical purposes. Our intended audience is scientists interested in orbits of Hamiltonian systems (e.g. the three-body problem). The main…

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Imaging a star's companion at multiple epochs over a short orbital arc provides only four of the six coordinates required for a unique orbital solution. Probability distributions of possible solutions are commonly generated by Monte Carlo…

In the framework of the semiclassical approach the universal spectral correlations in the Hamiltonian systems with classical chaotic dynamics can be attributed to the systematic correlations between actions of periodic orbits which (up to…

As a topic of mathematics, "arrangements", systems of hyperplanes, circles, and general (regular) submanifolds, attract us strongly. We present a natural elementary study of arrangements of circles. It is also a kind of new studies. Our…

A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…

Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…

We provide topological obstructions to the existence of orbit cylinders of symmetric orbits, for mechanical systems preserved by antisymplectic involutions (e.g. the restricted three-body problem). Such cylinders induce continuous paths…

The analysis performed as well as extensive numerical simulations have revealed the possibility of the generation of homoclinic orbits as a result of homoclinic bifurcation in a porous pellet. A method has been proposed for the development…

For families of 4-regular directed circulant graphs with $n$ vertices, we count the number of primitive periodic orbits of length up to at least $n$. The relevant counting techniques are then extended to count the number of primitive pseudo…

In this paper, we propose a method to cluster multiple intersected manifolds. The algorithm chooses several landmark nodes randomly and then checks whether there is an angle constrained path between each landmark node and every other node…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

We study perimeters of connecting cycles for concentric circles. More precisely, we are interested in characterization of those connecting cycles which are critical points of perimeter considered as a function on the product of given…

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an…

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…