Related papers: Linear relations between polynomial orbits
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
We show that polynomial recursions $x_{n+1}=x_{n}^{m}-k$ where $k,m$ are integers and $m$ is positive have no nontrivial periodic integral orbits for $m\geq3$. If $m=2$ then the recursion has integral two-cycles for infinitely many values…
Let G be a (real or complex) linear reductive algebraic group acting on an affine variety V. Let W be a subvariety. In this work we study how the G-orbits intersect W. We develop a criterion to determine when the intersection can be…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Fix $d\geq2$ and let $f_{t}(z)=z^{d}+t$ be the family of polynomials parameterized by $t\in\mathbb{C}$. In this article, we will show that there exists a constant $C(d)$ such that for any $a,b\in\mathbb{C}$ with $a^{d}\neq b^{d}$, the…
For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th…
We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…
In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…
We give new classes of examples of orbits of the diagonal group in the space of unit volume lattices in R^d for d > 2 with nice (homogeneous) orbit closures, as well as examples of orbits with explicitly computable but irregular orbit…
The polynomial invariants $q_d$ for a large class of smooth 4-manifolds are shown to satisfy universal relations. The relations reflect the possible genera of embedded surfaces in the 4-manifold and lead to a structure theorem for the…
We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely…
The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…
We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…
We introduce and prove numerous new results about the orbits of the $T$-fractal billiard. Specifically, in Section 3, we give a variety of sufficient conditions for the existence of a sequence of compatible periodic orbits. In Section 4, we…
This dissertation describes the space of heteroclinic orbits for a class of semilinear parabolic equations, focusing primarily on the case where the nonlinearity is a second degree polynomial with variable coefficients. Along the way, a new…
The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…
We examine affine correspondences of the form g(y)=f(x), for f and g polynomials satisfying deg(g) < deg(f), with the property that every critical point of the correspondence admits at least one finite forward orbit. In the case g(y)=y,…
A class $\mathcal G$ of graphs is $\chi$-bounded if there is a function $f$ such that for every graph $G\in \mathcal G$ and every induced subgraph $H$ of $G$, $\chi(H)\le f(\omega(H))$. In addition, we say that $\mathcal G$ is polynomially…
In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…
In this paper, a sequence of linear combination of $R_{I}$ type polynomials such that the terms in this sequence have a common zero is constructed. A biorthogonality relation arising from such a sequence is discussed. Besides a sequence of…