中文
相关论文

相关论文: On the reducibility type of trinomials

200 篇论文

A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…

高能物理 - 唯象学 · 物理学 2009-11-11 P. A. Baikov

The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…

综合数学 · 数学 2014-06-03 Anatoly Grinberg

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

数论 · 数学 2024-10-23 Lior Bary-Soroker , Roy Shmueli

Let $q$ be a prime power. We determine all permutation trinomials of $\Bbb F_{q^2}$ of the form $ax+bx^q+x^{2q-1}\in\Bbb F_{q^2}[x]$. The subclass of such permutation trinomials of $\Bbb F_{q^2}$ with $a,b\in\Bbb F_q$ was determined in a…

数论 · 数学 2014-04-08 Xiang-dong Hou

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

数论 · 数学 2024-10-15 Ofir Gorodetsky , Will Sawin

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

最优化与控制 · 数学 2022-04-15 Daniel Bienstock , Alberto del Pia , Robert Hildebrand

The class of self-conjugate-reciprocal irreducible monic (SCRIM) polynomials over finite fields are studied. Necessary and sufficient conditions for monic irreducible polynomials to be SCRIM are given. The number of SCRIM polynomials of a…

环与代数 · 数学 2018-06-11 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

数论 · 数学 2011-04-11 Lenny Jones

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 describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

交换代数 · 数学 2022-05-11 Nicholas Phat Nguyen

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

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

数论 · 数学 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha

Let $f(X)$ be a nonconstant polynomial over $\mathbb{F}_{q}$, with a nonzero constant term. The order of $f(X)$ is a classical notion in the theory of polynomials over finite fields, and recently the definition of freeness of binomials of…

数论 · 数学 2025-10-22 Li Zhu , Hongfeng Wu

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

复变函数 · 数学 2017-04-04 Keisuke Uchimura

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

数论 · 数学 2019-08-29 Yuri Bilu , Florian Luca

We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…

alg-geom · 数学 2007-05-23 Z. Ran

Let $K=\Q(\theta)$ be a number field generated by a complex root $\th$ of a monic irreducible trinomial $F(x) = x^n+ax^{m}+b \in \Z[x]$. In this paper, we deal with the problem of the non-monogenity of $K$. More precisely, we provide some…

数论 · 数学 2023-08-01 Hamid Ben Yakkou

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

数论 · 数学 2017-07-05 Shane Chern