Related papers: Time averages of polynomials

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

We describe the topology of a general polynomial mapping $F=(f, g):X\to\Bbb C^2$, where $X$ is a complex plane or a complex sphere.

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

It is proved that the definition of an algebraic set of type ${\sf A}$ (a notion related to the multidimensional Hamburger moment problem) does not depend on the choice of a polynomial describing the algebraic set in question and that an…

Let $M=G/H$ be a compact connected isotropy irreducible Riemannian homogeneous manifold, where $G$ is a compact Lie group (may be, disconnected) acting on $M$ by isometries. This class includes all compact irreducible Riemannian symmetric…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…

Number theorists have studied extensively the connections between the distribution of zeros of the Riemann $\zeta$-function, and of some generalizations, with the statistics of the eigenvalues of large random matrices. It is interesting to…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

The objective of this paper is twofold: (i) to survey existing results of generalized polynomials on time scales, covering definitions and properties for both delta and nabla derivatives; (ii) to extend previous results by using the more…

We answer a question posed by Vitaly Bergelson, showing that in a totally ergodic system, the average of a product of functions evaluated along polynomial times, with polynomials of pairwise differing degrees, converges in $L^{2}$ to the…

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…

Moments of the characteristic polynomial of a random matrix taken from any of the three ensembles, orthogonal, unitary or symplectic, are given either as a determinant or a pfaffian or as a sum of determinants. For gaussian ensembles…

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…