中文
相关论文

相关论文: Bounds and definability in polynomial rings

200 篇论文

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…

代数几何 · 数学 2007-05-23 Carlos D'Andrea , Gabriela Jeronimo

We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Pr\"ufer (in particular B\'ezout) domains whose localizations at maximal ideals have dense value groups. For B\'ezout domains, these…

逻辑 · 数学 2024-12-17 Lorna Gregory , Sonia L'Innocente , Carlo Toffalori

We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…

交换代数 · 数学 2017-12-13 Souvik Dey

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

经典分析与常微分方程 · 数学 2021-04-06 Adam Parusinski , Armin Rainer

Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…

代数几何 · 数学 2007-05-23 Frederic Bihan , J. Maurice Rojas , Casey E. Stella

We prove that Chevalley groups over polynomial rings $\mathbb F_q[t]$ and over Laurent polynomial $\mathbb F_q[t,t^{-1}]$ rings, where $\mathbb F_q$ is a finite field, are boundedly elementarily generated. Using this we produce explicit…

群论 · 数学 2022-05-11 Boris Kunyavskii , Eugene Plotkin , Nikolai Vavilov

Consider a Noetherian domain $R$ and a finite group $G \subseteq Gl_n(R)$. We prove that if the ring of invariants $R[x_1, \ldots, x_n]^G$ is a Cohen-Macaulay ring, then it is generated as an $R$-algebra by elements of degree at most…

交换代数 · 数学 2022-05-30 David Mundelius

Let F and K be fields of characteristic 0, with F a subset of K. Let K[x] denote the ring of polynomials with coefficients in K. For p in K[x]\F[x], deg(p) = n, let r be the highest power of x with a coefficient not in F. We define the F…

经典分析与常微分方程 · 数学 2007-05-23 Alan Horwitz

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

组合数学 · 数学 2018-11-26 Ilya Vyugin

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

符号计算 · 计算机科学 2011-11-10 Jean-Guillaume Dumas

In characteristic zero, Zinovy Reichstein and the author generalized the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative…

环与代数 · 数学 2012-09-19 Nikolaus Vonessen

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

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

数论 · 数学 2019-02-20 Alexei Entin

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

数论 · 数学 2025-12-11 Neil Kolekar

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

概率论 · 数学 2016-08-05 Vladimir V. Ulyanov

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

数论 · 数学 2018-02-06 Arturas Dubickas , Min Sha

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 commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…

交换代数 · 数学 2021-03-30 V. A. Bovdi , L. A. Kurdachenko

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

离散数学 · 计算机科学 2021-04-10 Rachel N. Berman , Ron M. Roth