Related papers: Monogenic period equations are cyclotomic polynomi…

We report extensive computational evidence that Gauss period equations are minimal discriminant polynomials for primitive elements representing Abelian (cyclic) polynomials of prime degrees $p$. By computing 200 period equations up to…

Suppose that $f(x)=x^4+Ax^3+Bx^2+Ax+1\in {\mathbb Z}[x]$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\theta^3\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Let $f(x)=x^4+ax^3+d\in {\mathbb Z}[x]$, where $ad\ne 0$. Let $C_n$ denote the cyclic group of order $n$, $D_4$ the dihedral group of order 8, and $A_4$ the alternating group of order 12. Assuming that $f(x)$ is monogenic, we give necessary…

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…

Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of…

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…

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

In this paper, we study entire solutions of the difference equation $\psi(z+h)=M(z)\psi(z)$, $z\in{\mathbb C}$, $\psi(z)\in {\mathbb C}^2$. In this equation, $h$ is a fixed positive parameter and $M: {\mathbb C}\to SL(2,{\mathbb C})$ is a…

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $n$ that is irreducible over ${\mathbb Q}$ is called cyclic if the Galois group over ${\mathbb Q}$ of $f(x)$ is the cyclic group of order $n$, while $f(x)$ is called monogenic if…

We complete the study of some periods of polynomials in (n+1) variables with (n+2) monomials in computing the behavior of these periods in the natural parameter for such a polynomial.

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Suppose that $f(x)\in {\mathbb Z}[x]$ is monic and irreducible over ${\mathbb Q}$ of degree $N$. We say that $f(x)$ is monogenic if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$,…

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

We present a novel solution method for It\^o stochastic differential equations (SDEs). We subdivide the time interval into sub-intervals, then we use the quadratic polynomials for the approximation between two successive intervals. The main…

Moment estimation for stochastic differential equations (SDEs) is fundamental to the formal reasoning and verification of stochastic dynamical systems, yet remains challenging and is rarely available in closed form. In this paper, we study…

In this paper, we propose a procedure for constructing an infinite number of families of solutions of given linear differential equations with partial derivatives with constant coefficients. We use monogenic functions that are defined on…

We call a polynomial monogenic if a root $\theta$ has the property that $\mathbb{Z}[\theta]$ is the full ring of integers in $\mathbb{Q}(\theta)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any…

We study a new class of McKean-Vlasov stochastic differential equations (SDEs), possibly with common noise, applying the theory of time-inhomogeneous polynomial processes. The drift and volatility coefficients of these SDEs depend on the…