English
Related papers

Related papers: Parameterizing roots of polynomial congruences

200 papers

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

Symbolic Computation · Computer Science 2021-11-30 Guillaume Moroz

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…

Commutative Algebra · Mathematics 2019-09-24 Susan M. Cooper , Alexandra Seceleanu , Stefan O. Tohaneanu , Maria Vaz Pinto , Rafael H. Villarreal

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Rings and Algebras · Mathematics 2016-10-31 József Vass

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

Number Theory · Mathematics 2023-07-13 G. J. Groenewald , G. Goosen , D. B. Janse van Rensburg , A. C. M. Ran , M. van Straaten

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 study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Thi Xuan Vu

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…

Algebraic Geometry · Mathematics 2021-02-17 Philippe Moustrou , Cordian Riener , Hugues Verdure

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

Commutative Algebra · Mathematics 2024-08-26 Jennifer Biermann , Selvi Kara , Augustine O'Keefe , Joseph Skelton , Gabriel Sosa

A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…

Commutative Algebra · Mathematics 2015-08-04 Ashley K. Wheeler

We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…

Commutative Algebra · Mathematics 2011-11-29 Zur Izhakian , Louis Rowen

A \emph{congruence} on $\mathbb{N}^n$ is an equivalence relation on $\mathbb{N}^n$ that is compatible with the additive structure. If $\Bbbk$ is a field, and $I$ is a \emph{binomial ideal} in $\Bbbk[X_1,\dots,X_n]$ (that is, an ideal…

Commutative Algebra · Mathematics 2020-06-14 Laura Felicia Matusevich , Ignacio Ojeda

In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…

Numerical Analysis · Mathematics 2025-10-20 A. I. Iliev

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

Number Theory · Mathematics 2011-09-13 Ruslan Sharipov

We define a family of ideals $I_h$ in the polynomial ring $\mathbb{Z}[x_1,...,x_n]$ that are parametrized by Hessenberg functions $h$ (equivalently Dyck paths or ample partitions). The ideals $I_h$ generalize algebraically a family of…

Combinatorics · Mathematics 2016-01-07 Aba Mbirika , Julianna Tymoczko

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

Commutative Algebra · Mathematics 2022-01-27 Keller VandeBogert

We study the symbolic powers of square-free monomial ideals via symbolic Rees algebras and methods in prime characteristic. In particular, we prove that the symbolic Rees algebra and the symbolic associated graded algebra are split with…

Commutative Algebra · Mathematics 2019-07-29 Jonathan Montaño , Luis Núñez-Betancourt

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang