中文
相关论文

相关论文: Polynomial recurrences and cyclic resultants

200 篇论文

This paper sets out to introduce the generalized derangement polynomials of order $r $. It then proceeds to establish various identities associated with these polynomials, along with providing recurrence relations for derangement…

组合数学 · 数学 2024-02-27 Ghania Guettai , Diffalah Laissaoui , Mourad Rahmani

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

数论 · 数学 2018-07-09 Fusun Akman

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

数论 · 数学 2021-11-18 Grégory Berhuy

A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a finite field, was given by Carlitz in 1967. In 2011 Ahmadi showed that Carlitz's formula extends, essentially without change, to a count of…

数论 · 数学 2023-02-21 Sandro Mattarei , Marco Pizzato

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…

数论 · 数学 2024-11-19 Lenny Jones

This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…

数论 · 数学 2007-05-23 Shujun Li

When $p(t)$ is a polynomial of degree $d$, $k$-th column of the Riordan array $\bigl(1/(1 - t^{d+1}), tp(t)\bigr)$ is an eventually periodic sequence with the repeating part beginning at the $1 + (k-1)(d+1)$-st term. The pre-periodic terms…

组合数学 · 数学 2024-07-30 Nikolai A. Krylov

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

数论 · 数学 2026-02-26 Artyom Radomskii

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)$,…

数论 · 数学 2025-02-10 Lenny Jones

The determinant of a skew-symmetric matrix has a canonical square root given by the Pfaffian. Similarly, the resultant of two reciprocal polynomials of even degree has a canonical square root given by their reciprocant. Computing the…

数论 · 数学 2023-09-12 Matthew Baker

Let $K$ be a number field with ring of integers $\mathcal{O}_K$, and let $f(x)\in\mathcal{O}_K[x]$ be a monic, irreducible polynomial. We establish necessary and sufficient conditions in terms of the critical points of $f(x)$ for the…

数论 · 数学 2025-02-18 Joachim König , Hanson Smith , Zack Wolske

We establish the equidistribution of the sequence of the averaged pullbacks of a Dirac measure at any value in $\mathbb{C}\setminus\{0\}$ under the derivatives of the iterations of a polynomials $f\in\mathbb{C}[z]$ of degree more than one…

复变函数 · 数学 2016-11-16 Yûsuke Okuyama

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

数论 · 数学 2007-05-23 Jack Sonn

Fix an integer $d \geq 2$. The space $\mathcal{P}_{d}$ of polynomial maps of degree $d$ modulo conjugation by affine transformations is naturally an affine variety over $\mathbb{Q}$ of dimension $d -1$. For each integer $P \geq 1$, the…

动力系统 · 数学 2024-12-30 Valentin Huguin

In this paper we study the generalized Clifford algebra defined by Pappacena of a monic (with respect to the first variable) homogeneous polynomial $\Phi(Z,X_1,\dots,X_n)=Z^d-\sum_{k=1}^d f_k(X_1,\dots,X_n) Z^{d-k}$ of degree $d$ in $n+1$…

环与代数 · 数学 2014-06-10 Adam Chapman , Jung-Miao Kuo

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

数论 · 数学 2021-10-01 Shenxing Zhang

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

组合数学 · 数学 2012-09-03 Fabien Durand

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

数论 · 数学 2024-07-03 Cheuk Fung Lau

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

数论 · 数学 2022-11-30 Rin Gotou

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

数论 · 数学 2021-05-18 Simon Kuttner , Qiang Wang