Related papers: The cycle structure of unicritical polynomials

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…

For a simple model of chaotic dynamical systems with a large number of degrees of freedom, we find that there is an ensemble of unstable periodic orbits (UPOs) with the special property that the expectation values of macroscopic quantities…

A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…

We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…

We investigate species-rich mathematical models of ecosystems. While much of the existing literature focuses on the properties of equilibrium fixed points, persistent dynamics (e.g., limit cycles or chaos) have also been observed, both in…

We analyze the density of roots of random polynomials where each complex coefficient is constructed of a random modulus and a fixed, deterministic phase. The density of roots is shown to possess a singular component only in the case for…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of…

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

We consider Riordan arrays $\bigl(1/(1-t^{d+1}), ~ tp(t)\bigr)$. These are infinite lower triangular matrices determined by the formal power series $1/(1-t^{d+1})$ and a polynomial $p(t)$ of degree $d$. Columns of such matrix are eventually…

Let $\phi(x) = x^d + c$ be an integral polynomial of degree at least 2, and consider the sequence $(\phi^n(0))_{n=0}^\infty$, which is the orbit of $0$ under iteration by $\phi$. Let $D_{d,c}$ denote the set of positive integers $n$ for…

In this paper we are concerned with determining lower bounds of the number of limit cycles for piecewise polynomial holomorphic systems with a straight line of discontinuity. We approach this problem with different points of view: study of…

In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

We show that the Circular Orthogonal Ensemble of random matrices arises naturally from a family of random polynomials. This sheds light on the appearance of random matrix statistics in the zeros of the Riemann zeta-function.

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…