Results 191 to 200 of about 1,404 (215)
Some of the next articles are maybe not open access.

Combinatorial decompositions for monomial ideals

Journal of Symbolic Computation, 2021
The concept of involutive division has been introduced first in the works of \textit{Ch. Riquier} [Les systèmes d'équations aux dérivées partielles. Paris: Gauthier-Villars (1909; JFM 40.0411.01)] and \textit{M. Janet} [Leçons sur les systèmes d'équations aux dérivées partielles. Paris: Gauthier-Villars (1929; JFM 55.0276.01)].
openaire   +2 more sources

Superficial ideals for monomial ideals

Journal of Algebra and Its Applications, 2018
Let [Formula: see text] and [Formula: see text] be two ideals in a commutative Noetherian ring [Formula: see text]. We say that [Formula: see text] is a superficial ideal for [Formula: see text] if the following conditions are satisfied: (i) [Formula: see text], where [Formula: see text] denotes a minimal set of generators of an ideal [Formula: see ...
Rajaee, Saeed   +2 more
openaire   +2 more sources

k-Decomposable Monomial Ideals

Algebra Colloquium, 2015
In this paper we introduce a class of monomial ideals, called k-decomposable ideals. It is shown that the class of k-decomposable ideals is contained in the class of monomial ideals with linear quotients, and when k is large enough, the class of k-decomposable ideals is equal to the class of ideals with linear quotients. In addition, it is shown that a
Rahmati-Asghar, Rahim, Yassemi, Siamak
openaire   +1 more source

Monomial ideals

Journal of Mathematical Sciences, 2007
The author studies the numerical characteristics of monomial ideals in polynomial rings \(A=k[x_1,\ldots x_n]\) and in exterior algebras \(E\) on the same number of variables. In Chapter 2 of the paper, the author generalizes Macaulay's theorem to quotient rings. That is, the author gives conditions on and ideal \(I\) and on ideals \(J\) containing \(I\
openaire   +2 more sources

Irreducible decomposition of monomial ideals

ACM SIGSAM Bulletin, 2005
In this paper we present two algorithms for irreducible decomposition of monomial ideals. We first use staircase structures to study the monomial ideals. We generalize the shifting degrees rule from two variables to three variables and then arbitrary case.
Shuhong Gao, Mingfu Zhu
openaire   +1 more source

Circulant Digraphs and Monomial Ideals

2005
It is known that there exists a Minimum Distance Diagram (MDD) for circulant digraphs of degree two (or double-loop computer networks) which is an L-shape. Its description provides the graph's diameter and average distance on constant time. In this paper we clarify, justify and extend these diagrams to circulant digraphs of arbitrary degree by ...
Domingo Gómez-Pérez   +2 more
openaire   +1 more source

Simplicial Affine Semigroups with Monomial Minimal Reduction Ideals

Mediterranean Journal of Mathematics, 2022
Marco D’Anna   +2 more
exaly  

Monomial Ideals

2011
Jürgen Herzog, Takayuki Hibi
openaire   +2 more sources

On Ideals Whose Radical Is a Monomial Ideal

Communications in Algebra, 2005
Margherita Barile
exaly  

On the stable set of associated prime ideals of a monomial ideal

Archiv Der Mathematik, 2012
Shamila Bayati   +2 more
exaly  

Home - About - Disclaimer - Privacy