Related papers: Time averages of polynomials

For a jointly measurable probability-preserving action $\tau:\mathbb{R}^D\curvearrowright (X,\mu)$ and a tuple of polynomial maps $p_i:\mathbb{R}\to \mathbb{R}^D$, $i=1,2,...,k$, the multiple ergodic averages \[ \frac{1}{T}\int_0^T…

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is…

Let $S$ be the collection of quadratic polynomial maps, and degree $2$-rational maps whose automorphism groups are isomorphic to $C_2$ defined over the rational field. Assuming standard conjectures of Poonen and Manes on the period length…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2\times C_2\times C_p$. This result, together with the known similar result…

We study the stopping time of the Collatz map for a polynomial $f \in \mathbb{F}_2[x]$, and bound it by $O({\rm deg} (f)^{1.5})$, improving upon the quadratic bound proven by Hicks, Mullen, Yucas and Zavislak. We also prove the existence…

A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

We describe the topology of a general polynomial mapping $f:\Bbb C^2\to\Bbb C^2.$

A natural way of generalising Hamiltonian toric manifolds is to permit the presence of generic isolated singularities for the moment map. For a class of such ``almost-toric 4-manifolds'' which admits a Hamiltonian $S^1$-action we show that…

The theory of zonal polynomials is used to compute the average of a Schur polynomial of argument $AX$, where $A$ is a fixed matrix and $X$ is from the real Ginibre ensemble. This generalizes a recent result of Sommers and Khorozhenko [J.…

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…

Let g be a nonconstant rational map from the projective line to itself that has degree greater than one and is defined over a number field. The map g gives rise to generalized Mahler measures for polynomials in one variable. We use…

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…