Related papers: Time averages of polynomials

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

We make a detailed investigation of the generic properties that polynomial mappings possess. An important starting point is the work by Farnik, Jelonek and Ruas in 2019, where they prove some of those properties in the context of…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to…

Let $f=(f_1,\ldots,f_n)$ be a system of $n$ complex homogeneous polynomials in $n$ variables of degree $d$. We call $\lambda\in\mathbb{C}$ an eigenvalue of $f$ if there exists $v\in\mathbb{C}^n\backslash\{0\}$ with $f(v)=\lambda v$,…

If f is a polynomial with integer coefficients and q is an integer, we may regard f as a map from Z/qZ to Z/qZ. We show that the distribution of the (normalized) spacings between consecutive elements in the image of these maps becomes…

It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…

We use Wagner's algorithm to estimate the number of periodic points of certain selfmaps on compact surfaces with boundary. When counting according to homotopy classes, we can use the asymptotic density to measure the size of sets of…

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

I investigate a class of dynamical systems in which finite pieces of spacetime contain finite amounts of information. Most of the guiding principles for designing these systems are drawn from general relativity: the systems are…

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…

We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…

We study the images of polynomial maps over algebraically closed division rings. Our first result generalizes the classical Ax-Grothendieck theorem: We show that if $ f_1, \ldots, f_m $ are elements of the free associative algebra $…

We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.

Let $f\colon X\to X$ be a dominant meromorphic self-map of a compact complex variety $X$ in the Fujiki class $\mathcal{C}$. If the topological degree of $f$ is strictly larger than the other dynamical degrees of $f$, we show that the number…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

It is well known that the multiplier ideal $\multr{I}$ of an ideal $I$ determines in a straightforward way the multiplier ideal $\multr{f}$ of a sufficiently general element $f$ of $I$. We give an explicit condition on a polynomial $f \in…

Time does not obviously appear amongst the coordinates on the constrained phase space of general relativity in the Hamiltonian formulation. Recent work in finite-dimensional models claims that topological obstructions generically make the…