中文
相关论文

相关论文: Irreducibility of polynomials defining parabolic p…

200 篇论文

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

交换代数 · 数学 2020-05-12 John Abbott

The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together…

组合数学 · 数学 2013-02-05 Lubomira Balkova

Fix $d \ge 2$ and a field $k$ such that $\mathrm{char}~k \nmid d$. Assume that $k$ contains the $d$th roots of $1$. Then the irreducible components of the curves over $k$ parameterizing preperiodic points of polynomials of the form $z^d+c$…

数论 · 数学 2020-02-19 John R. Doyle , Bjorn Poonen

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

数论 · 数学 2018-02-07 Ron Evans , Mark Van Veen

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

代数几何 · 数学 2008-04-02 Hani Shaker

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

形式语言与自动机理论 · 计算机科学 2026-03-17 Paul C. Bell , Eva Foster , Daniel Reidenbach

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

计算复杂性 · 计算机科学 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

偏微分方程分析 · 数学 2010-10-18 Ekaterina Shemyakova

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

数论 · 数学 2025-09-09 José Cuevas Barrientos , Hector Pasten

Let $\S $ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $\S,$ denoted by…

交换代数 · 数学 2021-08-18 Devendra Prasad

For a polynomial $f$ from a class $\mathcal{C}$ of polynomials, we show that the problem to compute all the constant degree irreducible factors of $f$ reduces in polynomial time to polynomial identity tests (PIT) for class $\mathcal{C}$ and…

计算复杂性 · 计算机科学 2026-03-02 Pranjal Dutta , Amit Sinhababu , Thomas Thierauf

Sums of powers $S_p(n)=\sum_{k=1}^n k^p$ can be described by Faulhaber's formula in terms of the Bernoulli numbers. The first cases of this formula admit visual proofs of various kinds, which lead to factorized Faulhaber polynomials. In…

历史与综述 · 数学 2026-01-28 Urtzi Buijs

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

数论 · 数学 2022-07-19 Bhawesh Mishra

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

组合数学 · 数学 2021-10-14 Zhicheng Gao

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

数论 · 数学 2012-09-11 Rafe Jones

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

数论 · 数学 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

This is a complement to our paper arXiv:0802.1461. We study irreducibility of spectral determinants of some one-parametric eigenvalue problems in dimension one with polynomial potentials.

数学物理 · 物理学 2009-04-13 Alexandre Eremenko , Andrei Gabrielov

This paper continues discussions in the author's previous paper about the Misiurewicz polynomials defined for a family of degree $d \ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. In particular, we…

数论 · 数学 2021-01-26 Minsik Han

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

数论 · 数学 2024-05-08 Lior Bary-Soroker , Daniele Garzoni , Vlad Matei