Related papers: Orbits of Polynomial Dynamical Systems Modulo Prim…

We extend our previous work devoted to the computation of the next-to-next-to-leading order spin-orbit correction (corresponding to 3.5PN order) in the equations of motion of spinning compact binaries, by: (i) Deriving the corresponding…

This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver. The algorithm employs a scaling scheme that uses a…

In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H acting completely reducibly on a vector space V: if the orbits containing the vectors a and b have coprime lengths m and n, we prove that the…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

For a prime $p$, positive integers $r,n$, and a polynomial $f$ with coefficients in $\mathbb{F}_{p^r}$, let $W_{p,r,n}(f)=f^n\left(\mathbb{F}_{p^r}\right)\setminus f^{n+1}\left(\mathbb{F}_{p^r}\right)$. As $n$ varies, the $W_{p,r,n}(f)$…

We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…

The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…

In 1930, G. H. Hardy and J. E. Littlewood derived results concerning rates of divergence of certain series involving cosecants. In more recent terminology, one of their results can be interpreted in terms of the behaviour of orbits in a…

It has long been conjectured that generic dynamical systems has finite periodic orbits, ever since the time of Poincar\'e. In this article, a perturbation method is proposed for the $C^r$ closing of periodic orbits. This method is…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

These notes were written during the 9th and 10th sessions of the subject Dynamical Systems II coursed at DTU (Denmark) during the Winter Semester 2015-2016, and later extended in February 2017. They aim to provide students with a…

We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…

Let $a(\lambda)$ and $b(\lambda)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $\lambda$. We study whether there exist infinitely many…

In this paper, we construct two classes of planar polynomial Hamiltonian systems having a center at the origin, and obtain the lower bounds for the number of critical periods for these systems. For polynomial potential systems of degree…

In this paper, we prove a generalization of Green's Hyperplane Restriction Theorem to the case of modules over the polynomial ring, providing in particular an upper bound for the Hilbert function of the general linear restriction of a…

Let f(x) be a continuous function from a compact real interval into itself with a periodic orbit of minimal period m, where m is not an integral power of 2. Then, by Sharkovsky's theorem, for every positive integer n with m \prec n in the…

We prove that a matrix from the split orthogonal group over a polynomial ring with coefficients in a small-dimensional ring can be reduced to a smaller matrix by a bounded number of elementary orthogonal transformations. The bound is given…

This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…