Related papers: Time averages of polynomials

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

By definition, a map quasiperiodic on a set $X$ if the map is conjugate to a pure rotation. Suppose we have a trajectory $(x_n)$ that we suspect is quasiperiodic. How do we determine if it is? In this paper we show how to compute the…

We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…

We examine the convergence of ergodic averages along polynomials in Toeplitz systems and prove that it is possible for averages along one polynomial to converge, and along another to diverge. We also study density of the polynomial orbits…

We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…

In this paper, we prove the equidistribution of periodic points of a regular polynomial automorphism f : A^n -> A^n defined over a number field K: let f be a regular polynomial automorphism defined over a number field K and let v be a prime…

We consider a class of nonlinear mappings $\mathsf{F}_{A,N}$ in $\mathbb{R}^N$ indexed by symmetric random matrices $A\in\mathbb{R}^{N\times N}$ with independent entries. Within spin glass theory, special cases of these mappings correspond…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal…

Given two one-dimensional families $f$ and $g$ of regular plane polynomial automorphisms parameterised by an algebraic curve $B$, all defined over some number field $K$, such that one of them is dissipative, we prove that at any parameter…

Two continuous maps $f, g : \mathbb{C}^2\to\mathbb{C}^2$ are said to be topologically equivalent if there exist homeomorphisms $\varphi,\psi:\mathbb{C}^2\to\mathbb{C}^2$ satisfying $\psi\circ f\circ\varphi = g$. It is known that there are…

Let $f,g:X \to Y$ be continuous mappings. We say that $f$ is topologically equivalent to $g$ if there exist homeomorphisms $\Phi : X\to X$ and $\Psi: Y\to Y$ such that $\Psi\circ f\circ \Phi=g.$ Let $X,Y$ be complex smooth irreducible…

Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…

We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

We establish the equidistribution of the sequence of the averaged pullbacks of a Dirac measure at any value in $\mathbb{C}\setminus\{0\}$ under the derivatives of the iterations of a polynomials $f\in\mathbb{C}[z]$ of degree more than one…

We establish asymptotic formulae for general joint moments of characteristic polynomials and their higher-order derivatives associated with matrices drawn randomly from the groups $\mathrm{USp}(2N)$ and $\mathrm{SO}(2N)$ in the limit as…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…