中文
相关论文

相关论文: Finiteness for Arithmetic Fewnomial Systems

200 篇论文

We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…

交换代数 · 数学 2011-08-25 Christopher J. Hillar , Seth Sullivant

In this paper, we establish some finiteness results about the multiplicative dependence of rational values modulo sets which are `close' (with respect to the Weil height) to division groups of finitely generated multiplicative groups of a…

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

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

数论 · 数学 2022-09-12 Arghya Datta

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

代数拓扑 · 数学 2007-05-23 Y. Felix , S. Halperin , J. -C. Thomas

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

环与代数 · 数学 2007-05-23 A. P. Petravchuk , O. G. Iena

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

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

数论 · 数学 2021-04-08 Jozsef Solymosi , Ethan P. White , Chi Hoi Yip

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

交换代数 · 数学 2010-03-30 Apoloniusz Tyszka

If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). J. I. Brown, K. Dilcher and…

组合数学 · 数学 2007-05-23 Vadim E. Levit , Eugen Mandrescu

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

数论 · 数学 2007-05-23 J. Maurice Rojas

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

数论 · 数学 2015-05-13 Umberto Zannier

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

数论 · 数学 2020-12-15 Daniele Mastrostefano , Carlo Sanna

We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…

交换代数 · 数学 2007-05-23 Holger Brenner

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

交换代数 · 数学 2007-05-23 Matthias Aschenbrenner

Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K <X> /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincar\'{e}-Birkhoff-Witt type basis…

环与代数 · 数学 2016-09-30 Tatiana Gateva-Ivanova , Gunnar Fløystad

Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…

环与代数 · 数学 2007-05-23 V. V. Bavula

We show that the space of harmonic functions on a finitely generated infinite group G is finite dimensional if, and only if, G has a finite-index subgroup isomorphic to the integers. A key tool is Wilkie and van den Dries's quantitative…

群论 · 数学 2013-11-20 Matthew Tointon

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

符号计算 · 计算机科学 2026-05-22 Thi Xuan Vu