Related papers: Intersections of polynomial orbits, and a dynamica…

We prove a dynamical version of the Mordell-Lang conjecture in the context of Drinfeld modules. We use analytic methods similar to the ones employed by Skolem, Chabauty, and Coleman for studying diophantine equations.

In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…

We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of C. Bender and E. Ben-Naim. We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

We will show that if a dynamical system has enough constants of motion then a Moser-Weinstein type theorem can be applied for proving the existence of periodic orbits in the case when the linearized system is degenerate.

We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…

We develop a theory of polynomials and, in particular, an analog of the theory of Legendre orthogonal polynomials on the bubble-diamond fractals, a class of fractal sets that can be viewed as the completion of a limit of a sequence of…

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

In rational dynamics, we prove the existence of a polynomial that satisfies the Topological Collet-Eckmann condition, but which has a recurrent critical orbit that is not Collet-Eckmann. This shows that the converse of the main theorem in…

In this article, we give an unconditional definition of the motivic analogue of the intersection complex, establish its basic properties, and prove its existence in certain cases.

We prove the dynamical Manin-Mumford conjecture for regular polynomial maps of A^2 and irreducible curves avoiding super-attracting orbits at infinity, over any field of characteristic 0.

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

We prove a few uniform versions of the Mordell-Lang Conjecture and of the Shafarevich Conjecture for curves over function fields and their rational points. The main focus is on function fields having high transcendence degree over the…

This is (mainly) a survey of recent results on the problem of the existence of infinitely many periodic orbits for Hamiltonian diffeomorphisms and Reeb flows. We focus on the Conley conjecture, proved for a broad class of closed symplectic…

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

For a stationary Poisson hyperplane tessellation $X$ in ${\mathbb R}^d$, whose directional distribution satisfies some mild conditions (which hold in the isotropic case, for example), it was recently shown that with probability one every…

We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…