Marcel Moralès
YOU?
Author Swipe
View article: Factor-critical graphs and dstab, astab for an edge ideal
Factor-critical graphs and dstab, astab for an edge ideal Open
Let $G$ be a simple, connected non bipartite graph and let $I_G$ be the edge idealof $G$. In our previous work we showed that L. Lovász's theorem on ear decompositions offactor-critical graphs and the canonical decomposition of a graph giv…
View article: Frontmatter
Frontmatter Open
Collection dirigée par Michèle Gandit et
View article: SYMMETRIC AND ALMOST SYMMETRIC SEMIGROUPS GENERATED BY AN ALMOST GENERALIZED ARITHMETIC SEQUENCE, FROBENIUS NUMBER
SYMMETRIC AND ALMOST SYMMETRIC SEMIGROUPS GENERATED BY AN ALMOST GENERALIZED ARITHMETIC SEQUENCE, FROBENIUS NUMBER Open
Let $a, d, k,h, c$ be positive integers. Recall that a {\it numerical almost generalized arithmetic sequence-semigroup } (numerical AAG-semigroup for short) is a semigroup minimally generated by relatively prime integers $a, ha+d, ha+2d, \…
View article: Irreducible decomposition of powers of edge ideals
Irreducible decomposition of powers of edge ideals Open
View article: Noether resolutions in dimension 2
Noether resolutions in dimension 2 Open
View article: A Study of the Length Function of Generalized Fractions of Modules
A Study of the Length Function of Generalized Fractions of Modules Open
Let be a Noetherian local ring and let M be a finitely generated R -module of dimension d . Let be a system of parameters of M and let be a d -tuple of positive integers. In this paper we study the length of generalized fractions M (1/( x …
View article: Regularity and Free Resolution of Ideals Which Are Minimal To $d$-Linearity
Regularity and Free Resolution of Ideals Which Are Minimal To $d$-Linearity Open
For given positive integers $n\geq d$, a $d$-uniform clutter on a vertex set $[n]=\{1,\dots,n\}$ is a collection of distinct $d$-subsets of $[n]$. Let $\mathscr{C}$ be a $d$-uniform clutter on $[n]$. We may naturally associate an ideal $I(…
View article: Veronese transform and Castelnuovo--Mumford regularity of modules
Veronese transform and Castelnuovo--Mumford regularity of modules Open
International audience
View article: Gröbner basis. A new algorithm for computing the Frobenius number
Gröbner basis. A new algorithm for computing the Frobenius number Open
Let consider $n$ natural numbers $a_1 ,\ldots , a_{n} $. Set $A=K[t^{a_1}, \ldots , t^{a_n}]=K[{x_1}, \ldots , {x_n}]/I$.
Our aim is to describe explicitly:
* The \gbb of $I$ for the reverse lexicographic order to $x_n,\ldots ,x_…
View article: Gr{ö}bner basis. a "pseudo-polynomial" algorithm for computing the Frobenius number
Gr{ö}bner basis. a "pseudo-polynomial" algorithm for computing the Frobenius number Open
Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is: \begin{enum…
View article: Castelnuovo–Mumford regularity and Segre–Veronese transform
Castelnuovo–Mumford regularity and Segre–Veronese transform Open
In this paper we give a nice formula for the Castelnuovo–Mumford regularity of the Segre product of modules, under some suitable hypotheses. This extends recent results of David A. Cox, and Evgeny Materov (2009).