中文
相关论文

相关论文: Definitive Computation of Bernstein-Sato Polynomia…

200 篇论文

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

代数几何 · 数学 2016-10-11 Saugata Basu , Marie-Francoise Roy

We prove that certain classical groups $G\subseteq {\rm GL}(d,\mathbb{R}^d)$ serve to characterize ordinary polynomials in $d$ real variables as elements of finite-dimensional subspaces of $C(\mathbb{R}^d)$ that are invariant by changes of…

经典分析与常微分方程 · 数学 2025-05-23 J. M. Amira , Ya-Qing Hu

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

逻辑 · 数学 2015-10-06 Robert Lubarsky , Fred Richman

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

经典分析与常微分方程 · 数学 2015-04-08 Vladimir Petrov Kostov

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

代数几何 · 数学 2007-05-23 Laurent Busé , Carlos D'Andrea

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Let $D$ be a principal ideal domain with infinite spectrum such that for every nonzero prime ideal $M$ of $D$, the residue field $D/M$ is finite. Let $K$ be the quotient field of $D$. We investigate sets of lengths in the ring of…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

数论 · 数学 2010-08-12 Melsik K. Kyuregyan , Gohar M. Kyureghyan

Denote by P(K, k) the members of the field K which are sums of kth powers of field elements, by P+(K, k) the set of members of K which are sums of kth powers of totally positive elements of K. We are interested in deciding whether or not…

数论 · 数学 2013-03-21 William Ellison

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

代数几何 · 数学 2009-10-16 Arnaud Bodin

Let $K$ be a number field and $f_1,\ldots,f_s\in K[x_1,\ldots,x_n]$ forms of odd degrees. In 1957, Birch proved that if $n$ is sufficiently large then the forms always have a nontrivial zero in $K^n$. Apart from some small degrees, the…

数论 · 数学 2025-12-02 Amichai Lampert , Andrew Snowden , Tamar Ziegler

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

组合数学 · 数学 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

数论 · 数学 2022-10-31 Geoffrey Price , Katherine Thompson

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…

代数几何 · 数学 2016-03-18 Claus Scheiderer

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

数论 · 数学 2022-12-08 Sai Teja Somu , Ting Hon Stanford Li , Andrzej Kukla

We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…

组合数学 · 数学 2026-02-03 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

数论 · 数学 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

逻辑 · 数学 2025-06-18 Pavel Gvozdevsky

We prove the multiplicative Thom-Sebastiani rule for Bernstein-Sato polynomials, answering the longstanding questions of Budur and Popa. We generalize the result to the tensor of two effective divisors on the product of two arbitrary…

代数几何 · 数学 2024-06-11 Quan Shi , Huaiqing Zuo