English
Related papers

Related papers: Ideal Membership in Polynomial Rings over the Inte…

200 papers

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

Combinatorics · Mathematics 2008-11-25 Tewodros Amdeberhan , Richard P. Stanley

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

Number Theory · Mathematics 2025-04-08 Victor Beresnevich , Bethany Dixon

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Commutative Algebra · Mathematics 2019-12-13 John Abbott , Anna Maria Bigatti , Lorenzo Robbiano

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Complex Variables · Mathematics 2016-12-05 D. V. Bogdanov , T. M. Sadykov

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Number Theory · Mathematics 2020-01-29 Jean-Louis Verger-Gaugry , Jaroslav Hancl , Radhakrishnan Nair

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…

Computational Complexity · Computer Science 2013-02-18 Stefan Kratsch

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence $\langle u_n \rangle_{n=0}^\infty$ of rational numbers and a target $t \in \mathbb{Q}$, decide whether $t$ occurs in the sequence. We show…

Logic in Computer Science · Computer Science 2022-05-25 Klara Nosan , Amaury Pouly , Mahsa Shirmohammadi , James Worrell

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

The aim of this note is to discuss the following quite queer Problem: \noindent GIVEN \noindent i) the free non-commutative polynomial ring, ${\Cal P} := {\Bbb F}\langle X_1,\ldots,X_n\rangle$ {\em (public)}, \noindent ii) a bilateral ideal…

Commutative Algebra · Mathematics 2010-06-17 Maria Emilia Alonso , Maria Grazia Marinari , Teo Mora

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

Commutative Algebra · Mathematics 2026-04-21 Noah Walker

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}…

Commutative Algebra · Mathematics 2010-03-30 Apoloniusz Tyszka

We give a new proof of Hilbert's Syzygy Theorem for monomial ideals. In addition, we prove the following. If S=k[x_1,...,x_n] is a polynomial ring over a field, M is a squarefree monomial ideal in S, and each minimal generator of M has…

Commutative Algebra · Mathematics 2017-11-29 Guillermo Alesandroni

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings $\mathbb{F}_q[x]$. In the integer setting, for a given polynomial $F \in \mathbb{Z}[x]$ with constant term zero, (a…

Number Theory · Mathematics 2024-04-29 Anqi Li , Lisa Sauermann

We describe all Mathieu-Zhao spaces of $k[x_1,\cdots,x_n]$ ($k$ is an algebraically closed field of characteristic zero) which contains an ideal of finite codimension. Furthermore we give an algorithm to decide if a subspace of the form…

Commutative Algebra · Mathematics 2019-07-16 Arno van den Essen , Loes van Hove

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Number Theory · Mathematics 2019-11-04 Patrick Letendre

Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm due to effective Nullstellensatz bounds. We identify a…

Computational Complexity · Computer Science 2020-06-16 Abhibhav Garg , Nitin Saxena

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

Commutative Algebra · Mathematics 2025-02-05 Takayuki Hibi , Seyed Amin Seyed Fakhari