Related papers: Self-interacting polynomials

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

In this note, we offer a palatable introduction to the field of arithmetic dynamics. That is, we study the patterns that arise when iterating a polynomial map. This note is accessible to those who have taken an introductory proof based…

This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

A class of two-dimensional superintegrable systems on a constant curvature surface is considered as the natural generalization of some well known one-dimensional factorized systems. By using standard methods to find the shape-invariant…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal…

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

We associate a group $IMG(f)$ to every covering $f$ of a topological space $M$ by its open subset. It is the quotient of the fundamental group $\pi_1(M)$ by the intersection of the kernels of its monodromy action for the iterates $f^n$.…

Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…

We study actions of linear algebraic groups on central simple algebras using algebro-geometric techniques. Suppose an algebraic group G acts on a central simple algebra A of degree n. We are interested in questions of the following type:…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

We extend our earlier work on the compositional structure of cybernetic systems in order to account for the embodiment of such systems. All their interactions proceed through their bodies' boundaries: sensations impinge on their surfaces,…