English
Related papers

Related papers: The Solution to Waring's Problem for Monomials

200 papers

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

Classical Analysis and ODEs · Mathematics 2010-02-11 I. Moale , P. Yuditskii

The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…

Computational Complexity · Computer Science 2010-07-19 Zhixiang Chen , Bin Fu

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…

Commutative Algebra · Mathematics 2018-02-23 Abolfazl Tarizadeh

Every quotient R/I of a semigroup ring R by a radical monomial ideal I has a unique minimal injective-like resolution by direct sums of quotients of R modulo prime monomial ideals. The quotient R/I is Cohen-Macaulay if and only if every…

Commutative Algebra · Mathematics 2007-05-23 Ezra Miller

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

Symbolic Computation · Computer Science 2007-05-23 Guillaume Moroz

In this work, the combine the theory of generalized critical values with the theory of iterated rings of bounded elements (real holomorphy rings). We consider the problem of computing the global infimum of a real polynomial in several…

Algebraic Geometry · Mathematics 2007-05-23 Markus Schweighofer

The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic…

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Jan Žemlička

Powers of (monomial) ideals is a subject that still calls attraction in various ways. Let $I\subset \mathbb K[x_1,\ldots,x_n]$ be a monomial ideal and let $G(I)$ denote the (unique) minimal monomial generating set of $I$. How small can…

Commutative Algebra · Mathematics 2019-09-02 Oleksandra Gasanova

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

Algebraic Geometry · Mathematics 2018-04-10 Edoardo Ballico , Alessandro De Paris

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

Commutative Algebra · Mathematics 2025-02-12 Takayuki Hibi , Somayeh Moradi

We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of parametric Bernstein-Sato polynomials associated with certain hypergeometric ideals in the Weyl algebra.

Commutative Algebra · Mathematics 2019-07-31 F. J. Castro-Jiménez , H. Cobo

The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Saenz de Cabezon

Let $I$ be a monomial ideal $I$ in a polynomial ring $R = k[x_1,...,x_r]$. In this paper we give an upper bound on $\overline{\dstab} (I)$ in terms of $r$ and the maximal generating degree $d(I)$ of $I$ such that $\depth R/\overline{I^n}$…

Commutative Algebra · Mathematics 2018-09-21 Le Tuan Hoa , Tran Nam Trung

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…

Commutative Algebra · Mathematics 2022-08-24 Aldo Conca , Manolis C. Tsakiris

Let $M$ be a $(2 \times n)$ non-generic matrix of linear forms in a polynomial ring. For large classes of such matrices, we compute the cohomological dimension (cd) and the arithmetical rank (ara) of the ideal $I_2(M)$ generated by the…

Commutative Algebra · Mathematics 2018-11-12 Davide Bolognini , Alessio Caminata , Antonio Macchia , Maral Mostafazadehfard

This paper is a continuation of a previous work by the author and G. Puninski where iterated intersections of powers of ideals were studied in rings of iterated differential polynomials. We present a method which can be used to show that…

Rings and Algebras · Mathematics 2024-01-15 Pavel Příhoda

All powers of lexsegment ideals with linear resolution (equivalently, with linear quotients) have linear quotients with respect to suitable orders of the minimal monomial generators. For a large subclass of the lexsegment ideals the…

Commutative Algebra · Mathematics 2010-11-10 Viviana Ene , Anda Olteanu

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

General Physics · Physics 2007-05-23 Gordon Chalmers
‹ Prev 1 8 9 10 Next ›